{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::handle_foundry_cheatcode (cyclomatic 244): SymbolicExecutor::handle_foundry_cheatcode has cyclomatic complexity 244 (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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc07dcaf4933c05375833c4fa17c2cb05d2ddeffe834b892635a9b248c8493f"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::args::run_command (cyclomatic 215): cast::args::run_command has cyclomatic complexity 215 (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":"crates/cast/src/args.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d248b346caa60e816d340f48e4397d42ecbbf438ee5366adbe80da96f52305"}},{"ruleId":"D1","level":"warning","message":{"text":"EthApi::execute (cyclomatic 191): EthApi::execute has cyclomatic complexity 191 (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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51aa04886ed0198fac84318df5cc3e91041b87e4ade10a065bc00489ebb7c92"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::step (cyclomatic 175): SymbolicExecutor::step has cyclomatic complexity 175 (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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e80bae88792c495c28f375723e55f8adb7178f88fbb9c629c35584e5bf2a6ee"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::run_invariant_test (cyclomatic 110): FunctionRunner::run_invariant_test has cyclomatic complexity 110 (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":"crates/forge/src/runner.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee4056bd69e5c79e437214067fa41aacabafe8877b4d78c230adc0569df175"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::check_mem_opcodes (cyclomatic 105): Cheatcodes::check_mem_opcodes has cyclomatic complexity 105 (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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6edaf8e28387cf29ef14d9ee45d86daaa52083ea159bf4dd49a4212c0280ea"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::call_concrete_target (cyclomatic 100): SymbolicExecutor::call_concrete_target has cyclomatic complexity 100 (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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe3db80941e684cea4078b968295b6b9c5ac81c4c7d75d38ed66de4720618d5"}},{"ruleId":"D1","level":"warning","message":{"text":"InvariantExecutor::run_invariant_worker (cyclomatic 95): InvariantExecutor::run_invariant_worker has cyclomatic complexity 95 (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":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46cce765170ec56d5fc0d3b8c987be4bd966224cc4b45e3f15dc1b27c236e47"}},{"ruleId":"D1","level":"warning","message":{"text":"BundledState::broadcast (cyclomatic 94): BundledState::broadcast has cyclomatic complexity 94 (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":"crates/script/src/broadcast.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b12a1ad2737cdc2fdfce59403e6a43de39bbae8ae78f965eb0e7e55fb0e275e"}},{"ruleId":"D1","level":"warning","message":{"text":"WalletSubcommands::run (cyclomatic 84): WalletSubcommands::run has cyclomatic complexity 84 (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":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bdd7b1bbd3a4f8f54b1712d3270be0be82a67610f7c13a8064833b375e249f"}},{"ruleId":"D1","level":"warning","message":{"text":"SymExpr::binop (cyclomatic 80): SymExpr::binop has cyclomatic complexity 80 (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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd19cae0ba4f86b5a0a3b159c435682447719deb99dacf5330bc0cc3bb14604b"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::simulate_raw (cyclomatic 65): Backend::simulate_raw has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":9386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed1b1356b15fcae3a192e48e3c95a9e150376c8ea460a2f38f8dd80960f2c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_comment (cyclomatic 64): State::print_comment has cyclomatic complexity 64 (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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2b6e8849b082052e60edd414e3451d9287f3e32ca3e667185113db48f6d06d"}},{"ruleId":"D1","level":"warning","message":{"text":"CallArgs::run_with_network_and_opts (cyclomatic 61): CallArgs::run_with_network_and_opts has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"12523d683dc69369250a1eac638202edaf5958b283de3d40b61afe603c46e7cf"}},{"ruleId":"D1","level":"warning","message":{"text":"VerifyBytecodeArgs::prepare_runtime_verification (cyclomatic 58): VerifyBytecodeArgs::prepare_runtime_verification has cyclomatic complexity 58 (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":"crates/verify/src/bytecode.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d5df97f921dfe359b0eaef162c52cf36c5171feea9dd2f9c2f8f7ed7477490"}},{"ruleId":"D1","level":"warning","message":{"text":"anvil::eth::error::blockchain_error_to_rpc_result (cyclomatic 56): anvil::eth::error::blockchain_error_to_rpc_result has cyclomatic complexity 56 (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":"crates/anvil/src/eth/error/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bbfde495b9968e855b8f37769dde157a0aa30214692738750db0ccf6f58d78"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtArgs::run (cyclomatic 56): FmtArgs::run has cyclomatic complexity 56 (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":"crates/forge/src/cmd/fmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f343a3d607771540e7330deb8ddee047e8a3ba8ce03183852ddc55ce0145ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"BundledState::broadcast_batch (cyclomatic 55): BundledState::broadcast_batch has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"19768ab476f523fb383d9aad6778dd999c20f3afd763b8433e575cecb55cd781"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::args::run_command (cyclomatic 54): forge::args::run_command has cyclomatic complexity 54 (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":"crates/forge/src/args.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8f060dbc302568800fd7872a58b2a47d836e02cdc7528e7d958b23837e162e"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::call_with_executor (cyclomatic 53): Cheatcodes::call_with_executor has cyclomatic complexity 53 (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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80b91c2fd5fdc8cb4e376101d51a944971183dc35a23f737093e95ab3b1568f"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectorsSubcommands::run (cyclomatic 53): SelectorsSubcommands::run has cyclomatic complexity 53 (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":"crates/forge/src/cmd/selectors.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a0216effbdd8c4ddd96a32667b89aceed7d49907640096c9e712c82311b3f6"}},{"ruleId":"D1","level":"warning","message":{"text":"State::commasep (cyclomatic 52): State::commasep has cyclomatic complexity 52 (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":"crates/fmt/src/state/common.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32bc645554dd8f8b21ff8efb0ab3a5c36e0d1a364630a06d709f49e399a9c37"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::try_seed_invariant_corpus_from_frontiers (cyclomatic 50): FunctionRunner::try_seed_invariant_corpus_from_frontiers has cyclomatic complexity 50 (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":"crates/forge/src/runner.rs"},"region":{"startLine":3378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e045923d2abe107fa260e75322d079ee34886ea6d9c6f6c011e920a11589b26a"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::evm::get_recorded_state_diffs (cyclomatic 49): foundry_cheatcodes::evm::get_recorded_state_diffs has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56c5bfec415c0479ead02a48cc6c49235962aef553052556a95ebce5d049fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"SymBoolExpr::cmp (cyclomatic 48): SymBoolExpr::cmp 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":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b46765662aac0e4e7471f18aa060025aeef57403d07654c5b76f8f890e2ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::call_end_hook (cyclomatic 47): Cheatcodes::call_end_hook 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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c1eec6f153e26e8daa5141d9f083231f6f67f1a7f4283e9d632331edc1ec95"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorStackRefMut::transact_inner (cyclomatic 47): InspectorStackRefMut::transact_inner has cyclomatic complexity 47 (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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f26730b3916b8e72c880ce0c9584e3ec925672fc751496198732381bc594f5e"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmark_clickhouse.build_rows (cyclomatic 47): benchmark_clickhouse.build_rows 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":".github/scripts/benchmark_clickhouse.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30b1ce512fb166d0f3b21934c724b7cc3c4a79a4690781b0eee0b73c72ccc8"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::validate_pool_transaction_for (cyclomatic 46): Backend::validate_pool_transaction_for has cyclomatic complexity 46 (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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":10607}}}],"partialFingerprints":{"codehealthFindingId/v1":"381175e60883ced7835c2de3b5ecad4516dfddfef4f29fdbd270c988ef7c8c00"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_doc::render::render_contract (cyclomatic 46): forge_doc::render::render_contract 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":"crates/doc/src/render.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d329e44ca86ac624df6ca87da38b747ed43077f41c569dfce3f50215681e563"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_function (cyclomatic 46): State::print_function has cyclomatic complexity 46 (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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6d192f8f1b72cdc6042c8a2274385d6960811199d5baf09da20f6f95ed517f"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::expr_inner (cyclomatic 45): Checker::expr_inner 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":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b7276f654412c485bcaea3c93da4b868cb35891fa708f21f1ed3a485cabd24"}},{"ruleId":"D1","level":"warning","message":{"text":"SendTxArgs::run_generic_inner (cyclomatic 44): SendTxArgs::run_generic_inner has cyclomatic complexity 44 (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":"crates/cast/src/cmd/send.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6d03c446de110b13214ae50e10e84395bca5c66f121de32d23edf6c8030b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::load_state (cyclomatic 42): Backend::load_state has cyclomatic complexity 42 (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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":8839}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db04647127c4c5d5c9e34296d440736122982508d3cff4316e2b568e2a5db98"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::cmd::clone::update_config_by_metadata (cyclomatic 42): forge::cmd::clone::update_config_by_metadata has cyclomatic complexity 42 (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":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aec81896f5465c02ec489acbf11afbd772bc6d3825732cb138bec1904b661d"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_expr (cyclomatic 41): State::print_expr has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7b56dd70992b0a15c54670b81400bc5f82cbee649c448954852e1db6660a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::replay_symbolic_artifact (cyclomatic 40): FunctionRunner::replay_symbolic_artifact has cyclomatic complexity 40 (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":"crates/forge/src/runner.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5362bbf4401cb3e503e6bdf0e38982a60d71a4a7f2025005543f9875c607b54c"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::stmt (cyclomatic 40): Checker::stmt has cyclomatic complexity 40 (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":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e6c6480ed78fd277f2a84b14ec7abc3692ff4cf830c1b7435cbe07a521c6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm::executors::showmap::replay_corpus_to_showmap (cyclomatic 39): foundry_evm::executors::showmap::replay_corpus_to_showmap 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":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c505b994e0eab6051adb7ac999c59457f338e66776c83928d5665886d1d9184"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::call_symbolic_target (cyclomatic 39): SymbolicExecutor::call_symbolic_target 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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"62effd629c0add9ef5e98caf7d4627d5b2bcf11dc4cb651a0a1740bf38da64fb"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::fallback::checked_mul_guard_branch_model (cyclomatic 39): foundry_evm_symbolic::runtime::solver::fallback::checked_mul_guard_branch_model 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":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5229a4c1b791f315e38dc093c0c61125a4f09bb33740a3a3071cf5f8755a65"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateArgs::deploy (cyclomatic 39): CreateArgs::deploy 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":"crates/forge/src/cmd/create.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48cd3e370ab0b7a877c3472bb67377c132e35cfa5dcf229119557b480665c63"}},{"ruleId":"D1","level":"warning","message":{"text":"ListArgs::run (cyclomatic 38): ListArgs::run has cyclomatic complexity 38 (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":"crates/cast/src/cmd/wallet/list.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d800e191c4bc3dae4384098493b78411c429cfda5075c82f8ab33c065760abab"}},{"ruleId":"D1","level":"warning","message":{"text":"RemappingsProvider::get_remappings (cyclomatic 38): RemappingsProvider::get_remappings has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a75cd2a19a979965ec79fcc059048cfdd0c844b2171f36a8046b8373a8f89f3"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::execute_call_path_batch (cyclomatic 38): SymbolicExecutor::execute_call_path_batch 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":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"01307b87ed5232fc15c9acdd93c6fac0a907a7d004c0648cadaaeaff239279c3"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_assign_rhs (cyclomatic 38): State::print_assign_rhs 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd20520cc1dbf06db5d719c7cf7bd4901ab3fafad48a6479fcdc37e063b2ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectArgs::run (cyclomatic 38): InspectArgs::run has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"866d6f9058a38683982b9e56386b692e1ac508a3f569df4fa3425e42ecd3f6da"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractRunner::run_tests (cyclomatic 38): ContractRunner::run_tests has cyclomatic complexity 38 (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":"crates/forge/src/runner.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"28662e696e2db7b467dc57a3fc327d0d839dfeb2ac1f6f710a771a25df3a1b73"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::call (cyclomatic 37): SymbolicExecutor::call 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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"560af116fb1459cc4b68dc1985376eb71a75c67adfdcd685f431296e68acb455"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateArgs::run (cyclomatic 37): UpdateArgs::run 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":"crates/forge/src/cmd/update.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b43584c3479de7b1d2771901a80c9954424480a41edb4cb9bb8582966c3ded"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::mutation::orchestrator::run_mutation_testing (cyclomatic 37): forge::mutation::orchestrator::run_mutation_testing 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":"crates/forge/src/mutation/orchestrator.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5da5e26bae1d4957f41460285bcd492eb1b674f12c077ff70b5e47770b1aaa4"}},{"ruleId":"D1","level":"warning","message":{"text":"MakeTxArgs::run_generic (cyclomatic 36): MakeTxArgs::run_generic has cyclomatic complexity 36 (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":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0ce84d8a5c6498456f8ff3f0ffc10a1b06793a0bb0b20072a982300aea2715"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::create (cyclomatic 36): SymbolicExecutor::create has cyclomatic complexity 36 (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":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"88471fc520b93dff083fef12405e17b50d4e8677b1d2df3e093b4ea05d6f906e"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::fs::get_artifact_source (cyclomatic 34): foundry_cheatcodes::fs::get_artifact_source 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":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be47100a86cc95420a6c806efa2c71c35883825a1215e3b942ce83c5fcc7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"CallTraceDecoder::decode_cheatcode_inputs (cyclomatic 34): CallTraceDecoder::decode_cheatcode_inputs 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":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"392bf9e225a47a2cdd5ee6414d73b35a559c41c932ea10e0f7b1004f1d823deb"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::analyze_expr (cyclomatic 34): Analyzer::analyze_expr 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":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffcd120373d60cc6260a36ccbebf4ffbdb8488f4a98e8bf191083e934a15c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_script::owner_approvals::prepare (cyclomatic 34): forge_script::owner_approvals::prepare 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":"crates/script/src/owner_approvals.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d42a3dd7a3d9a78b2325861c0f3daa251fd3496029fefd00525722e5bf1a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractsByArtifact::find_by_deployed_code_exact_inner (cyclomatic 33): ContractsByArtifact::find_by_deployed_code_exact_inner has cyclomatic complexity 33 (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":"crates/common/src/contracts.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76c94270c185535131902cba85e3667f8d5543533b35e6fb0f05b003a9ada3a"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryAnalyzer::analyze_expr (cyclomatic 32): EntryAnalyzer::analyze_expr has cyclomatic complexity 32 (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":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c8fa78b90ab759433cafe614157d419b34d2a5791a6ad8f438ac5adf0454b6"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorStackRefMut::call (cyclomatic 31): InspectorStackRefMut::call has cyclomatic complexity 31 (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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25ca466925e7331d5b5f60085d40e77d29004c860dead2a5b241c4d5310c08f"}},{"ruleId":"D1","level":"warning","message":{"text":"PathState::expr_upper_bound_usize_cached (cyclomatic 31): PathState::expr_upper_bound_usize_cached has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82cee1840bd5897bbec8c98bbee1dff1d3525018f3e9ed404bc74c86c39f77f"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardWalker::walk (cyclomatic 31): GuardWalker::walk has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500d7304ac784e1d20a323c29ca116a78af6192e54f34e076e24ee475139dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"EthApi::estimate_unsponsored_gas_with_state (cyclomatic 30): EthApi::estimate_unsponsored_gas_with_state has cyclomatic complexity 30 (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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"0906e4028f12ed64b1588a14176a58c6a2f681382e78a98d8b757f072a019063"}},{"ruleId":"D1","level":"warning","message":{"text":"ReturnDataObserver::visit_expr (cyclomatic 30): ReturnDataObserver::visit_expr has cyclomatic complexity 30 (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":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d634dd03f3cdfa7b5cb9f2ff402603f2dd39ea0994b0d2695c266ca0230f3"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::search_invariant_candidates_inner (cyclomatic 30): SymbolicExecutor::search_invariant_candidates_inner has cyclomatic complexity 30 (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":"crates/evm/symbolic/src/executor/invariant.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e79e21905ce822347c7282b58f47ab0f50ed46099d39b5448801d49d4f26b8"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_block_inner (cyclomatic 30): State::print_block_inner has cyclomatic complexity 30 (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":"crates/fmt/src/state/common.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"621c81e01fc8c01a0c49ffa8d2a930e2ef5314ed8481fd33daa504c5fcf7ad95"}},{"ruleId":"D1","level":"warning","message":{"text":"PubSubConnection::poll (cyclomatic 29): PubSubConnection::poll has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/server/src/pubsub.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c75952932c12ef3afa8709c7c795f0e4acd19ba772890a1aef617b741a624a"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::fs::deploy_code (cyclomatic 29): foundry_cheatcodes::fs::deploy_code has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c60c6b56001bbe22aee87abc2f7f226290e258f708ad8ad1deafdc4542f4d"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_doc::render::collect_comments (cyclomatic 29): forge_doc::render::collect_comments has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3419b70f8dfd4836747caadf61492d870a367e1aff335c4165241c556bd3a472"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::join_call_outcome (cyclomatic 29): SymbolicExecutor::join_call_outcome has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f614080e28fd861abf8cdd07a1f6a8f2709b7d7341dc7c062878658226995a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_contract (cyclomatic 29): State::print_contract has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9478f002249462dc209914dfd8ef9c824c9ddfaea21d69b87928d73c94753ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"Campaign::report (cyclomatic 29): Campaign::report has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"2396d359d4ac99d83408261da2b3d26b9ee096b99e1449096d5c892854077059"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_lint::sol::med::div_mul::check_expr (cyclomatic 29): forge_lint::sol::med::div_mul::check_expr has cyclomatic complexity 29 (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":"crates/lint/src/sol/med/div_mul.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b0ebe11c62ed993d00929f82d757060089d847b985f26f704af065f6463d06"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::step_hook (cyclomatic 28): Cheatcodes::step_hook has cyclomatic complexity 28 (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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a32fc444c4fe3efcfa818be2675308af9fd8c8c93c6ad62567fd4410763b24e"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::expected_emit::get_emit_mismatch_message (cyclomatic 28): foundry_cheatcodes::expected_emit::get_emit_mismatch_message 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":"crates/cheatcodes/src/expected_emit.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a89f7cf9c63573a01918174d8c3328390f746f9e367de3d2ca1ef5d8755d39d"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::run_solver_commands (cyclomatic 28): foundry_evm_symbolic::runtime::solver::run_solver_commands 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":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d7b968697acda4fd406e64552750b2051eb6891bfffc6ddeeb05fb01fdc559"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_comments (cyclomatic 28): State::print_comments 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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0372ee0d99af339500d8dc87d97aea22ab053db4556084818406458f85afdc"}},{"ruleId":"D1","level":"warning","message":{"text":"EquivalenceArgs::run (cyclomatic 28): EquivalenceArgs::run 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":"crates/forge/src/cmd/equivalence.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85fa60eddeed25f2a1cf6a6125ae6acfe72d321e2c8bdfec978c579f07b5227"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::analyze_stmt (cyclomatic 28): Analyzer::analyze_stmt 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":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"169b4f338e4c63321b5a1d0479568e073bf0fc57381a943a8349f68022e226b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Cx::unsafe_mint_target (cyclomatic 28): Cx::unsafe_mint_target 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":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aeb9d29119bfb075a58b2994d69ac4f9e1d0323d743d100d27ddf3a42653bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeConfig::setup_fork_db_config_with_replay (cyclomatic 27): NodeConfig::setup_fork_db_config_with_replay has cyclomatic complexity 27 (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":"crates/anvil/src/config.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"882c7516a702834bd89b5899ef99dbb1b9e06a707f58fff18e7341b91f645acc"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::json::_json_value_to_token (cyclomatic 27): foundry_cheatcodes::json::_json_value_to_token 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":"crates/cheatcodes/src/json.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"da20b5bea80b463ef3f961b4ed952935cb61e060a0236dfa902ccd14a0a56a98"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_ty (cyclomatic 27): State::print_ty 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"823774998f841e13da6524da97e671e2586ea50e4d95d13600720e89dbc71144"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_stmt_bound (cyclomatic 27): State::print_stmt_bound has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b487c6548803745ae6961b8a56c6036b77904f0572dced4592e5a9c7b9e6944"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::replay_persisted_handler_failures (cyclomatic 27): FunctionRunner::replay_persisted_handler_failures 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":"crates/forge/src/runner.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3162081bd9010fa68a357415cd0c217d15ce98a9842638c7af848ad76de7d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryAnalyzer::analyze_stmt (cyclomatic 27): EntryAnalyzer::analyze_stmt 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":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"4633997d1aa553560ded8bafbb8fa6586a455f860bd0c7e073218bbcb1a8d51b"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::analyze_stmt (cyclomatic 27): Analyzer::analyze_stmt has cyclomatic complexity 27 (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":"crates/lint/src/sol/low/reentrancy_events.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"471193b6026802d6d5ddfc5a26676cdb2e031fa15e73e6e1de8208e933937b45"}},{"ruleId":"D1","level":"warning","message":{"text":"RecoveryPlan::validate_signed_payloads (cyclomatic 27): RecoveryPlan::validate_signed_payloads 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":"crates/script/src/recovery.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"663fcfce19a2e82973cdc7d8c7a93ac3098490d79094bf05c8c5cdd97f083321"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::reasoning::xor::checked_xor_result (cyclomatic 26): foundry_evm_symbolic::runtime::solver::reasoning::xor::checked_xor_result 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":"crates/evm/symbolic/src/runtime/solver/reasoning/xor.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0ac480dbfdfa74b19e602f3ed9ad818a557554be8f4ac4ce7286a7aa2b37fd"}},{"ruleId":"D1","level":"warning","message":{"text":"TestResult::render (cyclomatic 26): TestResult::render 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":"crates/forge/src/result.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6d865823f25eb16114c00d7aa40302b034d54c96f02d46f5ddfc9e2bbbf17a"}},{"ruleId":"D1","level":"warning","message":{"text":"ContractRunner::_setup (cyclomatic 26): ContractRunner::_setup 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":"crates/forge/src/runner.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a4897ce991e16be656b81878485aa3f1bff7d55c0c32d62176b458c9c7666f"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::stage_fork_reset (cyclomatic 25): Backend::stage_fork_reset has cyclomatic complexity 25 (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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":5193}}}],"partialFingerprints":{"codehealthFindingId/v1":"186b179bb0c10e4ef6a0862e46fba069a65f1aae791f9cb978f1ded7dfe0e171"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::do_mine_block_locked (cyclomatic 25): Backend::do_mine_block_locked has cyclomatic complexity 25 (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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":6510}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d566f95242ef6c061d5e76812a133a1ce64262ab46c71376152be70586ef4a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::create_end_hook (cyclomatic 25): Cheatcodes::create_end_hook 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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cf143828ec75ab08d33400723dcc2c994e68244e9c73281aa9dd26c3dc0085"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorStackRefMut::create (cyclomatic 25): InspectorStackRefMut::create has cyclomatic complexity 25 (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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ae0f95d61b409391de728d430719ce921e162cfda96f0b3a911700c186b120"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageArgs::build (cyclomatic 25): CoverageArgs::build 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":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5051b3665f6b3a5cb87d092a2d1a04140df3460b09f48e2e7a6a5b7615e64f11"}},{"ruleId":"D1","level":"warning","message":{"text":"SolidityLinter::lint (cyclomatic 25): SolidityLinter::lint has cyclomatic complexity 25 (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":"crates/lint/src/sol/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3852af05daad08138179e21f0166b7a3be41c080d85a7238f09ce42a5a3ef53b"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_script::verify::verify_contracts (cyclomatic 25): forge_script::verify::verify_contracts 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":"crates/script/src/verify.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4d24c322c0376910eb6eb61ae71c5263e902a34a0b2d829d47cc3419e1bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"VerifyArgs::run_with_resolved_context (cyclomatic 25): VerifyArgs::run_with_resolved_context 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":"crates/verify/src/verify.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7fcda2c78a9d63cc56e9cf8aa4207e172f26f50723842e83f9dfec9d1fff2d"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionSource::inspect (cyclomatic 24): SessionSource::inspect 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":"crates/chisel/src/executor.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2e98f4b8a08e86ac4a44ac2e8a2e363275510a5357cf0231df24c8729ddb0d"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyInstallOpts::install (cyclomatic 24): DependencyInstallOpts::install 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":"crates/cli/src/install.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a2cbea8a03bb41c6b3a5627dd46029089684daab1ecd606fcd0294c9d3cea8"}},{"ruleId":"D1","level":"warning","message":{"text":"PreprocessorDependencies::new (cyclomatic 24): PreprocessorDependencies::new 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":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d97c6a29e6f059612a2549c30b6b324e19d2501a6bdbb4ac49f79f776046a4"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm::executors::showmap::replay_sequence_for_minimization (cyclomatic 24): foundry_evm::executors::showmap::replay_sequence_for_minimization 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":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199c284532e0e86b84003bc738b78eab0bd69e7486d0674af6c7aa8162c698c"}},{"ruleId":"D1","level":"warning","message":{"text":"SymExpr::unsigned_bits_cached (cyclomatic 24): SymExpr::unsigned_bits_cached has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa43889936f639a554a031986e288bba88fe3b71d2ebf7f7b9c5dbb8d5aed657"}},{"ruleId":"D1","level":"warning","message":{"text":"SmtLibSubprocessSolver::is_sat_inner (cyclomatic 24): SmtLibSubprocessSolver::is_sat_inner has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e3de6c2968915a88b53db293ae40119beaa14f403aa45f4d97e670efae739c"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintContext::normalize_word (cyclomatic 24): ConstraintContext::normalize_word 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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1d76583651ab19925ec575def69bfc9f3aec76837996d7b7f69d3b28accd82"}},{"ruleId":"D1","level":"warning","message":{"text":"AnvilBlockExecutor::execute_pool_transactions (cyclomatic 23): AnvilBlockExecutor::execute_pool_transactions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0898493627c77bf37bf8edb018e9b9f894cf56a5dd6652a9394c1b2cee030e04"}},{"ruleId":"D1","level":"warning","message":{"text":"TxBuilderInner::build (cyclomatic 23): TxBuilderInner::build has cyclomatic complexity 23 (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":"crates/cast/src/tx.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e9a91f2e32b320a9d5d0842cc8c9d9ebb8b05559ed48cf8912d77bdd495238"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_doc::hir_ext::implicit_edge_compatible (cyclomatic 23): forge_doc::hir_ext::implicit_edge_compatible has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d86a322aae83e11c179032c49ae792b9b5c783ed4ef1c49542d479f555cecf"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutionLifecycle::resume (cyclomatic 23): ExecutionLifecycle::resume has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c16147cba526368b06477d0c1ef1237a1fb3dba66197c3cb9e35aa72fac5481"}},{"ruleId":"D1","level":"warning","message":{"text":"CallTraceDecoder::decode_function (cyclomatic 23): CallTraceDecoder::decode_function has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c59947e4c064c76d9b8335935d74ad1cb436c2c04a08573a399cc9d6182656d"}},{"ruleId":"D1","level":"warning","message":{"text":"State::is_single_line_block (cyclomatic 23): State::is_single_line_block has cyclomatic complexity 23 (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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e89337beef57769351be3775703a1093742c02d6a3fa889dd0261b88bfd29b"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::import_symbolic_invariant_frontiers (cyclomatic 23): FunctionRunner::import_symbolic_invariant_frontiers has cyclomatic complexity 23 (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":"crates/forge/src/runner.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"46de16fae0c63c032646fb217d808d61d3493fc6d2b219bacfa7b16692fcb20b"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::workspace::copy_project (cyclomatic 23): forge::workspace::copy_project has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/workspace.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5230602083aea378b3caac70fa28e557dcf82cc33379606ff8eb4195f8bb7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::step_end_hook (cyclomatic 22): Cheatcodes::step_end_hook 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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5678cf96f093c3a8663f7aa16fa41ac7e7be534e0d500d5d97fe7d1588d9f93a"}},{"ruleId":"D1","level":"warning","message":{"text":"Cheatcodes::create_hook (cyclomatic 22): Cheatcodes::create_hook 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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b497f32b746bf3c4873070612c8a112e45a0bfd59a8da75af234591da31e09c"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cli_markdown::build_command_markdown (cyclomatic 22): foundry_cli_markdown::build_command_markdown has cyclomatic complexity 22 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli-markdown/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac383d2b9b0a75a7fcac68236edf053175dcb13f7d2c79fbb40315b582400c08"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCompiler::handle_output (cyclomatic 22): ProjectCompiler::handle_output has cyclomatic complexity 22 (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":"crates/common/src/compile.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9007a183ab1ab98fe81268deab4c42ef0f5b33b977f486d9e36573061da9e79"}},{"ruleId":"D1","level":"warning","message":{"text":"BytecodeDependencyCollector::visit_expr (cyclomatic 22): BytecodeDependencyCollector::visit_expr 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":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda927a740c37fc1143638f773d6690d4dae31fbd59ad440d8eebc882303fb65"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiForkHandler::poll (cyclomatic 22): MultiForkHandler::poll 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":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"530d50babf8ca66df3dfba4d4cd4684ccc1a74024daa15a95e0a70b91b4a9509"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::mapping_storage_provenance (cyclomatic 22): SymbolicExecutor::mapping_storage_provenance 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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92da57d81dad4b876945ba9b55164c7675650e7c23a7bc9f9b8ef843843e122"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::run_inner (cyclomatic 22): SymbolicExecutor::run_inner 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":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"08914eceffa0e1a7ac6935ce699aeb6553ed3d596eee23af9c6fa78b2135bf98"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalTraceIdentifier::identify_code (cyclomatic 22): LocalTraceIdentifier::identify_code 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":"crates/evm/traces/src/identifier/local.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a503b2fdaf32cc92aeab7fcdbfa675cb7c5e4a4a9a9e9f194f7c08df11568c"}},{"ruleId":"D1","level":"warning","message":{"text":"State::commasep_opening_logic (cyclomatic 22): State::commasep_opening_logic 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":"crates/fmt/src/state/common.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f12194c52d8b0e2cea22e554eed867cd814b05c00181d582adc6aac19447a0"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_try_stmt (cyclomatic 22): State::print_try_stmt 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0b73568f03115226798ad8ab4a02ebfbad1fbed719ef0d3626259bb18ed1d1"}},{"ruleId":"D1","level":"warning","message":{"text":"InitArgs::run (cyclomatic 22): InitArgs::run 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":"crates/forge/src/cmd/init.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbec967e4cef6d04a80a8eb2d5e32c4f0bd63d691ccedd94e5999cb307afa07e"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::visit_stmt (cyclomatic 22): Analyzer::visit_stmt has cyclomatic complexity 22 (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":"crates/lint/src/sol/high/controlled_delegatecall.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad8de76cd7fc696518ea2619ad75353b0be9a42edc09652720da5ebf0e997f1"}},{"ruleId":"D1","level":"warning","message":{"text":"PreSimulationState::eligible (cyclomatic 22): PreSimulationState::eligible 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":"crates/script/src/library_deployments.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd422b747680055d71598623b82463badc6638d3e9c6d9e4b759fe76598fb03"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchMakeTxArgs::run (cyclomatic 21): BatchMakeTxArgs::run has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ea8ea2a19a6451a64e772359feea06f00ed3df1cacdc3f1c9cbee8b417408a"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildOpts::data (cyclomatic 21): BuildOpts::data has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/build/core.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1218277875b4b9832a56cb8bbcfac8a7ddd5e35cfc4c7b358a90099ed03e37"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cli_markdown::write_arg_markdown (cyclomatic 21): foundry_cli_markdown::write_arg_markdown has cyclomatic complexity 21 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli-markdown/src/lib.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d7836b00731c267e0058b14fcee504126834b19e015a31c9b90e3609f11e6"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_doc::hir_ext::effective_natspec_doc (cyclomatic 21): forge_doc::hir_ext::effective_natspec_doc has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6087b7cdc77bb01d04e45b881054e1bf0bc243abec4703226c46066844f1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm::executors::invariant::shrink::shrink_sequence_by_removing (cyclomatic 21): foundry_evm::executors::invariant::shrink::shrink_sequence_by_removing 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":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfb82341c25270ca6098c1d35f6dd670cee3ba7157ac8cfe95de72a20b034ad"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::free_address_write_targets (cyclomatic 21): SymbolicExecutor::free_address_write_targets 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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"824a79fc11c25b0de6d1950f1a4a69a4672c101941518bb11fc8eada3fab037d"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::run_invariant_inner (cyclomatic 21): SymbolicExecutor::run_invariant_inner 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":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c5575f906e37f2580055235d0429b27ce0f198a32efd17c58022a397ba9eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintContext::normalize_bool (cyclomatic 21): ConstraintContext::normalize_bool has cyclomatic complexity 21 (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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"a199fac6a3bd8ff061598ce06b72ca4debbf26de0260b5c372f21f651cbfc7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintContext::upper_bound_constraint (cyclomatic 21): ConstraintContext::upper_bound_constraint 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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef39e6b9696059228d4ba6568799ea70d734340ac8b275bba4eb13ae693311f"}},{"ruleId":"D1","level":"warning","message":{"text":"PathState::apply_executor_env (cyclomatic 21): PathState::apply_executor_env 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":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e3f35f0234c65b96d61a727b30a812184dcc6b7ae0c3a5323551ad397ae109"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::precompiles::execute_symbolic_precompile (cyclomatic 21): foundry_evm_symbolic::runtime::precompiles::execute_symbolic_precompile has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: foundry_evm_symbolic::runtime::precompiles::execute_precompile (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/precompiles.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"173dcd27867f0a202713b3970d3f283daf46b2b952baf4e432ba85c3baac71e3"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::fallback::seed_bounded_support_vars (cyclomatic 21): foundry_evm_symbolic::runtime::solver::fallback::seed_bounded_support_vars 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":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"340af91ed89a9122f02d612ad2c7d1566d7bea82b7d981d3f028222f169218c1"}},{"ruleId":"D1","level":"warning","message":{"text":"State::estimate_size_inner (cyclomatic 21): State::estimate_size_inner has cyclomatic complexity 21 (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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"932697fd8b2e47770a637a63fe4fc07da8732c6bd789005f2dd0681c19e46b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::run_fuzz_test (cyclomatic 21): FunctionRunner::run_fuzz_test has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":5205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bca6a7e482a24e2a45b9f10b5dc09e1faa8e8a5e2258cc0a5731e84b4a3eb36"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::stmt (cyclomatic 21): Analyzer::stmt 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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff862b05cebd383974b7488bdae08991619bedb3e69f4d523163471bc5e39dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"EntryAnalyzer::collect_slot_roots (cyclomatic 21): EntryAnalyzer::collect_slot_roots has cyclomatic complexity 21 (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":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf86088e5770b52dd1908d6b868181932dd0bb98bcd558e8d6732c5fcc670bc"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingInheritance::check_project (cyclomatic 21): MissingInheritance::check_project 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":"crates/lint/src/sol/info/missing_inheritance.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c6d246cbfc0b5152a31bbe60ec8249dbd5f9c3f268031f76a0b673c0506e42"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptArgs::preprocess (cyclomatic 21): ScriptArgs::preprocess has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0f3b1ddc6e91a656a6b04e0c93539b3d8a1a743e1de1ea9f811bd9aa6a1287"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::validate_pool_transaction (cyclomatic 20): Backend::validate_pool_transaction has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: anvil::eth::backend::mem::halt_reason (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":10463}}}],"partialFingerprints":{"codehealthFindingId/v1":"732f73c2d74501b3e41d4e101d05ebc7b98bdad2a0ad4bd4700ab34b003c0e96"}},{"ruleId":"D1","level":"warning","message":{"text":"CallArgs::run (cyclomatic 20): CallArgs::run has cyclomatic complexity 20 (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":"crates/cast/src/cmd/call.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb12540dad9bd5d2cb1a9324d17ac3e0fca4970281891e3e74cb6505b8b11a7"}},{"ruleId":"D1","level":"warning","message":{"text":"StorageArgs::run (cyclomatic 20): StorageArgs::run has cyclomatic complexity 20 (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":"crates/cast/src/cmd/storage.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe210c3213b66ec128ff41ace1bae95fec91b70e42a716c7fdcb70c86d457bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::expected_emit::observe_log (cyclomatic 20): foundry_cheatcodes::expected_emit::observe_log has cyclomatic complexity 20 (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":"crates/cheatcodes/src/expected_emit.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ffd48f37b677216f5c2f5f99564eb12262dd52bdb90210d3a700fdd43a87e2"}},{"ruleId":"D1","level":"warning","message":{"text":"WarningsProvider::collect_nested_section_warnings (cyclomatic 20): WarningsProvider::collect_nested_section_warnings has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/warnings.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cc538bec4eab7e01648f23124469424a32e053480611ff8beaa3f35ac545de"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_doc::hir_ext::replace_inline_links (cyclomatic 20): forge_doc::hir_ext::replace_inline_links has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcecbc5da20f6734c2361670aa0c2440aceecb7b7b41e221c010ebd17241fb82"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::deploy_code_cheatcode_call (cyclomatic 20): SymbolicExecutor::deploy_code_cheatcode_call has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4dc971e1320fb58749acddf9e896fe0bb76740d050c465da97aa52c5a63ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"SymBytes::slice_concrete (cyclomatic 20): SymBytes::slice_concrete has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b5a4330b9809f0592c82e08fcf4f0b0a2c90d5880845c61566ec55568e8bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"SymBinOp::eval (cyclomatic 20): SymBinOp::eval has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c267568183affed84761a8398b22d4bbe3ed6858f9bb72b477f48408d1644856"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolveArgs::run (cyclomatic 20): ResolveArgs::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/compiler.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0402f9d29a9d67b813840350408aeab96051c67d7c819515e008ad065d4d4839"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::import_symbolic_fuzz_frontiers (cyclomatic 20): FunctionRunner::import_symbolic_fuzz_frontiers has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad607c449c097614f2f97652bcd48e8b5e4671a736607934ad4019777e87d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::cmd::fuzz::push_scalar_value_candidates (cyclomatic 20): forge::cmd::fuzz::push_scalar_value_candidates has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"6070ee197cda402666c7079c1e6247f2b9472933e174000fb27c5c56675289a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::reads (cyclomatic 20): Analyzer::reads has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/write_after_write.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498204a0fbf0ddd27f4a9d8cdbb2ec4493d977f643dba481db4462e8489bc94"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::stmt (cyclomatic 20): Analyzer::stmt has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_eth.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79abdb974fa4fa837445ab224b5a2793b7cb754035854b6e148c2777a522925"}},{"ruleId":"D1","level":"warning","message":{"text":"DelegateTargetCollector::visit_stmt (cyclomatic 20): DelegateTargetCollector::visit_stmt has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e5eba4c41c10bf224c7841c96d95f88f88e899bf6fd377cc2a868919224098"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_lint::sol::med::div_mul::check_stmt (cyclomatic 20): forge_lint::sol::med::div_mul::check_stmt has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/div_mul.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4af553420ed759dd6e70ab12718d73c16857690dee218e8d8d785437273624"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptArgs::run_script (cyclomatic 20): ScriptArgs::run_script has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e639c1acc02f2effd7ce04c4f6577c83c8c2ed13827246d7d05eb687f8b65a"}},{"ruleId":"D1","level":"warning","message":{"text":"PreSimulationState::show_traces (cyclomatic 20): PreSimulationState::show_traces has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/execute.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e06c02cacda7510af28ec4754d4bcd46b58067157f216133aa33688ba2ea42"}},{"ruleId":"D1","level":"warning","message":{"text":"VerifyArgs::resolve_context (cyclomatic 20): VerifyArgs::resolve_context has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1792c06663b7fef8a520af044898bb0961a7c79374fef29f45aa82ede1fe4d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::parse_transaction_request (cyclomatic 19): Backend::parse_transaction_request 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. This is NOT this file\u0027s highest cyclomatic complexity: anvil::eth::backend::mem::halt_reason (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":3454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df21346c95e41b1a93835e84968f3b904d82806275b33161565918b931da270"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::cmd::wallet::new_keystores (cyclomatic 19): cast::cmd::wallet::new_keystores has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"368849ee4e9b8a5f003757754b2a556348147e46ce50ebfcf3c2a2bf95bd6410"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::cmd::wallet::configurable_account::new_wallet_is_configurable (cyclomatic 19): cast::cmd::wallet::configurable_account::new_wallet_is_configurable has cyclomatic complexity 19 (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":"crates/cast/src/cmd/wallet/configurable_account.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f046f9daac24cd4e4365a1e8ba6d0590f18af467e6325f0f4475fb3df110aa"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_cheatcodes::json::split_json_value_key (cyclomatic 19): foundry_cheatcodes::json::split_json_value_key has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/json.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"d389b8e724b45189512903670826a0501d4172e8a7fc74bdbd7d09fa7786d174"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_common_fmt::dynamic::_serialize_value_as_json (cyclomatic 19): foundry_common_fmt::dynamic::_serialize_value_as_json has cyclomatic complexity 19 (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":"crates/common/fmt/src/dynamic.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df75a39d63a86a46a18c9069f374f88ca44dd06ea7186c660b48b71a68f5259"}},{"ruleId":"D1","level":"warning","message":{"text":"RemappingsProvider::find_nested_foundry_remappings (cyclomatic 19): RemappingsProvider::find_nested_foundry_remappings has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffeff882b22b9e67bf06a85f795260a7b7347d0839e6acf2b492d6a7cac9159"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkerCorpus::export_to_workers (cyclomatic 19): WorkerCorpus::export_to_workers has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"165524ae23163bc886eed238e15568fca8a9b02e6776cc45e688e01e39c3a219"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm::executors::invariant::result::can_continue (cyclomatic 19): foundry_evm::executors::invariant::result::can_continue has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/result.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ab3aad34ac0799a0e785ddc88a0d96944ea0d26de16ab38bada299019c22a4"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::handle_symbolic_vm_cheatcode (cyclomatic 19): SymbolicExecutor::handle_symbolic_vm_cheatcode has cyclomatic complexity 19 (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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2ff77af30599cd13f5694027b1c23d34ae331fab3b49dd6630d17eadd69643"}},{"ruleId":"D1","level":"warning","message":{"text":"SymBytes::append_concrete_range (cyclomatic 19): SymBytes::append_concrete_range has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d79b70451105b9faf1f52c301b508e53c1133ace7c9f0970382ad6f2d48161c"}},{"ruleId":"D1","level":"warning","message":{"text":"SymExpr::known_byte (cyclomatic 19): SymExpr::known_byte has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa16f9feb8481cd5f7e4555f012a6078cbccb5d180b939efe8d290b6bf882516"}},{"ruleId":"D1","level":"warning","message":{"text":"SmtLibSubprocessSolver::model (cyclomatic 19): SmtLibSubprocessSolver::model 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":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"debfd09221e0b5e5dea12ed7071322757a43117bcbc554e19e629c8f92f3401b"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::normalize::normalize_cmp_for_solver (cyclomatic 19): foundry_evm_symbolic::runtime::solver::normalize::normalize_cmp_for_solver has cyclomatic complexity 19 (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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5481e6efdd4d54aacfbbdff9d041f73f5b34a4cfce3dcd038b3ce678ee88bd3e"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_yul_stmt (cyclomatic 19): State::print_yul_stmt has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/yul.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbca76fedf47c7634c76f129e34cb33b1a555431402c9832a47a1a872894bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::check_stmt (cyclomatic 19): Analyzer::check_stmt has cyclomatic complexity 19 (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":"crates/lint/src/sol/gas/write_after_write.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b22c83637d9e05bc9dc74b613ef7cff868662595892066200947e576de3cec"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::visit_expr (cyclomatic 19): Analyzer::visit_expr has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"8356f4b2b73910293e7ee4374c40991db957b1c7ebcbb8c3c5cedbec2bc87bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptProgress::wait_for_pending (cyclomatic 19): ScriptProgress::wait_for_pending has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/progress.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a161511ca35c2c150992b64f6bc5bba123e09f9126b687e8148db9eeb0072836"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize-release.finalize_nightly (cyclomatic 19): finalize-release.finalize_nightly 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":".github/scripts/finalize-release.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0edb254e1d33702c4ee95cbf6239461fd4a839c1ff31f20e0408d12035b9a60"}},{"ruleId":"D1","level":"warning","message":{"text":"EthApi::fee_history (cyclomatic 18): EthApi::fee_history has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"155b959fc9b8ad5cf5194a4d12c652eff2e478c2ec7f7e7c33405f7ed5bcd5ce"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::cmd::keychain::check_expiring_nonce_window (cyclomatic 18): cast::cmd::keychain::check_expiring_nonce_window has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: KeychainSubcommand::run (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b55f6ebca70285ac51f8cece9a527b46d37529c822b456bbdb4f46be600c292"}},{"ruleId":"D1","level":"warning","message":{"text":"DynValueFormatter::value (cyclomatic 18): DynValueFormatter::value 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":"crates/common/fmt/src/dynamic.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5f42595672fb48b29e015a3c762395e84f0e77605d97e8dfade42ae3007cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_common::tempo::auth::ensure_access_key (cyclomatic 18): foundry_common::tempo::auth::ensure_access_key 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":"crates/common/src/tempo/auth.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"532e47191206867f86e175547c47231b4284c4741687441bfb1d9059fc429ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_doc::vocs::escape_mdx_outside_code_fences (cyclomatic 18): forge_doc::vocs::escape_mdx_outside_code_fences 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":"crates/doc/src/vocs.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a262c7ccbc89a18c5782c2c5438caff25a5d7cf2f75d8978480bed556e43b05"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkerCorpusSeed::load_from_disk (cyclomatic 18): WorkerCorpusSeed::load_from_disk 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":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a3485d47386659ec85b0933a4bdb89866ecb80e43acd728a32ef0d5cacd5b4"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm::executors::corpus_io::read_corpus_tree (cyclomatic 18): foundry_evm::executors::corpus_io::read_corpus_tree 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":"crates/evm/evm/src/executors/corpus_io.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"36605326682f762095cf6b77caa2c8ddcbbbea8ec611eccf09f68cbc8e1708eb"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicCalldata::variants_with_prefix (cyclomatic 18): SymbolicCalldata::variants_with_prefix has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bc15a0cf8eb0943ed9e48a3b3990fbb8b15ee8eee77f20b02b225930d60877"}},{"ruleId":"D1","level":"warning","message":{"text":"SymBoolExpr::implies_unsigned_less_or_equal (cyclomatic 18): SymBoolExpr::implies_unsigned_less_or_equal has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"441ffa78ea8b611c2aed0a1d5320f609acce79c078a96d4668cdf8d66b2857b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionDigests::digest (cyclomatic 18): ExpressionDigests::digest has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f7ce2459291ab15947c8dbceb24f8f87e291ec8b8dacd9e8b1277af3eec98a"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintContext::normalize_signed_add_comparison (cyclomatic 18): ConstraintContext::normalize_signed_add_comparison 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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a7aa8b3e7381427f1e111b10b19023c0286579ea5ac13bf99758200649530"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_bin_expr (cyclomatic 18): State::print_bin_expr 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e103141374cc27b1291d91168ced96a83357258e68551e437f157f92c88549e"}},{"ruleId":"D1","level":"warning","message":{"text":"FuzzCminArgs::run_to (cyclomatic 18): FuzzCminArgs::run_to 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":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"532307f8f6797bf0c1b670bf89c530e4f4184cba91fd215cb69c8aca9bb5fb10"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionRunner::replay_invariant_checkpoints (cyclomatic 18): FunctionRunner::replay_invariant_checkpoints 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":"crates/forge/src/runner.rs"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dfa1ca0274ee964298896ddee8bd042f6e4813a5afc0e562a6bf68d6e5741a"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::cmd::clone::dump_sources (cyclomatic 18): forge::cmd::clone::dump_sources 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":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3f899190a770cea084cefb61733cdc94ced473bd413b20bf2573948741ffa4"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::mutation::runner::run_mutations_parallel_with_progress (cyclomatic 18): forge::mutation::runner::run_mutations_parallel_with_progress 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":"crates/forge/src/mutation/runner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b09c3399c1b8cd311fc8883d99dca2d85249de5b14c348d7a4fcccae17b76dd"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::symbolic_minimizer::minimize_compound_value (cyclomatic 18): forge::symbolic_minimizer::minimize_compound_value 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":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0787f5fb1ff6acb996fd07ab0257f8334781b0e783afb8d41f4b5055e29ba243"}},{"ruleId":"D1","level":"warning","message":{"text":"WriteAnalyzer::visit_stmt (cyclomatic 18): WriteAnalyzer::visit_stmt 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":"crates/lint/src/sol/low/missing_events_access_control.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab18c89799192e5500e5e074ed02bd0c3161d8b8b6c9d0bdf8e6de598fb1185c"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::add_facts (cyclomatic 18): Analyzer::add_facts 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":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8005038299a660b64cfd26dfb954aabddd7d7a16fd4cd34fe19eed0e04bc4565"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::run_stmt (cyclomatic 18): Analyzer::run_stmt has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c2aa048a0e9fd7c56849ed59e3936fa3808b1db8a5d6ddeac1e99c35250ea"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_lint::sol::med::tautological_compare::exprs_equal (cyclomatic 18): forge_lint::sol::med::tautological_compare::exprs_equal has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/tautological_compare.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9e0f92b52c66d0397b0f9350ebc8c8430f3c798a8ae6d251fce328b30cf98e"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_lint::sol::med::uninitialized_state_variables::storage_aliases (cyclomatic 18): forge_lint::sol::med::uninitialized_state_variables::storage_aliases 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":"crates/lint/src/sol/med/uninitialized_state_variables.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39565eefc095005072ee854903c0c8ac23c40a5316a51e4b5938f5238383264"}},{"ruleId":"D1","level":"warning","message":{"text":"FoundryTransactionRequest::try_from (cyclomatic 18): FoundryTransactionRequest::try_from 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":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"18db7c8cb607b55124e8c07d8c4fc164b1ccf437a91ae469add9875e27835236"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptRunner::setup (cyclomatic 18): ScriptRunner::setup 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":"crates/script/src/runner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b4428219f921c5fa2735743e46ab1f66147fcf75c122bc9e7fbfbd077e873c"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_script::owner_approvals::assemble (cyclomatic 18): forge_script::owner_approvals::assemble 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":"crates/script/src/owner_approvals.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0985c7242034d822ca7cdc7b5698d58f85f791313da6e586c3b892e76f11608a"}},{"ruleId":"D1","level":"warning","message":{"text":"VerificationProviderType::client (cyclomatic 18): VerificationProviderType::client 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":"crates/verify/src/provider.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"080b17fdf2f1f51f0f87d08a9d2cce6dc7ce986c14a6eec2f2903bb7edc86b32"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::apply_fork_transaction_replay (cyclomatic 17): Backend::apply_fork_transaction_replay has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: anvil::eth::backend::mem::halt_reason (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":6130}}}],"partialFingerprints":{"codehealthFindingId/v1":"916d9197064aa59afde0ecbaf421c7376018835b7b79ba1c7f92cf1ec1bd357c"}},{"ruleId":"D1","level":"warning","message":{"text":"RunArgs::prepare (cyclomatic 17): RunArgs::prepare has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/run.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e9132238107ec6a7ee228f499a562fbe2666cf336b6113a4a5f6cf618fffdd"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::cmd::logs::stream_logs (cyclomatic 17): cast::cmd::logs::stream_logs 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":"crates/cast/src/cmd/logs.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ccd04c07eb68f6c737d2b8560fb9ecb0fc979fbb50a581b8c632161c673e12"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::cmd::wallet::session::split_for_command (cyclomatic 17): cast::cmd::wallet::session::split_for_command 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":"crates/cast/src/cmd/wallet/session.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdae7217c23e1e0a9cfe8954348b2ef9ade9a6eda7432d75039f2601d7d9d7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::classify_revert (cyclomatic 17): SymbolicExecutor::classify_revert has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"81625aec277a600250f8beb1efaa89e9f6e19257251c7c302c2ca5b4e8b3b3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"SymExpr::byte_term (cyclomatic 17): SymExpr::byte_term 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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3802f3082cd42bbcdc44387371acc40b3147c9e1bb1e17ed01e4fa5a3796ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::reasoning::monotonic_product::collect_order_facts (cyclomatic 17): foundry_evm_symbolic::runtime::solver::reasoning::monotonic_product::collect_order_facts 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":"crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"911fa5e5072410ff9558b460e2c4ec9a8b9d28a200ede98b9a0d9fd42cf87967"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_wrapped_line (cyclomatic 17): State::print_wrapped_line has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8c67b78c414fa4fca53ee40cfcfce1b4a54144f980bf35f3257b420e09b85c"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::cmd::fuzz::minimize_sequence (cyclomatic 17): forge::cmd::fuzz::minimize_sequence 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":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a0a77ab9f503e9acff09ea2c2cb9cad91b4bf6773e32b4107d93f010c04446"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::mutation::orchestrator::resolve_mutate_paths (cyclomatic 17): forge::mutation::orchestrator::resolve_mutate_paths 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":"crates/forge/src/mutation/orchestrator.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30ae51cb12189543ceac30630c9acdc9438623c795c21386682059e20adc8dd"}},{"ruleId":"D1","level":"warning","message":{"text":"UnchangedStateVariables::check_nested_contract (cyclomatic 17): UnchangedStateVariables::check_nested_contract 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":"crates/lint/src/sol/gas/immutable.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c3aa4cea9cdd7279599b4a2e60810f72fd22e6275f5aa1b2bc7abc9e383274"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::guard_has_stale_balance_comparison (cyclomatic 17): Analyzer::guard_has_stale_balance_comparison 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":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab4e14710e62a1a8016ebe6b249fab06679d5da1b6618acd118d764c20e3f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::balance_forms (cyclomatic 17): Analyzer::balance_forms 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":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad70bf1071d9c42a551dd13a2d93b287ebec07b514a233cc9b6686a038274c5"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_lint::sol::analysis::modifier_outcome::stmt_outcome (cyclomatic 17): forge_lint::sol::analysis::modifier_outcome::stmt_outcome 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":"crates/lint/src/sol/analysis/modifier_outcome.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23bbf56d7e6c1bf533f618bb0cdb33944aaa3629279d12bd0c089dc2a2bb094"}},{"ruleId":"D1","level":"warning","message":{"text":"PreSimulationState::equivalent_candidate (cyclomatic 17): PreSimulationState::equivalent_candidate 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":"crates/script/src/library_deployments.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"766d167ae34aa44dbf29b2fefe1c70a27aa4d4ba71fac3a2920fbf128de30ea1"}},{"ruleId":"D1","level":"warning","message":{"text":"FilledTransactionsState::bundle (cyclomatic 17): FilledTransactionsState::bundle 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":"crates/script/src/simulate.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"44216a66430d922de43452f670f8cd61e4208c29ce33058799b163b9d7721a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeConfig::setup (cyclomatic 16): NodeConfig::setup 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":"crates/anvil/src/config.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5919d0877dbf251870c226902c0c221eef18fb8136a9ddab56deb18a09706652"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::with_genesis (cyclomatic 16): Backend::with_genesis has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: anvil::eth::backend::mem::halt_reason (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd462ae910f61c3e80ed0ae4455fb7666f999fe355d507890edeb829d4b2f2d5"}},{"ruleId":"D1","level":"warning","message":{"text":"PubSubEthRpcHandler::on_pub_sub (cyclomatic 16): PubSubEthRpcHandler::on_pub_sub 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":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"150900f755bdfd97e13132db05e48422f1d628d8a768b5ec0fe6b658d0d880c3"}},{"ruleId":"D1","level":"warning","message":{"text":"anvil::try_spawn (cyclomatic 16): anvil::try_spawn has cyclomatic complexity 16 (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":"crates/anvil/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f028f6af489c397dcb08c19a1185fceb7b914f28c4168b35acc808337a95df8"}},{"ruleId":"D1","level":"warning","message":{"text":"Create2Args::run (cyclomatic 16): Create2Args::run has cyclomatic complexity 16 (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":"crates/cast/src/cmd/create2.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a3d63b1bfa03366e4eaa2c387b36d65249e1fa2328358ad0acce0afa2e493f"}},{"ruleId":"D1","level":"warning","message":{"text":"Lockfile::check (cyclomatic 16): Lockfile::check 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":"crates/cli/src/lockfile.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef0c0b503c6c40ab2a77af3daf23395715d7866b89dd16c8104f86e508e434f"}},{"ruleId":"D1","level":"warning","message":{"text":"EvmArgs::data (cyclomatic 16): EvmArgs::data has cyclomatic complexity 16 (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":"crates/cli/src/opts/evm.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c3b435416cb0e6beb8076565609a0728d307a2694b79a9541ecfe61384e082"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentGatherer::process_token (cyclomatic 16): CommentGatherer::process_token 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":"crates/common/src/comments/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5609f4048c31774bcc4ee93f19b096aae9fb17cb603da5e83ed49d73fb6dcd6"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectCompiler::compile (cyclomatic 16): ProjectCompiler::compile has cyclomatic complexity 16 (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":"crates/common/src/compile.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafa4264a44e3dd1213aeac36f35cf2d004e5aa38c7514770007250cad2f69fb"}},{"ruleId":"D1","level":"warning","message":{"text":"DynamicTestLinkingPreprocessor::preprocess_with_dependencies (cyclomatic 16): DynamicTestLinkingPreprocessor::preprocess_with_dependencies 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":"crates/common/src/preprocessor/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecd08569546f4e9eb8c808c776ad1a87c38a38dcd68c6f1e30906749bb9d682"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_common::external_storage::resolve (cyclomatic 16): foundry_common::external_storage::resolve 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":"crates/common/src/external_storage.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2ecc4e2dec3077c51980c8d1507f2124c623d60a2ea856493e2852be17ace2"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_core::evm::lifecycle::merge_changes (cyclomatic 16): foundry_evm_core::evm::lifecycle::merge_changes has cyclomatic complexity 16 (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":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd301692a1142ab9994266b5545076ef95ad2aeb9773cd3496fa20c90ab647c"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolicExecutor::equivalence_mismatch (cyclomatic 16): SymbolicExecutor::equivalence_mismatch has cyclomatic complexity 16 (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":"crates/evm/symbolic/src/executor/equivalence.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0c77e39c22790d604a4f77b65c75fa5aad3a2a020c7792b69d99839cad693f"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::reasoning::xor::check_certificate (cyclomatic 16): foundry_evm_symbolic::runtime::solver::reasoning::xor::check_certificate 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":"crates/evm/symbolic/src/runtime/solver/reasoning/xor.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cc7f0dd2f431859e20b916691e1492e133f2ac460b29b9febf0624b1b46892"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalFetcher::poll_next (cyclomatic 16): ExternalFetcher::poll_next 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":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab75939dd2cbb81593eba5dff1fd28f1a283c11c400296680229adb1cb12fcf2"}},{"ruleId":"D1","level":"warning","message":{"text":"foundry_evm_traces::decoder::precompiles::is_known_precompile (cyclomatic 16): foundry_evm_traces::decoder::precompiles::is_known_precompile has cyclomatic complexity 16 (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":"crates/evm/traces/src/decoder/precompiles.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b015899df355e3d60f0b40801338cf4a4699b35024e94225c432466946da082"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_num_literal (cyclomatic 16): State::print_num_literal has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/common.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17002cee8cf549ebd2a79b8d33bf9a02e61c1b8d345a9c1d1096113ce373351"}},{"ruleId":"D1","level":"warning","message":{"text":"State::brace_spacing_delta (cyclomatic 16): State::brace_spacing_delta 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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b99113be13e4a27922343d83e129cf3ef460e8ae2ccf1248aaf0dd8cb32dd"}},{"ruleId":"D1","level":"warning","message":{"text":"LintArgs::run (cyclomatic 16): LintArgs::run has cyclomatic complexity 16 (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":"crates/forge/src/cmd/lint.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a7d8170a3a99aaf66b44a93186c76aa9dea05b53b1a9b0f0e55033837ab389"}},{"ruleId":"D1","level":"warning","message":{"text":"Campaign::run_agent (cyclomatic 16): Campaign::run_agent 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":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe8c6a161ca63b1126b82ae829259b1739850a989661096806789bf4e352a18"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiContractRunnerBuilder::build (cyclomatic 16): MultiContractRunnerBuilder::build 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":"crates/forge/src/multi_runner.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfedb0cf1c3166adb5fc3c2341b2fac627ac87ae84e67894cffdcaee684a9c9"}},{"ruleId":"D1","level":"warning","message":{"text":"forge::mutation::mutators::function_body_mutator::constant_return (cyclomatic 16): forge::mutation::mutators::function_body_mutator::constant_return 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":"crates/forge/src/mutation/mutators/function_body_mutator.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccf35082a4e7c5b76a351f13c52741313bd15643d0d4a2e7f632df86a7deab2"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::is_trusted_target_inner (cyclomatic 16): Analyzer::is_trusted_target_inner 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":"crates/lint/src/sol/high/controlled_delegatecall.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7c465a56b4753f094bd89271f6abc7fd6f04f0a87b40857d4926d94636acd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_stmt (cyclomatic 16): Checker::visit_stmt 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":"crates/lint/src/sol/med/uninitialized_local.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd35badb3150f0677ca65f6e9d65718fc5eadbd60bd63a0e814c7333f949db9"}},{"ruleId":"D1","level":"warning","message":{"text":"forge_lint::sol::codesize::unwrapped_modifier_logic::snippet (cyclomatic 16): forge_lint::sol::codesize::unwrapped_modifier_logic::snippet 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":"crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f19b47b3bf4848b2f0574339e7ca56301dcba7a22631a9e2cff6b28c1c08910"}},{"ruleId":"D1","level":"warning","message":{"text":"SendTransactionKind::prepare (cyclomatic 16): SendTransactionKind::prepare 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":"crates/script/src/broadcast.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096c8dbb937e5ce03aa9198cd84c69c1f9e7d09a070b5190b9367988b1f53d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ScriptArgs::check_contract_sizes (cyclomatic 16): ScriptArgs::check_contract_sizes 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":"crates/script/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ed48b980f6e805232965dd473c076824c390a1466cc9f04138aa7f223b13dc"}},{"ruleId":"D2","level":"warning","message":{"text":"BundledState::broadcast (cognitive 229): BundledState::broadcast has cognitive complexity 229 (threshold 15). Drivers by points: if/else 56 (152 pts), match/switch 9 (29 pts), loops 9 (26 pts), boolean chains 22 (nesting depth added 133). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d762f44227ea6ddbb830baddc4a7ec738f27858a86fe5f4c547d637c9667aa"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::args::run_command (cognitive 222): cast::args::run_command has cognitive complexity 222 (threshold 15). Drivers by points: if/else 84 (155 pts), match/switch 20 (42 pts), loops 6 (17 pts), boolean chains 8 (nesting depth added 104). 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":"crates/cast/src/args.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"005702995f96e2cab7318c60fe8bc1e100ea0a7c61c3ef95bb24152d9360d77e"}},{"ruleId":"D2","level":"warning","message":{"text":"InvariantExecutor::run_invariant_worker (cognitive 222): InvariantExecutor::run_invariant_worker has cognitive complexity 222 (threshold 15). Drivers by points: if/else 75 (188 pts), boolean chains 22, match/switch 2 (7 pts), loops 3 (5 pts) (nesting depth added 120). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"323b5c2437112e9821d337e9fafa314b010386fd9817961a8a97577c4862ddcb"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::handle_foundry_cheatcode (cognitive 217): SymbolicExecutor::handle_foundry_cheatcode has cognitive complexity 217 (threshold 15). Drivers by points: if/else 91 (162 pts), match/switch 13 (28 pts), loops 8 (16 pts), boolean chains 11 (nesting depth added 94). 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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64c1a22004401ac1919d0368a5ce3cc4d5898a67e0c2a606973a66cded3c22b"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::run_invariant_test (cognitive 214): FunctionRunner::run_invariant_test has cognitive complexity 214 (threshold 15). Drivers by points: if/else 72 (136 pts), match/switch 17 (46 pts), boolean chains 22, loops 6 (10 pts) (nesting depth added 97). 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":"crates/forge/src/runner.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddf063fee8aad453e2b5727e46c50ab903533144fca85494090a324df88ccd6"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::step (cognitive 177): SymbolicExecutor::step has cognitive complexity 177 (threshold 15). Drivers by points: if/else 60 (125 pts), match/switch 18 (38 pts), boolean chains 12, loops 1 (2 pts) (nesting depth added 86). 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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"068942a969f3f6ee2c6136d58ed92ee100800d670a720149091c4fcc45ee21b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::simulate_raw (cognitive 165): Backend::simulate_raw has cognitive complexity 165 (threshold 15). Drivers by points: if/else 61 (135 pts), boolean chains 12, loops 5 (9 pts), match/switch 4 (9 pts) (nesting depth added 83). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":9386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eebe92e56cbb9a7f7528e5f410325abf3e4cc70e9609320c5afb44be61b04b0"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_comment (cognitive 162): State::print_comment has cognitive complexity 162 (threshold 15). Drivers by points: if/else 46 (129 pts), loops 6 (18 pts), boolean chains 9, match/switch 3 (6 pts) (nesting depth added 98). 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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ff06c6c2b9faa6d573ea4de68d8d9ddeeb1588a8e366cbfd137e5d5037c91"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::call_concrete_target (cognitive 156): SymbolicExecutor::call_concrete_target has cognitive complexity 156 (threshold 15). Drivers by points: if/else 68 (110 pts), boolean chains 23, match/switch 8 (16 pts), loops 3 (7 pts) (nesting depth added 54). 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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a5f66d27ca6945a679d4f8c8e6072bfb8e1e52ac5e6fed683f35fcd7d426a3"}},{"ruleId":"D2","level":"warning","message":{"text":"WalletSubcommands::run (cognitive 148): WalletSubcommands::run has cognitive complexity 148 (threshold 15). Drivers by points: if/else 64 (122 pts), match/switch 9 (19 pts), loops 2 (4 pts), boolean chains 3 (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":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd099eddb96226821af7033f6a4c259a18fb8bfdcd09c47e7d487b1bc6b1a15"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorsSubcommands::run (cognitive 135): SelectorsSubcommands::run has cognitive complexity 135 (threshold 15). Drivers by points: if/else 37 (75 pts), loops 16 (51 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 74). 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":"crates/forge/src/cmd/selectors.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b351792108b80a4c6c8ef397014349f0f69f27c17a65243e1d6c49d97bb753b5"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::try_seed_invariant_corpus_from_frontiers (cognitive 118): FunctionRunner::try_seed_invariant_corpus_from_frontiers has cognitive complexity 118 (threshold 15). Drivers by points: if/else 31 (76 pts), match/switch 6 (18 pts), loops 5 (14 pts), boolean chains 10 (nesting depth added 66). 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":"crates/forge/src/runner.rs"},"region":{"startLine":3378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4650644244227e752aa2d5fbc8c1a765f97b8c966b3283eb20abfd9adb83c761"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::check_mem_opcodes (cognitive 116): Cheatcodes::check_mem_opcodes has cognitive complexity 116 (threshold 15). Drivers by points: if/else 27 (59 pts), boolean chains 56, match/switch 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ae2fbacc59c217e618c554b30c3a8a44ea8eec4b9b9a08b877b1139382401"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArgs::run_with_network_and_opts (cognitive 115): CallArgs::run_with_network_and_opts has cognitive complexity 115 (threshold 15). Drivers by points: if/else 48 (86 pts), match/switch 9 (16 pts), boolean chains 10, loops 1 (3 pts) (nesting depth added 47). 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":"crates/cast/src/cmd/call.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3c48e59a8a78eb4b3f70c2de46bb481c0a39f1eebabf3623b536236c8eb9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::clone::update_config_by_metadata (cognitive 111): forge::cmd::clone::update_config_by_metadata has cognitive complexity 111 (threshold 15). Drivers by points: if/else 57 (108 pts), loops 2 (3 pts) (nesting depth added 52). 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":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"516db89b543f9a22bd886e2b4cb472ef9e65d9febf44d682c7b52743fa340a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifyBytecodeArgs::prepare_runtime_verification (cognitive 110): VerifyBytecodeArgs::prepare_runtime_verification has cognitive complexity 110 (threshold 15). Drivers by points: if/else 50 (90 pts), match/switch 9 (14 pts), boolean chains 6 (nesting depth added 45). 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":"crates/verify/src/bytecode.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8858a4e3d9b3af2dfb2866f43b13f9d4bfb240eccc03bebe5160835526824d"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::call_with_executor (cognitive 108): Cheatcodes::call_with_executor has cognitive complexity 108 (threshold 15). Drivers by points: if/else 35 (78 pts), match/switch 8 (22 pts), boolean chains 8 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"de647891dc13cdf255cf65f15911219f533784877d5529773a063e0038bc3e22"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::search_invariant_candidates_inner (cognitive 108): SymbolicExecutor::search_invariant_candidates_inner has cognitive complexity 108 (threshold 15). Drivers by points: if/else 13 (59 pts), match/switch 7 (30 pts), loops 6 (19 pts) (nesting depth added 82). 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":"crates/evm/symbolic/src/executor/invariant.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4880d46b24b2132e710f9b419cf7d2b303a0e492552f19a835dfbd0c5a2f6ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::fallback::checked_mul_guard_branch_model (cognitive 104): foundry_evm_symbolic::runtime::solver::fallback::checked_mul_guard_branch_model has cognitive complexity 104 (threshold 15). Drivers by points: if/else 21 (78 pts), loops 8 (14 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 68). 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":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8e8c7fbbd27af93c3e5767d97f640e2b310b7e38a92f72ff83a6e44b3ade81"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtArgs::run (cognitive 99): FmtArgs::run has cognitive complexity 99 (threshold 15). Drivers by points: if/else 33 (57 pts), boolean chains 17, loops 5 (13 pts), match/switch 6 (12 pts) (nesting depth added 38). 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":"crates/forge/src/cmd/fmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2edcd387768777af5a658c8a1592850301fcd051799821c6d409372e09651e"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::evm::get_recorded_state_diffs (cognitive 95): foundry_cheatcodes::evm::get_recorded_state_diffs has cognitive complexity 95 (threshold 15). Drivers by points: if/else 25 (57 pts), loops 10 (18 pts), boolean chains 12, match/switch 3 (8 pts) (nesting depth added 45). 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":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32dfc8b8a88861ec0a076cf78890940dd8086f5565037d87f8813c518cc9bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::call_end_hook (cognitive 91): Cheatcodes::call_end_hook has cognitive complexity 91 (threshold 15). Drivers by points: if/else 33 (72 pts), boolean chains 11, match/switch 2 (8 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62df42b7a62fa307727d21f1c40e4aa7b0f861cc03a941d2fe6d3d8060923a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::execute_call_path_batch (cognitive 90): SymbolicExecutor::execute_call_path_batch has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (64 pts), match/switch 6 (19 pts), boolean chains 4, loops 2 (3 pts) (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":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4fa777b48e0ad138b7576fcfa1bbd90e4ad433d968968cf9ce34c3646659ef"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::hir_ext::replace_inline_links (cognitive 80): forge_doc::hir_ext::replace_inline_links has cognitive complexity 80 (threshold 15). Drivers by points: if/else 17 (61 pts), match/switch 4 (18 pts), loops 1 (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27b3ddac985a4c8f103bb560252185a713a8d8142a98f4dedf124773a5784a7"}},{"ruleId":"D2","level":"warning","message":{"text":"State::commasep (cognitive 80): State::commasep has cognitive complexity 80 (threshold 15). Drivers by points: if/else 37 (58 pts), boolean chains 21, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/common.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec954ab455ba1ea69cc06aa9588d2e4a8bd2141e52cb9db69b0188837f69a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReturnDataObserver::visit_expr (cognitive 79): ReturnDataObserver::visit_expr has cognitive complexity 79 (threshold 15). Drivers by points: if/else 13 (47 pts), loops 8 (25 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddb6e0630925dedc6357129f156c706c0f38e168a491a8392151530b9bd25e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::run_invariant_inner (cognitive 78): SymbolicExecutor::run_invariant_inner has cognitive complexity 78 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 8 (30 pts), match/switch 1 (7 pts) (nesting depth added 57). 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":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2d7e85bd2f72a621e9276f15fbb3e86744f42d5c40fca355983d2b652f9486"}},{"ruleId":"D2","level":"warning","message":{"text":"SendTxArgs::run_generic_inner (cognitive 77): SendTxArgs::run_generic_inner has cognitive complexity 77 (threshold 15). Drivers by points: if/else 45 (69 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/send.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e33ea3417344ada1aa70565734d2deb7b9f874edba1ae7eae5445a2bdbbd14"}},{"ruleId":"D2","level":"warning","message":{"text":"BundledState::broadcast_batch (cognitive 75): BundledState::broadcast_batch has cognitive complexity 75 (threshold 15). Drivers by points: if/else 41 (57 pts), match/switch 6 (9 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"763630dfe405c2aaf411a104d239bc6845de4a5e9f4abb12c0c91784ad3408fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::replay_symbolic_artifact (cognitive 73): FunctionRunner::replay_symbolic_artifact has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (49 pts), match/switch 8 (16 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 33). 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":"crates/forge/src/runner.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"d058393ca5693c62d532ead830795f8bf86b58b96730666a09efbf1042055582"}},{"ruleId":"D2","level":"warning","message":{"text":"RemappingsProvider::get_remappings (cognitive 72): RemappingsProvider::get_remappings has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 8 (15 pts), boolean chains 11, match/switch 2 (4 pts) (nesting depth added 36). Of this number, 69 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de9052c445c913c6004698f70366f96cf5dc91bb344956ba4cf1e8f7aa0a64c"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorStackRefMut::transact_inner (cognitive 72): InspectorStackRefMut::transact_inner has cognitive complexity 72 (threshold 15). Drivers by points: if/else 35 (44 pts), loops 6 (16 pts), boolean chains 8, match/switch 3 (4 pts) (nesting depth added 20). 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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdea8b17643b0ec552cac666594121d214608958341fb5ca017ebf8d5570301"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_function (cognitive 72): State::print_function has cognitive complexity 72 (threshold 15). Drivers by points: if/else 32 (53 pts), boolean chains 14, loops 2 (4 pts), match/switch 1 (nesting depth added 23). 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb676d8758eabf863793610351eddfc1946564880cf2f0d66b443ad4be6fc0a"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::validate_pool_transaction_for (cognitive 71): Backend::validate_pool_transaction_for has cognitive complexity 71 (threshold 15). Drivers by points: if/else 29 (55 pts), boolean chains 12, match/switch 2 (4 pts) (nesting depth added 28). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":10607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22f9762ba2de1c990dca0e8c80f0a4a7331bfcca54beebc5f983b95f4283ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::showmap::replay_corpus_to_showmap (cognitive 71): foundry_evm::executors::showmap::replay_corpus_to_showmap has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (54 pts), boolean chains 12, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 34). 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":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e640510050348dc8c7e6be3ee6702f5966d250cc4ed24bbbe7ee612d8320fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::call_symbolic_target (cognitive 70): SymbolicExecutor::call_symbolic_target has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (53 pts), boolean chains 7, match/switch 3 (7 pts), loops 2 (3 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc011a32f98967528b80288fec0b4adc01019924addc3a8ed37887a313c2053"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractsByArtifact::find_by_deployed_code_exact_inner (cognitive 68): ContractsByArtifact::find_by_deployed_code_exact_inner has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (49 pts), match/switch 4 (9 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 30). 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":"crates/common/src/contracts.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dee9f3b0cc0d34995f685d5f394e024d14f6f6fb92a9303792a503583d3333d"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_assign_rhs (cognitive 68): State::print_assign_rhs has cognitive complexity 68 (threshold 15). Drivers by points: if/else 29 (53 pts), boolean chains 14, match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ea5700619e49427b0e97e80be477fd1ab8c4c87600dfee8fff6814f140ef4"}},{"ruleId":"D2","level":"warning","message":{"text":"MakeTxArgs::run_generic (cognitive 67): MakeTxArgs::run_generic has cognitive complexity 67 (threshold 15). Drivers by points: if/else 37 (60 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f09d974058a73306744e16fb93060ea72058c7c9074b96c866b6783f0b7623"}},{"ruleId":"D2","level":"warning","message":{"text":"ListArgs::run (cognitive 67): ListArgs::run has cognitive complexity 67 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 10 (25 pts), boolean chains 8, match/switch 6 (7 pts) (nesting depth added 31). 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":"crates/cast/src/cmd/wallet/list.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ba423bd802541b7e00a9a4cab33ffe8bb4e4cde71db3010cafe74bd04975bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::stmt (cognitive 67): Checker::stmt has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 7 (18 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 38). 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":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"466452ba20f72746335485612224df2ff50aaf2421f0ee53edede0563c2828bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::expr_inner (cognitive 66): Checker::expr_inner has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (45 pts), loops 4 (10 pts), boolean chains 6, match/switch 3 (5 pts) (nesting depth added 27). 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":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d91a6e3b495407a14bee44481de81a4ec66e3a7ec0a3f58d3a19bb4b449819"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::load_state (cognitive 65): Backend::load_state has cognitive complexity 65 (threshold 15). Drivers by points: if/else 36 (50 pts), boolean chains 8, loops 3 (6 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":8839}}}],"partialFingerprints":{"codehealthFindingId/v1":"7483467772ad3b4a439c92a90ccba0a916ffed3eb46767b620112c90efa600af"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark_clickhouse.build_rows (cognitive 65): benchmark_clickhouse.build_rows has cognitive complexity 65 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 13, loops 4 (6 pts), ternaries 1 (3 pts) (nesting depth added 19). 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":".github/scripts/benchmark_clickhouse.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e366ba324ccce758bfa4330488ac7119e97963beae723c1bd631dbcf37141dab"}},{"ruleId":"D2","level":"warning","message":{"text":"PubSubConnection::poll (cognitive 64): PubSubConnection::poll has cognitive complexity 64 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 6 (21 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 41). 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":"crates/anvil/server/src/pubsub.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac30e62e3eb6a8f8819fb9cf5b9749fa66645de2af057357ba1b42e5857583"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::render::render_contract (cognitive 62): forge_doc::render::render_contract has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 6 (15 pts), loops 8 (13 pts), boolean chains 4 (nesting depth added 30). 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":"crates/doc/src/render.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dc54990e1dbf4d524c7e1354d478deb31041c93e7e05e91d2581dc3026886b"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryPlan::validate_signed_payloads (cognitive 61): RecoveryPlan::validate_signed_payloads has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (44 pts), boolean chains 7, match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 35). 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":"crates/script/src/recovery.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac2dbc51e8ee200ef2546fc08d608849c6836a19d4ca2ac598891a9446f0dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyInstallOpts::install (cognitive 59): DependencyInstallOpts::install has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (51 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/install.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"91248ae0755baf892b3a300fc4e53fa39a337fd80c0e75b3036d9b1a57fe8631"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::mutation::orchestrator::run_mutation_testing (cognitive 59): forge::mutation::orchestrator::run_mutation_testing has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 7, match/switch 2 (7 pts), loops 3 (6 pts) (nesting depth added 27). 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":"crates/forge/src/mutation/orchestrator.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7d4a9d5b5ca89d32f99e9443aa99f0cab2680db0ae9a9fd31ad5bd0701b999"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardWalker::walk (cognitive 59): GuardWalker::walk has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (46 pts), boolean chains 8, match/switch 2 (4 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef3503cd900d94040073d484db21c47558cec2065c9c4c2132f2a924cd51c15"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::json::_json_value_to_token (cognitive 57): foundry_cheatcodes::json::_json_value_to_token has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (48 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 34). 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":"crates/cheatcodes/src/json.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc0a330b5f3d8389e11d062afafbabb19bdb2ba861766d36aab24f15cac8aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateArgs::deploy (cognitive 57): CreateArgs::deploy has cognitive complexity 57 (threshold 15). Drivers by points: if/else 37 (50 pts), boolean chains 4, match/switch 3 (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":"crates/forge/src/cmd/create.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b614ac276e84fec4105b9a11ef939435a927478ee2aa2cf2392cd90506412ebf"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicCalldata::variants_with_prefix (cognitive 56): SymbolicCalldata::variants_with_prefix has cognitive complexity 56 (threshold 15). Drivers by points: loops 11 (30 pts), if/else 4 (15 pts), match/switch 3 (11 pts) (nesting depth added 38). 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":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8ad8301a607593929d525b326da14014cbb34f1fb7e52f1f434db062b22516"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_contract (cognitive 55): State::print_contract has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 5, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e809e0e7e8696afc7a4c1d9ceccf34bf94c17a843461968a070295f2cc131c"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::verify::verify_contracts (cognitive 55): forge_script::verify::verify_contracts has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 4 (16 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 32). 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":"crates/script/src/verify.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"826aa923e447aa31b691caf40a363ce5f4a012927b3f2894de82d61a42f17a89"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::replay_persisted_handler_failures (cognitive 54): FunctionRunner::replay_persisted_handler_failures has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (39 pts), match/switch 4 (7 pts), boolean chains 6, loops 2 (nesting depth added 27). 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":"crates/forge/src/runner.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b948b18b50291d25eee6769d7c56a9d207614d71df659adf7c5e63b48ee5ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::expected_emit::get_emit_mismatch_message (cognitive 52): foundry_cheatcodes::expected_emit::get_emit_mismatch_message has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 8, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 19). 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":"crates/cheatcodes/src/expected_emit.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc102a344eb0aea5813246e0979d91a6e10580065c8bbbcdbea5acc968c62cb"}},{"ruleId":"D2","level":"warning","message":{"text":"WarningsProvider::collect_nested_section_warnings (cognitive 51): WarningsProvider::collect_nested_section_warnings has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 4 (12 pts), boolean chains 2 (nesting depth added 31). 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":"crates/config/src/providers/warnings.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e340a7c1a78c785d945f55026baa8789f910f464ccb1fa160cc96158a4f6986c"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiForkHandler::poll (cognitive 51): MultiForkHandler::poll has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 5 (10 pts), match/switch 4 (10 pts), boolean chains 5 (nesting depth added 28). 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":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1971bbcea52cf2674a2b8cb62fae474cc2dfe0cc954671efd94ad7802eb013"}},{"ruleId":"D2","level":"warning","message":{"text":"SymExpr::binop (cognitive 51): SymExpr::binop has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 12 (23 pts), boolean chains 5 (nesting depth added 18). 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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"254c75da7502102253413686a6229c065aab9d2b7a6b58184e6995f49bdff39e"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractRunner::_setup (cognitive 51): ContractRunner::_setup has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf84b5a4ad7aa06efd62aa8db98df56e3db9b60f4915ac3eba050eb5676b72c"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::analyze_expr (cognitive 51): Analyzer::analyze_expr has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 3 (7 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 23). 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":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6a456c125ff98ac79210aabfd23e5772fc6cee06223dbc5d499931ed578539"}},{"ruleId":"D2","level":"warning","message":{"text":"InitArgs::run (cognitive 50): InitArgs::run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/init.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3573ec3ff6ef8ed5ed5dfc0ae798d06096b1e71f1093b5209196e0011dab39e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractRunner::run_tests (cognitive 50): ContractRunner::run_tests has cognitive complexity 50 (threshold 15). Drivers by points: if/else 29 (38 pts), boolean chains 8, loops 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70eed3e1a6c9e25be7668c0e075e67936c884dfc5d210705c443a6df9fe15c5"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_try_stmt (cognitive 49): State::print_try_stmt has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b2b639e6c0979f97763ae2326b772fecc99d47358d1bed7eddbe03f8918546"}},{"ruleId":"D2","level":"warning","message":{"text":"TestResult::render (cognitive 49): TestResult::render has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 8, loops 2 (6 pts), match/switch 3 (6 pts) (nesting depth added 23). 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":"crates/forge/src/result.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2843596495e9e5da08dbbce5b57039693c6b5cc60440e869cf62a477e089716c"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::render::collect_comments (cognitive 48): forge_doc::render::collect_comments has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (32 pts), match/switch 2 (7 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 27). 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":"crates/doc/src/render.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20636bf5a9bfc50828bf89537b2430220a4af66517c7d1ee07372989ea95255"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_ty (cognitive 48): State::print_ty has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 23). 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"90664d18406adaea91f2acfaefb8ef18eb95c643f18eb13d4571d5d8daf5ea4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolveArgs::run (cognitive 48): ResolveArgs::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 5 (12 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/compiler.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3405e0d1512100b9e889a2a6b946139e3aa670dd9c04ec079aa56802d82c23"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateArgs::run (cognitive 48): UpdateArgs::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 12, loops 7 (8 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/update.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbed6c183cc45f44f8fcfc2ccc5b1f7df747a7f219e301bb907aa9fe5dc9ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::showmap::replay_sequence_for_minimization (cognitive 47): foundry_evm::executors::showmap::replay_sequence_for_minimization has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (12 pts), boolean chains 8 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ba2ac3088f2b606119c609cb6109b992ea5ebf104c2099fe2de229a19b366a"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::create (cognitive 47): SymbolicExecutor::create has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (37 pts), match/switch 4 (5 pts), boolean chains 4, loops 1 (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":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b95ed77070a3509bd8e15e4951d3aea34a2ef7c1547620c07dd009bd15e45c"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::vocs::escape_mdx_outside_code_fences (cognitive 46): forge_doc::vocs::escape_mdx_outside_code_fences has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (34 pts), match/switch 1 (5 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 28). 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":"crates/doc/src/vocs.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f3f6531aecd459b36d710604381c87038dc9e53bfcf9421b6a167349f0e35a"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::mapping_storage_provenance (cognitive 46): SymbolicExecutor::mapping_storage_provenance has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 23). 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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fec6edf84af4667ed35dc5e75c29f8249b9e160bb5fdddb97c036b40546ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::reasoning::xor::checked_xor_result (cognitive 46): foundry_evm_symbolic::runtime::solver::reasoning::xor::checked_xor_result has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 8 (13 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/reasoning/xor.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5580ee47a362141b7ad475244075f12098ff64f4d4719cdbe9234790792b72a"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_block_inner (cognitive 46): State::print_block_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 9, match/switch 2 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/common.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce04d2b9eb5d216ff740f25a68603d5decdc4f1387fd0380321655a0dba5aca"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_comments (cognitive 46): State::print_comments has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"e199926f72903f58d4b2f7dc58f963a3b4ed2da8d85a8e55267ceccf6d976427"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::fs::get_artifact_source (cognitive 45): foundry_cheatcodes::fs::get_artifact_source has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 12, match/switch 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d205fda67291e1a2e01beb1ad7fc4370e47b1b9141da9a07f7363e52ca203253"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::call (cognitive 44): SymbolicExecutor::call has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 8, match/switch 5 (8 pts), loops 1 (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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"41366702d435b4579237c6fa102efe9858b5b0e6417b4e8b11285b97ab9e8474"}},{"ruleId":"D2","level":"warning","message":{"text":"CallTraceDecoder::decode_cheatcode_inputs (cognitive 44): CallTraceDecoder::decode_cheatcode_inputs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 7, match/switch 2 (3 pts) (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":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8354c218abd6d1c11512590fa068fa65805fb6f57848e8d9a470f79d80e73bab"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::owner_approvals::prepare (cognitive 44): forge_script::owner_approvals::prepare has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 5, match/switch 4 (5 pts), loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/owner_approvals.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0ea14dce52f6313db6cde6e132f560aa06df0f350bf8cd4185dbfe80a22c17"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::wallet::new_keystores (cognitive 43): cast::cmd::wallet::new_keystores has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 4 (8 pts), match/switch 1 (4 pts) (nesting depth added 23). 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":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"282d3a0851c145a6f7d7087c63d25d3b2625a6701a18bf8ff9110ed1f6db8b96"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalTraceIdentifier::identify_code (cognitive 43): LocalTraceIdentifier::identify_code has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/local.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2a8e3497f9bea8c7104266aff20e03dff83bc6a4bc8181f79145c6085e5ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::fs::deploy_code (cognitive 42): foundry_cheatcodes::fs::deploy_code has cognitive complexity 42 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 6 (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":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3801f281941e6545004d2ea7ec343b08c8c3309f4a16914d7e804e5a9242af8a"}},{"ruleId":"D2","level":"warning","message":{"text":"BytecodeDependencyCollector::visit_expr (cognitive 42): BytecodeDependencyCollector::visit_expr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (9 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3507e6098b8ba4d47fe1a8b28ebe097d93bd35e53a23d032fb91f0d88d76982"}},{"ruleId":"D2","level":"warning","message":{"text":"EquivalenceArgs::run (cognitive 42): EquivalenceArgs::run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 8, loops 3 (6 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/equivalence.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ba03a1ad5c7d9b673e00da38de1a57ce5190838eec1ea613ebca575330d23f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectCompiler::handle_output (cognitive 41): ProjectCompiler::handle_output has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 6 (16 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 19). 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":"crates/common/src/compile.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"49db205215b65bfc09cd5d7354954541a43cb8aa85d9a2b4af9d9e0654a70cb5"}},{"ruleId":"D2","level":"warning","message":{"text":"PreprocessorDependencies::new (cognitive 41): PreprocessorDependencies::new has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 8 (10 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"333d3d3220cbac9b294d4f0f1ce22fe16e5bc8d175038bbd3803a892be03a6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::invariant::result::can_continue (cognitive 41): foundry_evm::executors::invariant::result::can_continue has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/result.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1a2657bc574b50195f0b3304710b30ff3eb555376c83def70783a00347c730"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::run_inner (cognitive 41): SymbolicExecutor::run_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 23). 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":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7595ea5f5aa8218e3825971cb12303b38a196756b255aa376844a319024973e5"}},{"ruleId":"D2","level":"warning","message":{"text":"CallTraceDecoder::decode_function (cognitive 41): CallTraceDecoder::decode_function has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5500dc7eeb55e9f2c631b1a2132b3b1f274d1ebf4a7263d0b735b809e8803326"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::estimate_unsponsored_gas_with_state (cognitive 40): EthApi::estimate_unsponsored_gas_with_state has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 9, match/switch 3 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1217f61ef61fd9a96617640991dabc64cf3565ad673f0f57e92a6d52304d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::reorg (cognitive 40): EthApi::reorg has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). 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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2b5c20f3b865f81f70c7730c19b73190b705b612d6fa78a15b1c4396e11785"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::create_end_hook (cognitive 40): Cheatcodes::create_end_hook has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abd52d43aa1d49dca99bb0d8dbbcf67915d693d1003073c70c89f5ba93b51c6"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::toml::upsert_toml_value (cognitive 40): foundry_cheatcodes::toml::upsert_toml_value has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 2 (6 pts), match/switch 2 (5 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/toml.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a7695d3c06299b9d43a2db0a049a2970cbd3c21fd063459f3f1a8f43e1cee"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionSource::inspect (cognitive 40): SessionSource::inspect has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/executor.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ae5891255323064aab10e3e4a378c4a0012a53d9336b0ac29f45a0fda03c3"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::invariant::shrink::shrink_sequence_by_removing (cognitive 40): foundry_evm::executors::invariant::shrink::shrink_sequence_by_removing has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 5 (11 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 19). 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":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c79e12a11d39cddc1a0a0f02995ef2d35805737eeb1915cad49eee80d2629d"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifyArgs::resolve_context (cognitive 40): VerifyArgs::resolve_context has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 1 (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":"crates/verify/src/verify.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c8a93a5e8174b25e382094c8001846accf00f3293023ee51168da10d7f941a"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::corpus_io::read_corpus_tree (cognitive 39): foundry_evm::executors::corpus_io::read_corpus_tree has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (8 pts), match/switch 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus_io.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b7a72de04d624dcdeab534030e44aa41bd881b709e5dc5e181d1a9870d1e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::workspace::copy_project (cognitive 39): forge::workspace::copy_project has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 5, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/workspace.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f4c067b49b5a955e27422d1a9666e9d2e5e819bf85837b3e97e31804d7e8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::create_hook (cognitive 38): Cheatcodes::create_hook has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fd89ef43955ed698b7036b99d2dea57c7ee30f54bab134f1840fdef596c235"}},{"ruleId":"D2","level":"warning","message":{"text":"Campaign::report (cognitive 38): Campaign::report has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"31babce80e3abbae27765483cc355107ac450722b3edc7807ec6ec3c11cdb623"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::clone::dump_sources (cognitive 38): forge::cmd::clone::dump_sources has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb329f53e852721a41744c5e92052420317f86e0f333e4d4094242ea2282a90"}},{"ruleId":"D2","level":"warning","message":{"text":"AnvilBlockExecutor::execute_pool_transactions (cognitive 37): AnvilBlockExecutor::execute_pool_transactions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 4 (9 pts), boolean chains 3, loops 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":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"93132b022570880baef01fb39ae516d0542d25abe0d9420ed8f49f845e2c8a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::validate_pool_transaction (cognitive 37): Backend::validate_pool_transaction has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 3 (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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":10463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3e3e0b640a99a6518e6e8787c1b67fd46687ad1ca5867c940ad1bc4bcd518f"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::join_call_outcome (cognitive 37): SymbolicExecutor::join_call_outcome has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8, match/switch 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd090852b30b68a3bf9b5d2630332ebf7cbc1e0b230f090e6858ebf0ed689826"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr (cognitive 37): State::print_expr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 9, match/switch 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"460e24b34c3e154ee8355576c921a986fa3c6cefc13520621f90c1fd5277b431"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptProgress::wait_for_pending (cognitive 37): ScriptProgress::wait_for_pending has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 2 (4 pts), boolean chains 1, loops 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":"crates/script/src/progress.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab636e622ab9dcbe9fe284a454739358a0e4ff765517f853549937677a94847"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeConfig::setup_fork_db_config_with_replay (cognitive 36): NodeConfig::setup_fork_db_config_with_replay has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8a0554dfbb4f73558e6a72ee39e7756e66acc737085a4abca0463eb01fce6f"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::json::split_json_value_key (cognitive 36): foundry_cheatcodes::json::split_json_value_key has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/json.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c799a6bc08b0ae05bc02120b02fd72780cc0245905668e8ad198fdf235011d"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_common::preprocessor::deps::remove_bytecode_dependencies (cognitive 36): foundry_common::preprocessor::deps::remove_bytecode_dependencies has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c7d2b357fd2347247803274dc054eba2c60f3f323c9ff5213ce4aff6cfa7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"RemappingsProvider::find_nested_foundry_remappings (cognitive 36): RemappingsProvider::find_nested_foundry_remappings has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"473bbbc04bc9db4666f4515250fecbf7b7a30d6eb2fd13599319cd4c9d3fbca1"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::run_solver_commands (cognitive 36): foundry_evm_symbolic::runtime::solver::run_solver_commands has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 3 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bf13addc07d3afa81a0ba7b8299efa00029d5748d93e2f49bd8071284c8449"}},{"ruleId":"D2","level":"warning","message":{"text":"State::commasep_opening_logic (cognitive 36): State::commasep_opening_logic has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/common.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b2a44a5e70bb10da8824162ca65a83ae1c8907c7a4fe4942711496850d468a"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_lint::sol::med::div_mul::check_expr (cognitive 36): forge_lint::sol::med::div_mul::check_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 19). 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":"crates/lint/src/sol/med/div_mul.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ccffa4b4f04f604b46b7d69f83cd391f124762d8f1a61430eb10e77231eb9a"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorStackRefMut::call (cognitive 35): InspectorStackRefMut::call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 5). 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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e39a923fff141cac9d335e8eb5438749ff679bd1aa943e95861ec46f000907"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageArgs::collect (cognitive 35): CoverageArgs::collect has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (8 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d793dcffd445b563afde1539ff08b1f9ca4afd33d85167451a8075a3f1b67469"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::replay_invariant_checkpoints (cognitive 35): FunctionRunner::replay_invariant_checkpoints has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019229dffb03c83f4f928a81e16278086c8244eb377f038537ac8e45d79c90d"}},{"ruleId":"D2","level":"warning","message":{"text":"PreSimulationState::show_traces (cognitive 35): PreSimulationState::show_traces has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 3 (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":"crates/script/src/execute.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67c9b45ccbe6b7bdbb35272d777d5a6554a9ab27ae8bdfea664581ffb79a577"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotInfo::decode_values (cognitive 34): SlotInfo::decode_values has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aa6d128c3bcef57cbde964cd30e352748f36803ac530b39e1bc3bc6087b411"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::fuzz::minimize_sequence (cognitive 34): forge::cmd::fuzz::minimize_sequence has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 5 (8 pts), boolean chains 4 (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":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"676370b391948edacf7dd022aab3701601f0ff921f4c0236e17a75a6cb3125a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::add_facts (cognitive 34): Analyzer::add_facts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (4 pts), match/switch 2 (4 pts) (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":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"49735b651d6599609bc91828c3419113133dad5f7c4fdf57ee3c4084ed35293a"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::owner_approvals::assemble (cognitive 34): forge_script::owner_approvals::assemble has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (11 pts), boolean chains 2 (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":"crates/script/src/owner_approvals.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"99437a7ae024f29e04dd7dfa2706f5ac59c1297b6e6ce869c1e026341bdf50f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::step_hook (cognitive 33): Cheatcodes::step_hook has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc10e300fba5074bba292094dfee83d95d8c7e7ffed99f740d5358097f854bc"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerCorpus::export_to_workers (cognitive 33): WorkerCorpus::export_to_workers has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 6 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f729741d1a733c8976f37b42c692ed73773f896178e95df422b7777c17753c9"}},{"ruleId":"D2","level":"warning","message":{"text":"SymBytes::append_concrete_range (cognitive 33): SymBytes::append_concrete_range has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad7f76ad54cb0f81a552514c916c8885b9f16e5bcb2b11e3c897ecb0594fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"SymBoolExpr::cmp (cognitive 33): SymBoolExpr::cmp has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 8 (15 pts), boolean chains 3 (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":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08d6c97b99aa94aab8e33d04a80c1e7279186f9f86c21155e2d85135a56bd87"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageArgs::build (cognitive 33): CoverageArgs::build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 5, loops 1 (2 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36271f0811d98f4e677f5b87e8ac9559ca92eb85cb5c362cdca717f1ccf32d3"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cli_markdown::build_command_markdown (cognitive 32): foundry_cli_markdown::build_command_markdown has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 6 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli-markdown/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1947a10d31107b8535a7cdd4c3c70802bf8347ae5486b9f00daf0e2084689a31"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentGatherer::split_block_comment_into_lines (cognitive 32): CommentGatherer::split_block_comment_into_lines has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/comments/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bdcd66866c9c0c589c79cd5fe42a537edf6a18c6ddc0f52f3c16e008ac5a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintContext::normalize_word (cognitive 32): ConstraintContext::normalize_word has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa410382313880f0f9862ebcc4e6c066160904da4230f0660658422f1c69824"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::mutation::orchestrator::resolve_mutate_paths (cognitive 32): forge::mutation::orchestrator::resolve_mutate_paths has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/orchestrator.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd85edb7962390f8eac47248be085fd21864614e707b6beddf3ab5ba236a9ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryAnalyzer::analyze_expr (cognitive 32): EntryAnalyzer::analyze_expr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 9, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acf73e2bb050b7e18c2693cb014e87a22ff9e7daa2dec36be0eec57cedb3051"}},{"ruleId":"D2","level":"warning","message":{"text":"Cx::unsafe_mint_target (cognitive 32): Cx::unsafe_mint_target has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 12, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f46f68f2304e23b15560e1d74c5b08f42d10f057faf3d7e4c09065fee80e83e"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifyArgs::run_with_resolved_context (cognitive 32): VerifyArgs::run_with_resolved_context has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (8 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"62356332e224a15b089fc8d8f47f138c3ac4fdc286e51c74254c7edf177c38c4"}},{"ruleId":"D2","level":"warning","message":{"text":"LogsSubscription::poll (cognitive 31): LogsSubscription::poll has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/pubsub.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd4682f7d64e0b8b3ec434495134f181e23535862f762735b2439d80c522faf"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalCompilation::merge (cognitive 31): ExternalCompilation::merge has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 6 (14 pts) (nesting depth added 17). 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":"crates/common/src/external_compiler.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"142306637c0d837dff8a0c049879466e796beaa104c2efa66373f0104ce7c9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"StateSnapshots::observe_writes (cognitive 31): StateSnapshots::observe_writes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/snapshot.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"562a2d4b4c6a00ea985f5ec05cda8c84560de8decd087a3e0c0917a26d3d2a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"State::estimate_size_inner (cognitive 31): State::estimate_size_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (7 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"030c910ca61a4982a6ebb3f78c367060e767574eda287fa5b5aeefe740952499"}},{"ruleId":"D2","level":"warning","message":{"text":"AnvilEvmArgs::resolve_rpc_alias (cognitive 30): AnvilEvmArgs::resolve_rpc_alias has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (7 pts), match/switch 1 (4 pts) (nesting depth added 19). 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":"crates/anvil/src/cmd.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dc48cda7496de2fe6c33180341ee485de8e0a365680df220f956bb5e79ef37"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::logs::stream_logs (cognitive 30): cast::cmd::logs::stream_logs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (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":"crates/cast/src/cmd/logs.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af82e74d1ffc488396da4444497bc90c8e0bea1bd39af4e707693c9790ce40b"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::step_end_hook (cognitive 30): Cheatcodes::step_end_hook has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"650857df0dd61809256b38ea87925a53352b0fae3dd4c85305af106af17707ed"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::fs::parse_artifact_path (cognitive 30): foundry_cheatcodes::fs::parse_artifact_path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 3, match/switch 1 (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":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aff97b9a24246b8f83853d62719eda83606c972414831dab65c992100caa23b"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cli_markdown::write_arg_markdown (cognitive 30): foundry_cli_markdown::write_arg_markdown has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli-markdown/src/lib.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"000d464f296ce88e41d8e14eb9e961e35098db3dc80c913a6b986c4e5ebde5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryReferences::visit_expr (cognitive 30): LibraryReferences::visit_expr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/namespaced_storage.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe4bf329d3ec19a5d7932f98136a5f0fc83324cb5dcd1498f35d47794c4ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::free_address_write_targets (cognitive 30): SymbolicExecutor::free_address_write_targets has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), match/switch 3, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd04dccf6d1501479db3f8c619f5452a8fccdefd431e1d27ddfe9f07e72a3850"}},{"ruleId":"D2","level":"warning","message":{"text":"PathState::expr_upper_bound_usize_cached (cognitive 30): PathState::expr_upper_bound_usize_cached has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 6 (13 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6aedc4c54409ef039782f46efafdff2a8308b974acb923fcbf80730b089bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExploitArgs::run (cognitive 30): ExploitArgs::run has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 7 (13 pts), match/switch 1 (3 pts) (nesting depth added 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":"crates/forge/src/cmd/exploit.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311b84d18d97c03097ba0e6a8d9891ac8826577effa9043a0663c4efccf1677"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::args::run_command (cognitive 30): forge::args::run_command has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/args.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a07dbc3c7a9170bc0fa827758a0c0e32535748d8d89e6a6040c9830816df1f"}},{"ruleId":"D2","level":"warning","message":{"text":"DelegateTargetCollector::visit_modifier_chain (cognitive 30): DelegateTargetCollector::visit_modifier_chain has cognitive complexity 30 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 6 (13 pts), boolean chains 1 (nesting depth added 18). 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":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1401659003779777fe7ee9fa615ce6d25d0c94da45db02872d02f0bcc6f9c927"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingInheritance::check_project (cognitive 30): MissingInheritance::check_project has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/missing_inheritance.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f70db338e22f326e7a5563ccd35e20804beac25df12fd061f162572f22ca0ed"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_lint::sol::med::uninitialized_state_variables::storage_aliases (cognitive 30): forge_lint::sol::med::uninitialized_state_variables::storage_aliases has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (7 pts), match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/uninitialized_state_variables.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff339128ee861f494524827743107bda3f97ce28dede26a76dc54443ed012f0"}},{"ruleId":"D2","level":"warning","message":{"text":"FilledTransactionsState::bundle (cognitive 30): FilledTransactionsState::bundle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/simulate.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15880843a5892fd5eba140d59fe7b121fec4d7c985cfae69288bacdc98ad5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchMakeTxArgs::run (cognitive 29): BatchMakeTxArgs::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8dc3f37993e7bd7424aafdce9b2a11279c08c18fe7b5505292d507715c8f12"}},{"ruleId":"D2","level":"warning","message":{"text":"TomlFileProvider::read (cognitive 29): TomlFileProvider::read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/ext.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9c93b00fbcf58ae7a714cbd4d11db11cfffefa5b972e76ba38c6cdea2643ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionLifecycle::resume (cognitive 29): ExecutionLifecycle::resume has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 7 (9 pts), boolean chains 8 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e679115c1c08b90f6e498948fa8556910d5bee13ad3cdea96f6276c7da134c28"}},{"ruleId":"D2","level":"warning","message":{"text":"FuzzCminArgs::run_to (cognitive 29): FuzzCminArgs::run_to has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"54420c80cc2b4221c2a86197fe226ea9acb6f55709b3e97bc032210385556640"}},{"ruleId":"D2","level":"warning","message":{"text":"DelegateTargetCollector::visit_expr (cognitive 29): DelegateTargetCollector::visit_expr has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 5 (10 pts), match/switch 2 (3 pts) (nesting depth added 16). 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":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"53337583a8755fc0d2f30a5469dffc5b7e0071936a1f2f225464587ea4e4e1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"DelegateTargetCollector::visit_stmt (cognitive 29): DelegateTargetCollector::visit_stmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (13 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47cbb90230e70adad23e16f9c6771134104721df1021018903bd3b10fa05372"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptRunner::setup (cognitive 29): ScriptRunner::setup has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/runner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0888d92afebf1969f1569146f23ca91b8e01592615bde04fd4de5f479cec49"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::fee_history (cognitive 28): EthApi::fee_history has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 5 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). 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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"416873fa2d17fa7b8e3f24946eb128c62d013147884bdd890145728af8d8ea72"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::do_mine_block_locked (cognitive 28): Backend::do_mine_block_locked has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 2). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":6510}}}],"partialFingerprints":{"codehealthFindingId/v1":"df99142c32c65861b2f21affc80f9384a5bca4a413dfd447ae53c6198d33912f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadyTransactions::prune_tags (cognitive 28): ReadyTransactions::prune_tags has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (10 pts) (nesting depth added 19). 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":"crates/anvil/src/eth/pool/transactions.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ee5a611514d91cce8fe8e7e290bd2e9110c2d819f203f149967ec99695e20"}},{"ruleId":"D2","level":"warning","message":{"text":"TxBuilderInner::build (cognitive 28): TxBuilderInner::build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/tx.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41b38a06aedb8835b6da4564d8903e982b6ef79c092a4faa0d8fa01d0b2bf12"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentGatherer::process_token (cognitive 28): CommentGatherer::process_token has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 14). 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":"crates/common/src/comments/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e0506b6862ba99aee770649215ff6bf6df696e959fb32fb18212ade68e1fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicTestLinkingPreprocessor::preprocess_with_dependencies (cognitive 28): DynamicTestLinkingPreprocessor::preprocess_with_dependencies has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90a9a4f0510dcd36b91b0ebd3a017a38261030d4c18130a6daf5a08958e29e"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotIdentifier::handle_struct (cognitive 28): SlotIdentifier::handle_struct has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), boolean chains 3 (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":"crates/common/src/slot_identifier.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c71b48ab4093a05b677a72085cbc0bf45a076d2b3b8717f829f5eafc8537eb"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::vocs::build_sidebar (cognitive 28): forge_doc::vocs::build_sidebar has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 5 (9 pts) (nesting depth added 16). 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":"crates/doc/src/vocs.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab1d164a396989c4844048e5e8ecd1ab9938aa4c0b2161f34114770828cf99e"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorStackRefMut::create (cognitive 28): InspectorStackRefMut::create has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 5 (nesting depth added 3). 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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ac085ad97ef9722184113eca881959fec13846e87f3608e974fcf39b472df0"}},{"ruleId":"D2","level":"warning","message":{"text":"SymBytes::slice_concrete (cognitive 28): SymBytes::slice_concrete has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f3916f349f44f0ea2113d26e08548495110a4e2f6dd80fb4b08425fd4efec5"}},{"ruleId":"D2","level":"warning","message":{"text":"SmtLibSubprocessSolver::is_sat_inner (cognitive 28): SmtLibSubprocessSolver::is_sat_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 4, match/switch 1 (nesting depth added 5). 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":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a01e9ec90192cf6fa1aa2be430a1726d700d9f2e88ae24e25a56acc41376b86"}},{"ruleId":"D2","level":"warning","message":{"text":"PathState::apply_executor_env (cognitive 28): PathState::apply_executor_env has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 8 (10 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"787647fb4d20a272f64cdab06d06cf2f42289c21cdc3a03276ca882639c26905"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_wrapped_line (cognitive 28): State::print_wrapped_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d047b3154e220476caea48af2ce0e5582f2f6c2901e67121fe1fd9d30d309"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_yul_block (cognitive 28): State::print_yul_block has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/yul.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d571735e01cd7a261f2f6f4de0424009b3754d6a0a3d462bcf4ffe10a788334e"}},{"ruleId":"D2","level":"warning","message":{"text":"LcovReporter::report (cognitive 28): LcovReporter::report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/coverage.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"738234baed2244d0510e597d13b4dfcac290d4e8445fcd35e5a363bd07269831"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::watch::clean_cmd_args (cognitive 28): forge::cmd::watch::clean_cmd_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/watch.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"207cd8c38ccb9d361f1b3af5adc8ce5371c224ad280e3fff26fc82aefcfd47b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::visit_stmt (cognitive 28): Analyzer::visit_stmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). 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":"crates/lint/src/sol/high/controlled_delegatecall.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"157d14140a2d261361604f1e7156a8da69dd4f45999fa193f568e570d3cc289b"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::with_genesis (cognitive 27): Backend::with_genesis has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23 (27 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1f96652a59ff7982a4e45983df8d7edf2286a8b7e511aa83595225abd4029f"}},{"ruleId":"D2","level":"warning","message":{"text":"FindBlockArgs::run (cognitive 27): FindBlockArgs::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/find_block.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2241a978fd554d15f12e47fd1c9355892738f7969a7bef64880d42cedf65a5"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_common::tempo::configurable_account::quorum (cognitive 27): foundry_common::tempo::configurable_account::quorum has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (10 pts), boolean chains 1 (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":"crates/common/src/tempo/configurable_account.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be1b352ea2d614d932ce45032f7a58953d840cb626616117861e7ec0bce5c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::corpus::sequence_from_test_trace (cognitive 27): foundry_evm::executors::corpus::sequence_from_test_trace has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"0965e8ade98d53fe1fea8717346273808dabf4f52283d33950c6be5219381a87"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::normalize::normalize_cmp_for_solver (cognitive 27): foundry_evm_symbolic::runtime::solver::normalize::normalize_cmp_for_solver has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e552a724aff47109971862ebe752ba0b858b12aee0e5063bcd5705d30247673"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_fn_attribute (cognitive 27): State::print_fn_attribute has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 14). 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"77926f15c61d577cd26a80d68d6359b49a7ad8120f7569d90467cda3a0a381d8"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::symbolic_minimizer::minimize_compound_value (cognitive 27): forge::symbolic_minimizer::minimize_compound_value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 1 (nesting depth added 13). 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":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d2982067fb135e1ccfb8427136c39772583a294d34bc204cb36f3aadcee34a"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::stmt (cognitive 27): Analyzer::stmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 13). 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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"766b2e7011595147e4b76e20119150cb10b6fbb377a570fc67cd4aaea382831f"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::analyze_stmt (cognitive 27): Analyzer::analyze_stmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bea08a2bcb890a7709524a96b3fddca1f3b7e2d3eabb1b2a0fc274437be651"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::analyze_stmt (cognitive 27): Analyzer::analyze_stmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/reentrancy_events.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ec5e76cb6b861ea43907d68e513066472cda8621fe7ba7263ab00b2c3810b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptArgs::preprocess (cognitive 27): ScriptArgs::preprocess has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 5 (nesting depth added 5). 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":"crates/script/src/lib.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"012a09661602cafb1c4e24ac6ff58fbfea24dcb5e8e230f505193fae1a2b63a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptArgs::check_contract_sizes (cognitive 27): ScriptArgs::check_contract_sizes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"c151de5c988dcb26d43c2c6bd92c214a0b8bf86ae4098e2da4f9a7e39813ef87"}},{"ruleId":"D2","level":"warning","message":{"text":"PreSimulationState::eligible (cognitive 27): PreSimulationState::eligible has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, match/switch 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/library_deployments.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba212bf593a7e6dde54fd17c8f6cdf3604c38d7a4f3463bcfe2794782e1f096"}},{"ruleId":"D2","level":"warning","message":{"text":"PreSimulationState::collect_simulation_results (cognitive 27): PreSimulationState::collect_simulation_results has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/simulate.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"490b0b8758f5ba625d4a9573ee009c9e1f9cd9a061ec254b89163dbd6eca375b"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::stage_fork_reset (cognitive 26): Backend::stage_fork_reset has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 9, match/switch 2 (nesting depth added 2). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":5193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94b05ca89c94890e84baaf2114ed9e55af3d7192b9c2036a1e9042b4e077653"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::debug::handle_traces (cognitive 26): cast::debug::handle_traces has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/debug.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a6282097d472a72a1083d5a227aeacd2d161aeed8d6835e3939ca96ce90948"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountStateDiffs::fmt (cognitive 26): AccountStateDiffs::fmt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"938efbefb6b1b978b80f69e4ff15815b5c3ddfde8f104ebcb1a310a2307b6fca"}},{"ruleId":"D2","level":"warning","message":{"text":"SymExpr::known_byte (cognitive 26): SymExpr::known_byte has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (6 pts) (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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c3007119dce92765647f4c25bc45f8a0544820a172e67d858ca9a65be965ac"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::fallback::seed_bounded_support_vars (cognitive 26): foundry_evm_symbolic::runtime::solver::fallback::seed_bounded_support_vars has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (7 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"3302cfd5923235638ccb9f172cfe73777bc404540a21965b0e15fc2a24184dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"CallTraceDecoder::populate_traces (cognitive 26): CallTraceDecoder::populate_traces has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4418817ba5f6cc5b524594220fa52911b0058b295afbe207f1038e5095d019"}},{"ruleId":"D2","level":"warning","message":{"text":"State::brace_spacing_delta (cognitive 26): State::brace_spacing_delta has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b82fe9bbbef9c6963c94d33a7bcd51a1b8fd85ed3b5600f6ff3de1b40f3a22e"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_bin_expr (cognitive 26): State::print_bin_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d82279c8dfa9821f77cf118b238e5716bc29a30e04f9b03d63c8104bf9c43d"}},{"ruleId":"D2","level":"warning","message":{"text":"State::is_single_line_block (cognitive 26): State::is_single_line_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 6, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6ca1a4ef601bd3545460d57920194e29d0bf541791ff2500b34614ae41729d"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectArgs::run (cognitive 26): InspectArgs::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de7fea2709898076e9687aa05b40f0bbb660a10b7dbc4fa31ff5c9dd08b380a"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::import_symbolic_fuzz_frontiers (cognitive 26): FunctionRunner::import_symbolic_fuzz_frontiers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4880874286584ae93d01e0de646769df5d30828f31ea3dd0ad801369261e08"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::run_fuzz_test (cognitive 26): FunctionRunner::run_fuzz_test has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":5205}}}],"partialFingerprints":{"codehealthFindingId/v1":"468103a759f595ebe1c93decc8a77974922148e6d5f6d38ff7924773695888c9"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::fmt::format_diff_summary (cognitive 26): forge::cmd::fmt::format_diff_summary has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 pts), match/switch 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fmt.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1545b5691fa55bf967f53e82b45f9dff327028e654a2ec371fcaba9ade84ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::add_facts (cognitive 26): Analyzer::add_facts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1 (3 pts), boolean chains 1, match/switch 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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70c598c8af14f34f923998bc731aacd577dc6092400f40a6b96aab3188622ac"}},{"ruleId":"D2","level":"warning","message":{"text":"SolidityLinter::lint (cognitive 26): SolidityLinter::lint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (6 pts), boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be1ccd4d9296c23b311a08a68215304aab150aca427a7ca28dc6d7754b71c99"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptArgs::run_script (cognitive 26): ScriptArgs::run_script has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb8af67593a2081ef1e0e594fa138dea2195175422eb9f510a88f208adab31"}},{"ruleId":"D2","level":"warning","message":{"text":"PreSimulationState::equivalent_candidate (cognitive 26): PreSimulationState::equivalent_candidate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts), boolean chains 3, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/library_deployments.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"871fa9a7c599004abb4dbc5e9fb7166be14b93318e5e99fc275c63568cf6ecba"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::expected_emit::observe_log (cognitive 25): foundry_cheatcodes::expected_emit::observe_log has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, match/switch 2, loops 1 (nesting depth added 3). 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":"crates/cheatcodes/src/expected_emit.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad6585303cbdf99a366d9150fa747896fd77a90e60a5e9ef2a663a0d5987b67"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cheatcodes::json::strip_json_comments (cognitive 25): foundry_cheatcodes::json::strip_json_comments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/json.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda37bf1ebfb3dab3c3c27a87ea20f6ab834a3f2577696628061d2edd33c00de"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependency::from_str (cognitive 25): Dependency::from_str has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/dependency.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ef29e6d463dd360d1fa720ddd34940912a52ee35817f97e66389745837617"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_common::tempo::auth::ensure_access_key (cognitive 25): foundry_common::tempo::auth::ensure_access_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/tempo/auth.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef1e9890d0a10f0f610193d52957ef679bf2181fb7c2d14edba14be091b0f64"}},{"ruleId":"D2","level":"warning","message":{"text":"FuzzCampaign::run_sequence (cognitive 25): FuzzCampaign::run_sequence has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/campaign.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a1723e0be6052bb8bcea090b4e886feb8a0f1e24409fecc6bd1f9b34210f0"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_traces::trace_arena_at_depth (cognitive 25): foundry_evm_traces::trace_arena_at_depth has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), match/switch 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/lib.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dadb518f7aa4df0be401f18f1bdc522d8e5d077771a37ea1642f78e99565d1"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::properties::project_fingerprint (cognitive 25): forge::cmd::properties::project_fingerprint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceea01752b2a391faa571d6bed02467b478677676655d51626aea0533b26843"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::mutation::runner::run_mutations_parallel_with_progress (cognitive 25): forge::mutation::runner::run_mutations_parallel_with_progress has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/runner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fc34962225841e007c977eb526785cbccd3044158d98ab597edcdc70ee8b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryAnalyzer::analyze_stmt (cognitive 25): EntryAnalyzer::analyze_stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e132429f2736cdeb3f03ef028e54e45ac44526b7ecb93d0fb23a575ec8c83b48"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::verify::external::candidates_from_output (cognitive 25): forge_script::verify::external::candidates_from_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify/external.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"350a01ad3e78cbab067eadc8cfbe729d3146ea38b10d98a6545ae7991feb3801"}},{"ruleId":"D2","level":"warning","message":{"text":"VerificationProviderType::client (cognitive 25): VerificationProviderType::client has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/provider.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a6c7ef1bc66423c3e4a6893d468490861e9adf692834982491db6ffa7175cd"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameScan::advance (cognitive 24): FrameScan::advance has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (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":"crates/anvil/server/src/ipc.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca27601ec5f503fb7c1ec830c4b5f9a3c8b1c1a2463e7ef9d49f0ffa47c85bce"}},{"ruleId":"D2","level":"warning","message":{"text":"InterfaceArgs::run (cognitive 24): InterfaceArgs::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/interface.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cff292b8d14899e41c233165560388720a408877f6de8501b96329d803f5788"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::keychain::check_expiring_nonce_window (cognitive 24): cast::cmd::keychain::check_expiring_nonce_window has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5139c60016bab938d77d26e872cabae1f5d82178fa66034f8217d08018413191"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_debugger::soldb::write_bundle (cognitive 24): foundry_debugger::soldb::write_bundle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/debugger/src/soldb.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2202353c4d957b777c0c6f416b75245a83a6f9b5f51cc9cd98c42bbfd824130"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::hir_ext::implicit_edge_compatible (cognitive 24): forge_doc::hir_ext::implicit_edge_compatible has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 9, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"404b1154998fe83102b77901ea3e7cb3dac0c6c82c55341c46ce1b857ce7fa1b"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::corpus::replay_corpus_sequence_with_executor (cognitive 24): foundry_evm::executors::corpus::replay_corpus_sequence_with_executor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"0340b3faf14d8fc9f11b3258f32e745a6f819cef2b98cbf0c68cd6ecd02178fd"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::corpus::replay_corpus_sequences (cognitive 24): foundry_evm::executors::corpus::replay_corpus_sequences has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e4e829cc921252ab4fc0c79368011b45effc879cd2f694489ac371d291299e"}},{"ruleId":"D2","level":"warning","message":{"text":"SymExpr::unsigned_bits_cached (cognitive 24): SymExpr::unsigned_bits_cached has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (11 pts), loops 1 (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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"821b670319713dd3d53de99ececfabb0f29e93969f78327dbf3859840ada5036"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::folded_slots::walk_mapping_slots (cognitive 24): foundry_evm_symbolic::runtime::folded_slots::walk_mapping_slots has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/folded_slots.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bb72ada8fa144bb4675b1368ea8b16d39ca2a1059eeee5f83325b7d10c5646"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalIdentifier::get_abis (cognitive 24): ExternalIdentifier::get_abis has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab6fc2487dc45781c928afae95b2fb5ee96807e29fb2c443da29526a430d204"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_source_unit (cognitive 24): State::print_source_unit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"56422f37e465ebb2008e43ced5c33303fd510e4203900983991d23f577f54f99"}},{"ruleId":"D2","level":"warning","message":{"text":"BindJsonArgs::find_and_resolve_structs (cognitive 24): BindJsonArgs::find_and_resolve_structs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/bind_json.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb54ae9022f2675589aeae236cae09d1516d398febe6c09e288605fe73ca256"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::import_symbolic_invariant_frontiers (cognitive 24): FunctionRunner::import_symbolic_invariant_frontiers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 7, loops 3, match/switch 1 (nesting depth added 1). 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":"crates/forge/src/runner.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9dd6ae66a68fb1d470651b7d2bc1397eea69b0f13f61e1ac408d67c38ad70d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtectedVars::check_nested_contract (cognitive 24): ProtectedVars::check_nested_contract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (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":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9cb3ab57dc0c2cda8b2704fc4c7796c7a5d966738fae9ba11c7e2827ea8eab"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_common::external_storage::resolve (cognitive 23): foundry_common::external_storage::resolve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/external_storage.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0a0e49fae23170681f01c1e3bf4d8bdcb71322640d0c114987aa1eddda394e"}},{"ruleId":"D2","level":"warning","message":{"text":"WarningsProvider::collect_warnings (cognitive 23): WarningsProvider::collect_warnings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (9 pts), boolean chains 4 (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":"crates/config/src/providers/warnings.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fc88a26b0628a65b02c372adff0644a430065e5e801ed0351abb4d1e86a348"}},{"ruleId":"D2","level":"warning","message":{"text":"WarningsProvider::collect_standalone_section_warnings (cognitive 23): WarningsProvider::collect_standalone_section_warnings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/warnings.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce71ea206db9200fc088828806cd3720312bbf2fc91405223e561fc31e17821"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerCorpusSeed::load_from_disk (cognitive 23): WorkerCorpusSeed::load_from_disk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"557bed048efc44003654988fe17a71ccae01f4270115c02d6757ffab00d5940b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerCorpus::calibrate (cognitive 23): WorkerCorpus::calibrate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 1, loops 1 (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":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b36a62704cf45b84f0da93c6dd6a3be77171a73ca9557f99416108667672fda"}},{"ruleId":"D2","level":"warning","message":{"text":"RawCallResult::merge_edge_coverage (cognitive 23): RawCallResult::merge_edge_coverage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d20dbfa684f85dae9856fe2d174fcbc3a169493cd964ef142e7edafcdf76991"}},{"ruleId":"D2","level":"warning","message":{"text":"SymExpr::byte_term (cognitive 23): SymExpr::byte_term has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (3 pts) (nesting depth added 13). 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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75dd7577cb04383c3adaa692969c0fcc8b1a63a46bcd42c0a6a292b94eddfeb"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::reasoning::xor::check_certificate (cognitive 23): foundry_evm_symbolic::runtime::solver::reasoning::xor::check_certificate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/reasoning/xor.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9339b0fe97852d8f4f14e0d6e211a62c7523c24064959822c7e9ac93546ea846"}},{"ruleId":"D2","level":"warning","message":{"text":"SparsedTraceArena::resolve_arena::clear_node (cognitive 23): SparsedTraceArena::resolve_arena::clear_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8f1eabcfbba03f9d76a95e9f214b96ba5c9614826c459edf15c1ec5b84d8a6"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_index_expr (cognitive 23): State::print_index_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"372910a786e95179d2886d7c7039dd0318b2a782386d4c88dc7d14c233dd5910"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiContractRunnerBuilder::build (cognitive 23): MultiContractRunnerBuilder::build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/multi_runner.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1539051184dbac9245f4cf2750d2dbccbdb82e2b73af354c1c8f6f36829198b"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::stmt (cognitive 23): Analyzer::stmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_eth.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"171419d0411412b8ffce75affcbfd2616f736dc72a4630ca8a5454722b0272f3"}},{"ruleId":"D2","level":"warning","message":{"text":"TodoComment::check_full_source_unit (cognitive 23): TodoComment::check_full_source_unit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/todo.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4750c41003bab27bebaaa1c9129014c222fcf4dbec83b383aa3768a7c908ae94"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteAnalyzer::visit_stmt (cognitive 23): WriteAnalyzer::visit_stmt has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/missing_events_access_control.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7142a43db097d00acab91ec3c561092bc4ee3793308e8e413446ec559536259d"}},{"ruleId":"D2","level":"warning","message":{"text":"PreExecutionState::maybe_new_sender (cognitive 23): PreExecutionState::maybe_new_sender has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/execute.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9159ac0ad3fada10e6f920c1cb2fcfac2e36c2072e0b34f81200d2915874478b"}},{"ruleId":"D2","level":"warning","message":{"text":"DynValueFormatter::value (cognitive 22): DynValueFormatter::value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). 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":"crates/common/fmt/src/dynamic.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac92099789faeeb503ba24538c831120b400109e0fdff0deb0d192efe3706fe"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::hir_ext::effective_natspec_doc (cognitive 22): forge_doc::hir_ext::effective_natspec_doc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c748f325c054a1deb30d129d41c1f52b29645f1462378faced7fbeab7cfd05d"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_core::evm::lifecycle::merge_changes (cognitive 22): foundry_evm_core::evm::lifecycle::merge_changes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd6ecb510b13b48e31e844bd9802fd701bf41a4fbe435f5fd185590114408bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::deploy_code_cheatcode_call (cognitive 22): SymbolicExecutor::deploy_code_cheatcode_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8694d2c555aa8f5d09843c243ad5958d4fb8a1bab4444d4bf7f7bdb640de8bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"SymBytes::byte (cognitive 22): SymBytes::byte has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 10). 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":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"67994caab6136d7b9a38d1db70cb422b2ce3a4ca2054ac1448d01c5804171879"}},{"ruleId":"D2","level":"warning","message":{"text":"SymBinOp::eval (cognitive 22): SymBinOp::eval has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (nesting depth added 7). 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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"52548d3e67cb17f6272a9a455633286fc18ce631d1178dff0a193ea7d865bc19"}},{"ruleId":"D2","level":"warning","message":{"text":"ContractSources::insert (cognitive 22): ContractSources::insert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/debug/sources.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1af0bf4f282dda70d8e5e6c765de00046e175e0bdf6d1c1b6494fbeae40532"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalFetcher::poll_next (cognitive 22): ExternalFetcher::poll_next has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62accb2678159d7b95aed81133acf392a9ab793d2be6aa70ee39a49bde2422a"}},{"ruleId":"D2","level":"warning","message":{"text":"LintArgs::run (cognitive 22): LintArgs::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 1 (2 pts), match/switch 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/lint.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3914626c8c2d3618c8ee3eb58ab5adf555bce9907153d467a23944d71fbec3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionSelectorCollision::check_nested_contract (cognitive 22): FunctionSelectorCollision::check_nested_contract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 3 (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":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ed735387cb553da217e8ac22e36b42bef32d00298b9d9df1a59add9e901b57"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_lint::sol::analysis::access_control::for_each_guard (cognitive 22): forge_lint::sol::analysis::access_control::for_each_guard has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/access_control.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417ac6b861eedad2ebdffc98fbd0891c52c47b8930e5569dc441e2e5431a8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"FilledTransactionsState::print_gas_estimate (cognitive 22): FilledTransactionsState::print_gas_estimate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 1 (nesting depth added 5). 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":"crates/script/src/simulate.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"45abd4a617f08c42b49a5d9026e7be32f4bb308ecaf8f350c02617cfa2a61c93"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptTransactionBuilder::set_call (cognitive 22): ScriptTransactionBuilder::set_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/transaction.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8edbd244a5a63a01551e8e7939c656f778c41833454403ef32f2c69ed4b9c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"compare-benchmark-thresholds.compare (cognitive 22): compare-benchmark-thresholds.compare has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (10 pts), boolean chains 1, loops 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":".github/scripts/compare-benchmark-thresholds.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc0b7c47d19f4fc9dc2f0b87b6870a94a10cb940861705d47c8e2b60fd518d5"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeConfig::setup (cognitive 21): NodeConfig::setup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6caec863b91a82748a39cd83c82118545548c5ddfea63ab02beee7988af9a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::parse_transaction_request (cognitive 21): Backend::parse_transaction_request has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":3454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3ab69cd41f2eefc945b12e9178a0a3bbca0f9b457ccea6f2bcd8880dd52265"}},{"ruleId":"D2","level":"warning","message":{"text":"anvil::try_spawn (cognitive 21): anvil::try_spawn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 1, loops 1 (nesting depth added 2). 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":"crates/anvil/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5bf5c93f74489b73a77fc308ac310cb7df971a9645de64f33d2f695ad90e9"}},{"ruleId":"D2","level":"warning","message":{"text":"RunArgs::prepare (cognitive 21): RunArgs::prepare has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 4). 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":"crates/cast/src/cmd/run.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd63bf06852ab4d7664eec939cd763e671796530f7ce1b8cd9c76131a96028d"}},{"ruleId":"D2","level":"warning","message":{"text":"StorageArgs::run (cognitive 21): StorageArgs::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, match/switch 4 (nesting depth added 2). 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":"crates/cast/src/cmd/storage.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0525658bf2b2dab42d0128fd6694680a29d0b4567eb66bf3646a3ca4db01d7"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::wallet::new_keypairs (cognitive 21): cast::cmd::wallet::new_keypairs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1d2e3aa49f43d0e2d116373b00a0254a4c8dbc8ce56afda5044348cb799776"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::wallet::session::split_for_command (cognitive 21): cast::cmd::wallet::session::split_for_command has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/session.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9c5675b0bfe2f9beb8d8390ec7e9442fad18ead6f24b2e123dedd70de5220a"}},{"ruleId":"D2","level":"warning","message":{"text":"Cheatcodes::finish_created_accounts_frame (cognitive 21): Cheatcodes::finish_created_accounts_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4773e93dafa69c7c16f1b650b630b0f304326d329c06d98fc20ad3a505cd944d"}},{"ruleId":"D2","level":"warning","message":{"text":"Git::submodules_in_worktree (cognitive 21): Git::submodules_in_worktree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf477715e3cc1119f5327cb1ae5b10d2a3b23009c6e4ba4a4245de700df176b"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotIdentifier::handle_mapping (cognitive 21): SlotIdentifier::handle_mapping has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"425de3a39d2a07573b2a2a3e53b10ea3443f63282f5b01ac8d4709c2162fa3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocBuilder::build (cognitive 21): DocBuilder::build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9c185506a74a082bb3e563415e61c9720099576bf0efed3c665903fe0b2fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"PersistentWrite::apply_all (cognitive 21): PersistentWrite::apply_all has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d910aa4b11b03adceece64363415af3804ee1b8ab4384a84ff50c368bffb476"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerCorpus::seed_from_test_traces (cognitive 21): WorkerCorpus::seed_from_test_traces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e4cda1bff0842d6b2c57f7195d654396f4af11e305333d7d4ad6be68bd9e23"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerCorpus::load_sync_corpus (cognitive 21): WorkerCorpus::load_sync_corpus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c706f51d7a0b12dd9476e2d6a928ed6c367daf48860ccb8ac0cc7d1a4a29bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::split_symbolic_target_candidate (cognitive 21): SymbolicExecutor::split_symbolic_target_candidate has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 5 (8 pts), match/switch 1 (2 pts) (nesting depth added 10). 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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bfb1543ce8ec6ac96f3f5b29218cab45e76e11fa9cf7042c159b54ba3b87f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::equivalence_mismatch (cognitive 21): SymbolicExecutor::equivalence_mismatch has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 6 (9 pts), boolean chains 1 (nesting depth added 6). 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":"crates/evm/symbolic/src/executor/equivalence.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef540eeace3ad41351bb7aabd4a9888d9a80f38ef49c78351afdf852fe43b7e8"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::pop_next_feasible_path (cognitive 21): SymbolicExecutor::pop_next_feasible_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"176acf7d9f7a94364a5b7e0515e3b3fbcb6ed5c77fbaa34eab55d9ff26951320"}},{"ruleId":"D2","level":"warning","message":{"text":"FoldedSlots::resolve_nested (cognitive 21): FoldedSlots::resolve_nested has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/folded_slots.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ce104e662094abb56a441b13e4b3c92b287bd3202a6f1048f55a22eb921505"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelSexp::value (cognitive 21): ModelSexp::value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb3b54539277f87352226705dacca4fc143b5bc61674997d2a521b2f4be1c24"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintContext::bounded_bool_value (cognitive 21): ConstraintContext::bounded_bool_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c4c4cef5c93840cc7c12315fa175ab3377409de05a1d6804d6efeca8aedc03"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintContext::normalize_signed_add_comparison (cognitive 21): ConstraintContext::normalize_signed_add_comparison has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"339de92d134cc8e9b027e82cd150d6e29766d5a918fee41b84d3675dafbec107"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_traces::render_trace_arena_inner (cognitive 21): foundry_evm_traces::render_trace_arena_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd68fe53cb21afe3c211500b842ada8dd3873b47faf3cddd1aa503c52fd596"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_num_literal (cognitive 21): State::print_num_literal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"crates/fmt/src/state/common.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2cf29a5079b1e80cfc3a758f786d715f02ba760bd13acec65dc90326ec5e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::run_table_test (cognitive 21): FunctionRunner::run_table_test has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e129fbc49131ec70f40df18ba80a23ccfab6019ee1fe4e7193e0c7a8ea2df5"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::build_fuzz_state_uncached (cognitive 21): FunctionRunner::build_fuzz_state_uncached has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (6 pts), boolean chains 3 (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":"crates/forge/src/runner.rs"},"region":{"startLine":5628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2357547ed4a6358a4135c4f5f17d5a5ccd277eb84bc6c7957eb233de228484"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::sandbox::copy_project_tree (cognitive 21): forge::sandbox::copy_project_tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/sandbox.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec20c63951ca594fe6a02436a321f00d4f33ebb5df0e3dcdfbdbaf3d4d953d6"}},{"ruleId":"D2","level":"warning","message":{"text":"UnchangedStateVariables::check_nested_contract (cognitive 21): UnchangedStateVariables::check_nested_contract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/immutable.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9166e209ee2ddd96e16a0c7e18b2353c9e38eabcced9a4dfbeb933b0c2cd11f"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::visit_expr (cognitive 21): Analyzer::visit_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). 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":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"759c37128cc36ff18a6b2909f5451774d0660c6c2bd04ed0a3bce9b5d6a52b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_stmt (cognitive 21): Checker::visit_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/uninitialized_local.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d592abf457036816511ec7be3d95a92a1ff39ced523a7e259792f2835f01ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Cx::modifier_coverage_at_body (cognitive 21): Cx::modifier_coverage_at_body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"748102ed2ed7524c5ca72b43dc13258c9aec799bfbdcb596509a015393a0ee64"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark_clickhouse.build_manifest (cognitive 21): benchmark_clickhouse.build_manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/benchmark_clickhouse.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea4672b62ba57d02fad678819c935f356fdaede72b049c3ef85578f1edb172b"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize-release.finalize_nightly (cognitive 21): finalize-release.finalize_nightly has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3 (nesting depth added 3). 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":".github/scripts/finalize-release.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3656979ff80d290cf9bc02a208016b1d58d59de7b3a09705a7d9bd891a150493"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::transaction_by_sender_and_nonce (cognitive 20): EthApi::transaction_by_sender_and_nonce has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5cf58a66a6442370c6b0a86fe8f621e764ce8b6f29e0c28afb7d6f3f451e17"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::evm_mine_detailed (cognitive 20): EthApi::evm_mine_detailed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":4864}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b3f77ae806e945e460f4982d313e86c2fa0b81851c1027cf825b96fdde0152"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoricalStateCache::snapshot (cognitive 20): HistoricalStateCache::snapshot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1692d2cd2ed8c1271b667c1475c1ed23cb38dd48c130f96d72243276894cd128"}},{"ruleId":"D2","level":"warning","message":{"text":"StateRootCache::record_diff (cognitive 20): StateRootCache::record_diff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/state.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13b1640d3a0d26783a87568d7f93c193225003047677f1659ceb3745c570941"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryBlockStates::enforce_limits (cognitive 20): InMemoryBlockStates::enforce_limits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/storage.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2489313efeb11296e6a451e68334e794ae08669cd47752dfb78b2c3867336f"}},{"ruleId":"D2","level":"warning","message":{"text":"Create2Args::run (cognitive 20): Create2Args::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 3). 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":"crates/cast/src/cmd/create2.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf1352250a05bbef752cce7f03f49efe5af6f78ec9ba8b1b89d9214361851e"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::wallet::configurable_account::new_wallet_is_configurable (cognitive 20): cast::cmd::wallet::configurable_account::new_wallet_is_configurable has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 6 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/configurable_account.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"adade699c2071c8389ef44955d39e1f604ba4d5cff918062ddd51d40bdeb2c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::rpc_trace::push_frame (cognitive 20): cast::rpc_trace::push_frame has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 2). 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":"crates/cast/src/rpc_trace.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1147673407fa7d3a5ca86e442f954596efe39c8faef1e45b6586be9d3ec840ac"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildOpts::data (cognitive 20): BuildOpts::data has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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":"crates/cli/src/opts/build/core.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd417322281c4e1241731f0462b5da2be9fde8f9e7b541db2ab1c2a230f60bac"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_common::compile::add_root_remapping_diagnostics (cognitive 20): foundry_common::compile::add_root_remapping_diagnostics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/compile.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9dc3ec77427e19adb40435d39e92776b9a4268baa110a9d9364aa5cb50ecee"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionLifecycle::suspend (cognitive 20): ExecutionLifecycle::suspend has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1117bb4c2b9fa0842f6441cdfada97a116ab6b0d823d69be12b21563dbea7887"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_core::fork::prefetch::spawn (cognitive 20): foundry_evm_core::fork::prefetch::spawn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/prefetch.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7af598709ecc84fabf6868e06c08356937d66138010139c2af1fac0e4dd211"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveInvariantSolver::submit (cognitive 20): LiveInvariantSolver::submit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/live.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b416bca471d463211e8e08d7ea0d58a0a2bd271147436b4f8b1cc1f67268144"}},{"ruleId":"D2","level":"warning","message":{"text":"SymMemory::byte_dynamic_with_delta_and_bounds (cognitive 20): SymMemory::byte_dynamic_with_delta_and_bounds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd23f3fdd8dc6a4685a399bda5f2223b5501b42bdaaed3f0c2869f9678ab16"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstraintContext::upper_bound_constraint (cognitive 20): ConstraintContext::upper_bound_constraint has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 12 (20 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af995a2b8691601555e571e579c83fb3d792228f6dcdd681a8f99f31da4bd60"}},{"ruleId":"D2","level":"warning","message":{"text":"State::merge_comment_lines (cognitive 20): State::merge_comment_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f302ab62ca4762116e433629e2a904f6594ee9116da5c5b6371bcdf6d2da19"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_member_or_call_chain (cognitive 20): State::print_member_or_call_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7459af30b2b1046f86875da990d653434f5f785cbfc4e629bfa5b771e09d612"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_if_stmt (cognitive 20): State::print_if_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5b26d3117dd3bf124e49e6f43f12652e3b94c3516207be9ae40a3f82b870b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Campaign::run_agent (cognitive 20): Campaign::run_agent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (3 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f1de6ab496d1228ef31719349abaa8c87e70ba888dc35aafbbccafdceb7fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::symbolic_minimizer::minimize_value_pairs (cognitive 20): forge::symbolic_minimizer::minimize_value_pairs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabab5a0441a21150f522312ee117ad382bcee2d4320da60e16fd9f3ede851a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Linker::link_bytecode_inner (cognitive 20): Linker::link_bytecode_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/linking/src/lib.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71ca01ca3696efd0c1fc79467c84fa681962a06e678f57853769d415fe96e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_lint::sol::codesize::unwrapped_modifier_logic::snippet (cognitive 20): forge_lint::sol::codesize::unwrapped_modifier_logic::snippet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c5fced3f20b89d0170f60996bf659f75a2ad22a18d3aa6358ba72f07abbc7"}},{"ruleId":"D2","level":"warning","message":{"text":"FoundryTransactionRequest::try_from (cognitive 20): FoundryTransactionRequest::try_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9 (nesting depth added 3). 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":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da7fcb353830b7c342c9c316b1a296303c01e26fa8a8a9cb80d81c5d8d10903"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptArgs::prepare_script (cognitive 20): ScriptArgs::prepare_script has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bf8f848bdadde1ca118b0ba4ac51cd5bcd44ab64ca7293179ceacaf4d69d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::broadcast::reject_expiring_call_before_create (cognitive 20): forge_script::broadcast::reject_expiring_call_before_create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eda3ee67d244f2a7d370816f838619c10d729e91ceb64b69f135ab6ca774f64"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::recovery::previous_unfinished (cognitive 20): forge_script::recovery::previous_unfinished has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/recovery.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eee9988145c12fac7127a9835db495a46fc19c4fb157580e92113b039a83dd"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_script::verify::external_job (cognitive 20): forge_script::verify::external_job has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7935fcca295b588a78469052c560cbc10cf81dfe9b94402d7a2b9294d462cda"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::build_tx_request_with_fee_defaults (cognitive 19): EthApi::build_tx_request_with_fee_defaults has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":5318}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fbbb03b282d63172ce1dffeffba1c405239f941477be6fa3bfecb254f271fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TrieNode::insert (cognitive 19): TrieNode::insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/state.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9388ea4cb44993eaa0b3b4d730679c4a468fddf61a9df5bd421137d514f580"}},{"ruleId":"D2","level":"warning","message":{"text":"anvil::eth::backend::db::commit_changes (cognitive 19): anvil::eth::backend::db::commit_changes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 5, match/switch 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/db.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d9c4abd64a037d2e4b3e702c24b3bd3145ae649cac7fe88b4324a5db86030a"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchSendArgs::run (cognitive 19): BatchSendArgs::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/batch_send.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32512b8a66e1812b8ba6a23a2982d9086d88ae78455fa0a9d291b8331414e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"PermitArgs::run_generic (cognitive 19): PermitArgs::run_generic has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 3). 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":"crates/cast/src/cmd/erc20/permit.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ce40efa7f665f34d83f6951d48024537ac7d933020ee004c6a91d628c1105"}},{"ruleId":"D2","level":"warning","message":{"text":"EstimateArgs::run_with_network (cognitive 19): EstimateArgs::run_with_network has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 3, boolean chains 1 (nesting depth added 2). 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":"crates/cast/src/cmd/estimate.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4f2565c5b5adb575312fe9038f5d576a442fbf058b0889fd9dd913e38309a"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyInstallOpts::install_existing_dependencies (cognitive 19): DependencyInstallOpts::install_existing_dependencies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/install.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9949893a90f2286967308108f5cc66f262ddc868923e62f89eaf46afd43cd884"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::ensure_solc (cognitive 19): Config::ensure_solc has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"591fd3bdcfd24b9250dc45f0cfb5109b8bdf6806ffda216560d520606889ce0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalMembers::for_contract (cognitive 19): LocalMembers::for_contract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0ec35b475cb1e1779153dc89a4448c21ad0885771cd29ee0f068d46ccdf3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::render::render_function_section (cognitive 19): forge_doc::render::render_function_section has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3f54841f0ccb7fe8b5edbb4bfa05e92003587dd3e51ab9e98d005d7f5c2d32"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerCorpus::process_inputs_inner (cognitive 19): WorkerCorpus::process_inputs_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3792d276984e2a2cde53797cf74d72a3b09f2bf7740fd4f1678e1dcd637fe"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::run_equivalence_inner (cognitive 19): SymbolicExecutor::run_equivalence_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/equivalence.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b6eeee490a38ca7dbb560b9da602dc2d7e7bee07cb92dec70bce30f0c65704"}},{"ruleId":"D2","level":"warning","message":{"text":"CallTraceDecoder::collect_abi (cognitive 19): CallTraceDecoder::collect_abi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"c890cfe2a03bae6fb049a80b4e4262e1892bae2dd666aaf977eebfadd97040fe"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationExclusionCollector::visit_expr (cognitive 19): MutationExclusionCollector::visit_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/type_analysis.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c52a54273edc63a1f8f897c2def9bedec04a685098d39e80a486a11eb5b4eee"}},{"ruleId":"D2","level":"warning","message":{"text":"TestOutcome::ensure_ok (cognitive 19): TestOutcome::ensure_ok has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/result.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5a4d8b43b210830dfad79c27d169b4044a64a58d79f405f9b1ce15a232d6ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::replay_symbolic_counterexample (cognitive 19): FunctionRunner::replay_symbolic_counterexample has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 5). 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":"crates/forge/src/runner.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"020b32e5a3bebf54d7f89af3b3a75cfe5a08d3d461a920228fb95da3c99aef7f"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::fuzz::push_scalar_value_candidates (cognitive 19): forge::cmd::fuzz::push_scalar_value_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f8cc7b6876476cb33199420b82e03fa86279c44c10bd31ab453907cf10a425"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::snapshot::diff (cognitive 19): forge::cmd::snapshot::diff has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/snapshot.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7c73753e4e8db150412951e3354e5ca63b6197ecbe1e1b037bb67f373e6e1e"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::runner::select_stateful_frontiers (cognitive 19): forge::runner::select_stateful_frontiers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"06574edf281d9cd4a4660e223fe00002e9c673559b0ab98440f1810083a3ed43"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_lint::sol::high::protected_vars::protected_variables (cognitive 19): forge_lint::sol::high::protected_vars::protected_variables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ede4af82b2b4d46a4cfe2992620a29354d1a74d1f9b69a0b42e81cecaf533ab"}},{"ruleId":"D2","level":"warning","message":{"text":"SendTransactionKind::prepare (cognitive 19): SendTransactionKind::prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f1592bcaa98fc151dd015e118152a9afa08fe03bad6c60ab65bcd066f5842c"}},{"ruleId":"D2","level":"warning","message":{"text":"matrices.main (cognitive 19): matrices.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/matrices.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab933c3fdec9c8b7bd1d30e2a49ff84021aca38ecca44fdeb56dfb89d59cce76"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingTransactions::remove_with_dependents (cognitive 18): PendingTransactions::remove_with_dependents has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/transactions.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff415cdf9b20cbe4424201fab7ab9c802ab735fd8148a5ceefd0073a3536697"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectCompiler::compile (cognitive 18): ProjectCompiler::compile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 1 (2 pts) (nesting depth added 1). 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":"crates/common/src/compile.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e136d96e9cb071b6455acca5cbd1d6ab1ef094c0ce5168c5ec1ace431ef74bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotInfo::decode (cognitive 18): SlotInfo::decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf47ef298c209bb6bf41ace9a9dc93986a88ecada77ae7bf0c66c04989cee8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"SolarParser::parse_ast (cognitive 18): SolarParser::parse_ast has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/inline/natspec.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae545c8e7cc414f69b2fc9f50e8d86395a5a8b36e9f83da1d91f0fe4c2cbdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::restrictions (cognitive 18): Config::restrictions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c83f5d985c9dd3134e78dff4f8ef1250f5d58e7277aa0c3daab706067a95ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::list_foundry_cache (cognitive 18): Config::list_foundry_cache has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8e0e9aece09075cd0cad839eac13a34a018288b27c5adb68fa348a420211f7"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_debugger::soldb::executed_programs (cognitive 18): foundry_debugger::soldb::executed_programs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/debugger/src/soldb.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d0660f8d618fbfc4fb0cbb5afab1a28c96a524c2b17415bf4b0ba8ddb1fe8a"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceVisitor::visit_stmt (cognitive 18): SourceVisitor::visit_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/coverage/src/analysis.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8955857b5730967aa51224162a1bafb703fc76d9c34d3f09a46a91ccad5bc7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"RawCallResult::merge_sancov_coverage (cognitive 18): RawCallResult::merge_sancov_coverage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d99b7eb3326610c9f4c0babf608481b251d636aa3dbeebe1743fbb3ba21d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::finish_codeless_call (cognitive 18): SymbolicExecutor::finish_codeless_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7 (nesting depth added 3). 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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adbe7d75e291a1e3afa4fcc5016309a955e6f1c47e69c18ad5ec787ee01fa0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::classify_revert (cognitive 18): SymbolicExecutor::classify_revert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 1 (nesting depth added 2). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90f2bc4e06887f1d8e9964c2313d8135b49191c06a2b800d4175f693705b5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SymMemory::read_stored_bytes (cognitive 18): SymMemory::read_stored_bytes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eba7f34e2d98c73bcf021faa8e91bbf2c34f6e2b7eb0ff12ac5fea1ce87070"}},{"ruleId":"D2","level":"warning","message":{"text":"SmtLibSubprocessSolver::model (cognitive 18): SmtLibSubprocessSolver::model has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 2). 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":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"430e84f602a3a295255529407b350c29421bf76f2ba3aa1c9ed9ad4ee074430f"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::precompiles::execute_symbolic_precompile (cognitive 18): foundry_evm_symbolic::runtime::precompiles::execute_symbolic_precompile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/precompiles.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ca3ebcc85a654116fea88fff29a380c992d8c04177ee7da0f9ae5a096293f"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_lit_inner (cognitive 18): State::print_lit_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/common.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6fbccfde8c27571f92f126fbbc27beb0ebcace786f162c9ac9167f1f8ee5d3"}},{"ruleId":"D2","level":"warning","message":{"text":"State::handle_comment (cognitive 18): State::handle_comment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e081494eee7879e38cdcb4540af982e566aea3c84bc97255a93a05f4a499e3fc"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageArgs::prepare (cognitive 18): CoverageArgs::prepare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb96911d1e1b7bb1733f3dd9eed5e47326b2dcf57a55b99a08e38f2202790aa"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::runner::solve_live_invariant_frontier (cognitive 18): forge::runner::solve_live_invariant_frontier has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 3). 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":"crates/forge/src/runner.rs"},"region":{"startLine":6260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c18a64dbf86909e9b686a69c599e920535ebaee48679a11c99b80e07eb61733"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::visit_expr (cognitive 18): Analyzer::visit_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 7). 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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0d9655be2aa4ae2c29f617436344a5009c25b3e3d238c973fbe7e9ffd1a90"}},{"ruleId":"D2","level":"warning","message":{"text":"EntryAnalyzer::collect_slot_roots (cognitive 18): EntryAnalyzer::collect_slot_roots has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6678c8474d44523d964e02ee63930f07546c8a7f9769081a942fd6b8e2141831"}},{"ruleId":"D2","level":"warning","message":{"text":"InconsistentTypeNames::check_project (cognitive 18): InconsistentTypeNames::check_project has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/inconsistent_type_names.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"948737b739f61a1d94ea5521ce8be95aaa326728de751a4febc8e66837824d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_lint::sol::med::div_mul::check_stmt (cognitive 18): forge_lint::sol::med::div_mul::check_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/div_mul.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8179619dada5b5809df88fa8ea9c70a774220d2ff8842966b5fbe0d5cc2d849"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptSequenceKind::restore_delegated_pending (cognitive 18): ScriptSequenceKind::restore_delegated_pending has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/sequence.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9456c8bfde16c09cdf619d49ef0a5624c8608bbf7fe5fca9b545fa437dc2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifierArgs::check_credentials (cognitive 18): VerifierArgs::check_credentials has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eed0534914fe33cedb76fb947e378faf838242ccb1800cc1e6d8186ff557c3"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeConfig::as_string (cognitive 17): NodeConfig::as_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4190cac0785ca130845b360108238375d1b84b496f1a0f3590865150d426d2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::transaction_receipts_subscription (cognitive 17): EthApi::transaction_receipts_subscription has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":5194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8e0d61fd6f27bbaf9bc51c352cd63fcab0b772a8d193374c7e36bec60b00c0"}},{"ruleId":"D2","level":"warning","message":{"text":"AnvilBlockExecutor::finish (cognitive 17): AnvilBlockExecutor::finish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d7811635af2e1898257bf29b8bacb1df2c116df0b6a191fcd11d81255bd890"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::debug_execution_witness (cognitive 17): Backend::debug_execution_witness has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 5). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7930}}}],"partialFingerprints":{"codehealthFindingId/v1":"7373524d8d299a294b3f5132e7cfc37a694b6b821e604778a7a5e0dcc9ccbcca"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadyTransactions::remove_with_markers (cognitive 17): ReadyTransactions::remove_with_markers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/transactions.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a446b453317c0ea18dc2d3c5be210cc25ba45b11e1d3b43c14c48f7d4e541b13"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArgs::run (cognitive 17): CallArgs::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 1). 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":"crates/cast/src/cmd/call.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6715bd9171a8bb21fb81a06b655700b805f56aad5ffaa4955a93a50e7eb89ec5"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::cmd::events::decode_logs (cognitive 17): cast::cmd::events::decode_logs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/events.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be3e01a6e413990d558d0c2dc060061c2e21401e137caa547461af7ecfadbd"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_common_fmt::dynamic::_serialize_value_as_json (cognitive 17): foundry_common_fmt::dynamic::_serialize_value_as_json has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/fmt/src/dynamic.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1a6e36403acfa24846583d6fb6e65378e95e714baca6e98d1703a4addd9048"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotIdentifier::identify (cognitive 17): SlotIdentifier::identify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"687c870a4ed37540323d9445df33693bda7e8906a62f0b95aa890f81758e8418"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::render::write_comment_block (cognitive 17): forge_doc::render::write_comment_block has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dcd58d5d7bff92b305ec37f055acf893d37734fad23bc6059f2ec8a6f4f79d"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_core::evm::lifecycle::apply_account (cognitive 17): foundry_evm_core::evm::lifecycle::apply_account has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1 (nesting depth added 3). 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":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"848ebd5bff446871e7f28fd8ae928be4d9a364211491e3c7e971a20967499c88"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceAnalysis::new (cognitive 17): SourceAnalysis::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/coverage/src/analysis.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a990ba7e4be605155508b3dd94fba6ba439279b07f370739d607caea55ff646c"}},{"ruleId":"D2","level":"warning","message":{"text":"InvariantExecutor::invariant_fuzz (cognitive 17): InvariantExecutor::invariant_fuzz has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86eca806eea38bb19a99677b2ced1fba72cf1280d6f29d901761945edfcd755"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm::executors::invariant::shrink::check_sequence_value (cognitive 17): foundry_evm::executors::invariant::shrink::check_sequence_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a247f1bd8ac36e96dd1cadb464aa0cf22def22d6b7b7eff744bf8b8e7175365e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionDigests::digest (cognitive 17): ExpressionDigests::digest has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (4 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f551e7b0f86c2c3812c324a0e6e38dce2e0ce66dfc13ad4bc9241922549fa81"}},{"ruleId":"D2","level":"warning","message":{"text":"PathState::replay_persistent_writes (cognitive 17): PathState::replay_persistent_writes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (5 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4360023919f9c2e8ea7d81fe3263d448d960b46c7f2135948bd191dbed5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"CallTraceDecoder::decode_event_inner (cognitive 17): CallTraceDecoder::decode_event_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). 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":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fabf5b5e4f6d015087a23c35c62ea51ff5d9f7c7c6d7bbe7a556b65d337dbd8"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_traces::decoder::precompiles::is_known_precompile (cognitive 17): foundry_evm_traces::decoder::precompiles::is_known_precompile has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/precompiles.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"992af2472e2ef38af27b5814bd56aba26fc52ce07cc87960f9105120c27b0b68"}},{"ruleId":"D2","level":"warning","message":{"text":"State::separate_items (cognitive 17): State::separate_items has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"700686a7df2e0d8ddf7e3c4558e0e4a33558b94d14a6f729e8dfa86fd13fc6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_import (cognitive 17): State::print_import has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 7). 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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a72e06fcf111d45f29f1f1d2b2bde564e8a94db169e1290273807bc649bfd97"}},{"ruleId":"D2","level":"warning","message":{"text":"BindArgs::cached_artifact_paths (cognitive 17): BindArgs::cached_artifact_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/bind.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00d0803f55372962cd66507117106e28410ed0c57ca1a8f7eaf1cb4ffb61ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"BindJsonArgs::resolve_conflicts (cognitive 17): BindJsonArgs::resolve_conflicts has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 3 (6 pts) (nesting depth added 6). 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":"crates/forge/src/cmd/bind_json.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"513a15ac31faaaefccca5cff89e51318ae94735c7a46c67a9bc76108946ac4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"FuzzShowArgs::run (cognitive 17): FuzzShowArgs::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 10). 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":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0c82651000525b9e1cabeb14869fec8bcfce8c00ff024da60aee3ee57ddf66"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::properties::collect_tests (cognitive 17): forge::cmd::properties::collect_tests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12ed9599a444f005b12b446f975d1ced3b61d74c80e175c83eeb90c86d11f68"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::watch::watch_doc (cognitive 17): forge::cmd::watch::watch_doc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 5). 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":"crates/forge/src/cmd/watch.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d39fe9277aa8ed047582d1856c85e888405861012570c5766ef84fa9f0266"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalFunction::check_nested_contract (cognitive 17): ExternalFunction::check_nested_contract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/external_function.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc438ed4fb098f6e28f4443d46445e302486f35040f96e754c2f605356a782"}},{"ruleId":"D2","level":"warning","message":{"text":"Imports::check_full_source_unit (cognitive 17): Imports::check_full_source_unit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/imports.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f556a63d98af8c357e0b4b2759aafd6742623110e85bc2a53a79abd0d0d59b"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_expr (cognitive 17): Checker::visit_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 7). 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":"crates/lint/src/sol/low/block_timestamp.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c897af8bcb406aa5496cadbb7055ca0c2cf51d6f2c85abf5b2af90f5e565872"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteAnalyzer::analyze_function (cognitive 17): WriteAnalyzer::analyze_function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/missing_events_access_control.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a1eb30180256b56c935106347f8a666559c1698acddaf53c646d73512a62a4"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedEther::check_nested_contract (cognitive 17): LockedEther::check_nested_contract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/locked_ether.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"20190f2f9fbd0ba57fa5783487e4d7310199eb677e5d40c74730c9ec5139f479"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryPlan::operations_match (cognitive 17): RecoveryPlan::operations_match has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/recovery.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee014bee8b0e269c46eae197a089a773b6845b7f5f805c954dd854a72ab774"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeArgs::into_node_config (cognitive 16): NodeArgs::into_node_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 3). 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":"crates/anvil/src/cmd.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6977974e262dd0d3687c904f3c619d7f64ed71dde5e21c3f3bd95e5bad591eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::execute (cognitive 16): EthApi::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7b50302a32311bfddb1941aaef40d8b1d465353fe9c111fc40263b982eeb0e"}},{"ruleId":"D2","level":"warning","message":{"text":"EthApi::eip8130_nonce_markers (cognitive 16): EthApi::eip8130_nonce_markers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":5507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1a4c2134990ae763a58ddd0e88fc7ea3b8932a2a6fe023ecb6247b67e65ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::get_blob_by_versioned_hash (cognitive 16): Backend::get_blob_by_versioned_hash has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee99129b61cc934155d50578db1286011b64a30af7c3d0bf28c4cd3ef7fb0c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::removed_logs_since (cognitive 16): Backend::removed_logs_since has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":5939}}}],"partialFingerprints":{"codehealthFindingId/v1":"783cddf59de821741b0b6126e1a1672611ded385125cff88e3983a641c24ff27"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::apply_fork_transaction_replay (cognitive 16): Backend::apply_fork_transaction_replay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 1. 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":6130}}}],"partialFingerprints":{"codehealthFindingId/v1":"af95da5e93c1ec3e91bcb8ded8936b00094ec7184c64b836e8e87eaf2942eae9"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::rollback_and_publish (cognitive 16): Backend::rollback_and_publish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 2 (5 pts), boolean chains 1 (nesting depth added 3). 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":8072}}}],"partialFingerprints":{"codehealthFindingId/v1":"6569112088bd61804e88f98c198d030b9f613259317760b42a3587739f42adae"}},{"ruleId":"D2","level":"warning","message":{"text":"PubSubEthRpcHandler::on_pub_sub (cognitive 16): PubSubEthRpcHandler::on_pub_sub has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad70bd658c3652089e05d64a2e3920ede16f5f6f7241f8554a200852874d0e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"CallArgs::run_curl (cognitive 16): CallArgs::run_curl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 3). 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":"crates/cast/src/cmd/call.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0266addbc3e902faf7e8f8195c0a9e658a6296fa57c2025307918c532b26f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer::match_tag (cognitive 16): Installer::match_tag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/install.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c9d62c136d703cf9d5e350c7f3eaeb3fa9777b93096dcb1b1c42b00188284c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lockfile::sync (cognitive 16): Lockfile::sync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lockfile.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee5236be954782bf8490190061a4b7c3978d17fa8c8507e9ee16d098f3d1835"}},{"ruleId":"D2","level":"warning","message":{"text":"Git::submodule_mappings_at (cognitive 16): Git::submodule_mappings_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8195e15244e06ca4aec438bc16849994b29726dc3efeca6e08548b024a0ae4c"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_cli::opts::build::utils::get_solar_sources_from_compile_output (cognitive 16): foundry_cli::opts::build::utils::get_solar_sources_from_compile_output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/build/utils.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7398908e1cfc02d9dba596cbedaa9feac2993a4c045c0312dd97eba847e9c8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorImportRequest::into_chunks (cognitive 16): SelectorImportRequest::into_chunks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/selectors.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbebfedf2e0f7edb7ddc88db5ba28a79ef0c49a748e2f115660d5bf7c1322e6"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::hir_ext::continuation_parent (cognitive 16): forge_doc::hir_ext::continuation_parent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eae908a8844d9241416454c3eda7c2139350c954e8655a73b2d075e0275dab"}},{"ruleId":"D2","level":"warning","message":{"text":"forge_doc::vocs::rewrite_homepage_links (cognitive 16): forge_doc::vocs::rewrite_homepage_links has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/vocs.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"796dee1f9544f600d7bd3472f8342edcb23541ba419eecac88debf863c08ecc4"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_core::fork::multi::create_fork (cognitive 16): foundry_evm_core::fork::multi::create_fork has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). 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":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7589cdd41955873f099f3c6f6d928e588122cb45a39a03ef32061b19bef5c28"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicExecutor::handle_log (cognitive 16): SymbolicExecutor::handle_log has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3386db5cf85eaf20396f8c5ba44ca033ced453be0861860c55fc49627723d10"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicWorld::replay_storage_assignments (cognitive 16): SymbolicWorld::replay_storage_assignments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c632cdd0f86c47e1298a5ba4ef6cd8d57d0b203b779946f099217881caa5b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolicWorld::storage_base (cognitive 16): SymbolicWorld::storage_base has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3da578d1eca3c6846efff40e17a2d27d7c9b58f2ca3b8d00d51320e6172cf65"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::fallback::complete_fallback_support_model (cognitive 16): foundry_evm_symbolic::runtime::solver::fallback::complete_fallback_support_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2192e084ff798d44006bccc6ef4e13628f52bdcadc7aa39d7b64bdb0e2bb36b6"}},{"ruleId":"D2","level":"warning","message":{"text":"foundry_evm_symbolic::runtime::solver::fallback::fallback_single_var_model (cognitive 16): foundry_evm_symbolic::runtime::solver::fallback::fallback_single_var_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 3). 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":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd507d45ad2f420a962138f0905918e1a49ed3892af8b6f48e2b7773c3fbb13e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalIdentifier::identify_addresses (cognitive 16): ExternalIdentifier::identify_addresses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"91078101ab5de63c7c81e7e1cc65180c4ba5e3706ccc414c18750aeca715af08"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_yul_stmt (cognitive 16): State::print_yul_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/yul.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfb68d36b2339726240df1c9cb1b3ead3ee108587350c01524201b231ad471a"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateArgs::run (cognitive 16): CreateArgs::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). 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":"crates/forge/src/cmd/create.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f504b6f632c5ab67c3c9a6b341730fc4e72e32be5f59fd332ac3e9491cdabc99"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateArgs::run_generic (cognitive 16): CreateArgs::run_generic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 2). 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":"crates/forge/src/cmd/create.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bf86a795721c3c1614db18c1be4814c9245d53de72388ebf93602bd2fcd8c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Campaign::run_tests (cognitive 16): Campaign::run_tests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1641afdae2429931d57ba60e3c6643c2a2b3ef21619cacbe2df13d4d8fd6a188"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationReporter::report (cognitive 16): MutationReporter::report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 1 (2 pts) (nesting depth added 2). 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":"crates/forge/src/mutation/reporter.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8eac0ad454c0b53929d921f87e9a57521890b770150e69926a41a05e8ae4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionRunner::run (cognitive 16): FunctionRunner::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf1b5e044c61e85c2cf54cd03cb7e2fa1bb30c1168d22788471d9f7dc225a79"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::cmd::fuzz::abi_calldata_candidates (cognitive 16): forge::cmd::fuzz::abi_calldata_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59a2180028589841b94556f360b46b8dedb76e8cf4c645159c557c85e8904c"}},{"ruleId":"D2","level":"warning","message":{"text":"forge::symbolic_regression::attach_symbolic_regressions_to_suites (cognitive 16): forge::symbolic_regression::attach_symbolic_regressions_to_suites has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 10). 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":"crates/forge/src/symbolic_regression.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef795180075ec49e933572f768fb58e21b1155d19c9d98388e6dc149e7a3a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::add_facts (cognitive 16): Analyzer::add_facts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 7). 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":"crates/lint/src/sol/high/arbitrary_send_eth.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"372447411089c129d9748718a813a07a9e52914d6095121762a21889a97c6523"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::add_facts_unchecked (cognitive 16): Analyzer::add_facts_unchecked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 7). 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":"crates/lint/src/sol/high/controlled_delegatecall.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"050f46f0d2135bf345043fcaceb42ed743b1658b4fb18334a6feece3e6c83588"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::balance_forms (cognitive 16): Analyzer::balance_forms has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fec214fbbcbb35e23ffd9cbdfae9c2a90efd77ffcf4277c4e8b09f869ad7042"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalFunctionUsedOnce::check_project (cognitive 16): InternalFunctionUsedOnce::check_project has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/internal_function_used_once.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f173f6b605b7a3d2101cb9d3016eacd4f2aa40e0fa13a04d4a28101a2ad32089"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::analyze_expr (cognitive 16): Analyzer::analyze_expr has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/reentrancy_events.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2b77b51c1f16392807e536ebff52c5af30a971f61c82cd8ed985c6e3ac621b"}},{"ruleId":"D2","level":"warning","message":{"text":"FoundryTxEnvelope::try_from (cognitive 16): FoundryTxEnvelope::try_from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/envelope.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af92533248b5920631208fdd4740f3ec1fd30d5823721ed9d372759b78a1307"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.handle_foundry_cheatcode: MethodTooLong \u2014 handle_foundry_cheatcode runs 1571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1471 over it, 15.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6d53171b84cfc387829b4e04cfeb001e072efd3a16a8cd3bdebb6407abe5cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mem/mod.rs: FileTooLong \u2014 7823 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 7323 over it, 15.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f44cd637d3a84099500c3984f5e2d7f2677f7d8b516948bb3a139bf54226dde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Backend: TooManyMethods \u2014 324 methods, declared across 4 files: mem/mod.rs (290), mem/monad.rs (25), mem/tempo.rs (8), mem/base.rs (1). The bar is 30 methods; this is 294 over it, 10.80\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cebfe4cc1c1fc226285892519681a61bcf261c0a4895353b100ceaba397f575"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cast::args::run_command: FunctionTooLong \u2014 cast::args::run_command runs 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 905 over it, 10.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/args.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c5054f51e91b4d245fac11c952d6b82e76b3379a3d2cb87cdc286aa293755"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.run_invariant_test: MethodTooLong \u2014 run_invariant_test runs 954 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 854 over it, 9.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d21160cb37fe1710cc36d56b95ec766634599ffafc88c966a58e293c1d3a575"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runner.rs: FileTooLong \u2014 4607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: FunctionRunner (3 blocks, 1204-5667), declaring 47 free functions. The bar is 500 significant lines; this is 4107 over it, 9.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a879ebbef190d81cdfaff447ccf624b3525bf671058302b9e07af9119a96f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EthApi: TooManyMethods \u2014 262 methods, declared across 2 files: eth/api.rs (246), otterscan/api.rs (16). The bar is 30 methods; this is 232 over it, 8.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cd36c8309062179a435cfcbeec453dbc0a431bae8ec65c9bf0959c537079ea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EthApi: ClassTooLong \u2014 3290 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 262 methods, 7 blocks, lines 156-5815. The bar is 400 significant lines; this is 2890 over it, 8.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c676bc9ca095cc6ca386478357bb023988cbcec54386111a0933a8338f66de8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.step: MethodTooLong \u2014 step runs 817 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 717 over it, 8.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db9e6a88cf14d87372387172e938d6e7df4ae03adfbe626c6fc2c878d711b9e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionRunner: ClassTooLong \u2014 3251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 3 blocks, lines 1204-5667. The bar is 400 significant lines; this is 2851 over it, 8.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7d86ef0838aa13a89646da940bb31ee54e56924f232a43bd4afcbb120d42c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eth/api.rs: FileTooLong \u2014 3530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: EthApi (7 blocks, 156-5815). The bar is 500 significant lines; this is 3030 over it, 7.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c65296ba24719ba7350d7c787b90a6f0957a500ed5c62b9d49171a94dbee7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.call_concrete_target: MethodTooLong \u2014 call_concrete_target runs 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 460 over it, 5.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e16fed8038e7ac411d251c10d4819060591af8c6ae5332e84e36fca66be9f67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BundledState.broadcast: MethodTooLong \u2014 broadcast runs 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 451 over it, 5.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4153eafd2fae2323cf4d662d714170e82fd5601e95e9ec2c2bf3d4e133def8de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/cheatcodes.rs: FileTooLong \u2014 2574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: SymbolicExecutor (10-3137). The bar is 500 significant lines; this is 2074 over it, 5.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7c850a0729563ad1b52dae064dd204ea7f52f4ffa98793400a3617d3e5365"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InvariantExecutor.run_invariant_worker: MethodTooLong \u2014 run_invariant_worker runs 500 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 400 over it, 5.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b96b9c1401f6b602a08701c3e9deb2732373dc3aaeaf9c6f11c96b8a2c48db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 144 methods, declared across 4 files: state/sol.rs (69), state/mod.rs (53), state/common.rs (13), state/yul.rs (9). The bar is 30 methods; this is 114 over it, 4.80\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/fmt/src/state/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"90edda90d3447202e9dd06e080f1a448af6b295efaad9bd1ca09c2996f8aeb00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/state.rs: FileTooLong \u2014 2394 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1894 over it, 4.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a26e5b28fd558d48bdbfde41b25efdc009a7857cbddf3490f293ff8ed55b30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/sol.rs: FileTooLong \u2014 2368 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1868 over it, 4.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4e9a123859e83c6813bb3feead4026eb1ac174f20c0ccb4693badf6ee84c0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inspector.rs: FileTooLong \u2014 2361 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: Cheatcodes (3 blocks, 575-3786). The bar is 500 significant lines; this is 1861 over it, 4.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d5bfb57cb77fc1155b880e168766e988d9c3a45f59182519833d5018207b40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/keychain.rs: FileTooLong \u2014 2352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 71 free functions. The bar is 500 significant lines; this is 1852 over it, 4.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d76bb6c1d6ad749831f3fb5864bb75d4d87fcea592c6b27814860cfb54bab90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 141 stored fields beside 112 methods. The bar is 30 stored fields; this is 111 over it, 4.70\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27ebe856ab133eb5f8bf4c49dc65f97269ba3278b785861f3a529ee9ad51a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymbolicExecutor: TooManyMethods \u2014 139 methods, declared across 9 files: executor/calls.rs (39), executor/run.rs (25), executor/cheatcodes.rs (23), executor/opcodes.rs (17), \u002B5 more file(s). The bar is 30 methods; this is 109 over it, 4.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/evm/symbolic/src/lib.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"86619a15039f2047a169911297b9b766ba9f3d165d9cad53e53570cf6dcc75df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Cheatcodes: ClassTooLong \u2014 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 88 methods, 3 blocks, lines 575-3786. The bar is 400 significant lines; this is 1446 over it, 4.62\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc51594303f0e58387861204a0122a48bd28736368b6e7332d7206a7ffe3e746"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WalletSubcommands.run: MethodTooLong \u2014 run runs 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 312 over it, 4.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62f9a02f21d7790b20392946d5a1f38d9305b5e1fc9cd5b721034afe627b19e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeConfig: TooManyMethods \u2014 123 methods. The bar is 30 methods; this is 93 over it, 4.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"725a542e69d8178c79aaddcfbd8f4e84d06da4fb18e393e933c482c914978765"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/calls.rs: FileTooLong \u2014 2030 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: SymbolicExecutor (2 blocks, 6-2674). The bar is 500 significant lines; this is 1530 over it, 4.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9912cfcb51b16eca77f96ac80098c257c0f72dec43394aba4aecb68135975ad3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1903 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: Config (4 blocks, 196-3428). The bar is 500 significant lines; this is 1403 over it, 3.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"981dd225f9233e4f383ee48842d07d1d9327fd25e928e6aea881084b502f932a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 1507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 112 methods, 4 blocks, lines 196-3428. The bar is 400 significant lines; this is 1107 over it, 3.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"422da5a9faca3e32e0a08cace261327637a2f07204a73939e5a3084f85d04c2c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NodeConfig: ClassTooLong \u2014 1495 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 123 methods, 5 blocks, lines 234-2561. The bar is 400 significant lines; this is 1095 over it, 3.74\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"679c3499a79893aee5559ded62b0abff0bf6fc1e9663d9e24642635d40d12742"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 112 methods. The bar is 30 methods; this is 82 over it, 3.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5918e93e5f2337bbc8070c031439e4d87e05cab34ff0aed96ea6fd59f5531a96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 1835 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: NodeConfig (5 blocks, 234-2561). The bar is 500 significant lines; this is 1335 over it, 3.67\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39a9a081ca5682ea8c6491d9549e8c1348884a070fa86dca7d9c7579ea9d60"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymExpr: TooManyMethods \u2014 110 methods, declared across 4 files: expr/expr.rs (92), runtime/address.rs (10), normalize/mod.rs (7), fallback/mod.rs (1). The bar is 30 methods; this is 80 over it, 3.67\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5293718777045968102c17f5369abd9532d8d88c1df0befe815cb7a5f0187b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VerifyBytecodeArgs.prepare_runtime_verification: MethodTooLong \u2014 prepare_runtime_verification runs 357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 257 over it, 3.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/bytecode.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"517442e0dbbfa4d5210364e5441052055c32f5e9a4c87ce3e98f3c5d58021153"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthApi.execute: MethodTooLong \u2014 execute runs 354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 254 over it, 3.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"576e962235cd4f356ea34609c2dc1a5b0b861073368fc6d2c3d43cc99828b89b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspectors/stack.rs: FileTooLong \u2014 1755 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1255 over it, 3.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32035db8e8e25eec401541f01eeb7bf6a34395eaebb15298d32680524dded81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/expr.rs: FileTooLong \u2014 1708 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: SymExpr (4 blocks, 12-2149). The bar is 500 significant lines; this is 1208 over it, 3.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f0811388e85727b4d8f74bf6a056407d85e996e3c14808ba648282d5a7c511"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Backend: TooManyMethods \u2014 100 methods, declared across 2 files: backend/mod.rs (98), backend/bal.rs (2). The bar is 30 methods; this is 70 over it, 3.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"427497946f54d5bf6ee19a5f190fdddfd92577c27e1590de764e08594bf337e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/broadcast.rs: FileTooLong \u2014 1659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: BundledState (3 blocks, 723-2180). The bar is 500 significant lines; this is 1159 over it, 3.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c627a388491357b0bc2c61d370180319f2b63c1a4b0e5dbbbee9a7bd1d3e6552"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BundledState.broadcast_batch: MethodTooLong \u2014 broadcast_batch runs 329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 229 over it, 3.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"08980a079a39a9beebfcb9739d0cdb459887efeebeab52569429d71fb250b5b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: invariant/mod.rs: FileTooLong \u2014 1641 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: InvariantExecutor (2 blocks, 723-2241). The bar is 500 significant lines; this is 1141 over it, 3.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e58e2db5e38da34a2cffa6ee29652729ac43cf26b1311672a15ff4f7dff1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/evm.rs: FileTooLong \u2014 1638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 1138 over it, 3.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e65bc05526bde1de91ff9d83c5ea01282f7ccba37a473bed4dae5db66ead7f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymExpr: ClassTooLong \u2014 1249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 110 methods, 4 blocks, lines 12-2149. The bar is 400 significant lines; this is 849 over it, 3.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7f2ac76154fcb268004890e09760fe042397ae29cd8a2220c36142f534b60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallArgs.run_with_network_and_opts: MethodTooLong \u2014 run_with_network_and_opts runs 295 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 195 over it, 2.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e9a396a42553790afe6ed53264104371f9f88cdcd868d39fc1f55781d2ed7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: normalize/mod.rs: FileTooLong \u2014 1469 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 969 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4727db4f1c6ed31776e76076a64e14d34770a1c69b5e308a60e55270de8a13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cheatcodes: TooManyMethods \u2014 88 methods. The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6a939fe616ac7c511c0be4d1df68b207807d878bd9052878f9a586efe856d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: high/reentrancy.rs: FileTooLong \u2014 1457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Analyzer (2 blocks, 330-1549), declaring 35 free functions. The bar is 500 significant lines; this is 957 over it, 2.91\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b686754d903daf9423800b401a0bed61732c372d212030e1b581f930b817510d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executors/corpus.rs: FileTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 905 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c657bee7d773173ad5e5bb8bfbb7d8b894f8628a1b5b5d303900c0cf281b128"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/opcodes.rs: FileTooLong \u2014 1339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: SymbolicExecutor (10-1687). The bar is 500 significant lines; this is 839 over it, 2.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac67ac2c14dae849b40adbdf99365932f63c259351b33bbcd7af15b34a0c02aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InvariantExecutor: ClassTooLong \u2014 1067 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 723-2241. The bar is 400 significant lines; this is 667 over it, 2.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37003f62842f17bdb416f35c199de63b2d3c0de97e07c409f19ae6625b23eec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/args.rs: FileTooLong \u2014 1329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 829 over it, 2.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fe92f4f8caa551d982acb05d064be8598a3259262b91ce61fbe7828075cc14"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CallTraceDecoder: ClassTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 2 blocks, lines 238-1870. The bar is 400 significant lines; this is 660 over it, 2.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37828d64e3ff1e9ad9ffdac10aca872a107ed1b9e8051cee37fadde0b1f308c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/result.rs: FileTooLong \u2014 1308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 808 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85bb6884e1dc3c8b9cb7fa6c3b8384d4f53299616cd3f9ccf35dfc33994c4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm_symbolic::runtime::cheatcodes::foundry_cheatcode_min_input_size: FunctionTooLong \u2014 foundry_evm_symbolic::runtime::cheatcodes::foundry_cheatcode_min_input_size runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/cheatcodes.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa52a2f687de091d3e3b06b3e9c4d8ccc7753daf431acdd786e6aea9063cf4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeConfig.setup_fork_db_config_with_replay: MethodTooLong \u2014 setup_fork_db_config_with_replay runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b514b5ad48e4cd7d42af7b80b447c2f8dfb1e1a8c29b73a7725fe9dce16f44e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SendTxArgs.run_generic_inner: MethodTooLong \u2014 run_generic_inner runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/send.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee588dd6f6345812e0fb9db103e45db83419028a01873458b1b0b26a3a3650a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectorsSubcommands.run: MethodTooLong \u2014 run runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/selectors.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b498aa4e3a44d59aafddeb7fdfdcfb99ecdfc53c8ccede9fee6e8e60d2dbc515"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solver/mod.rs: FileTooLong \u2014 1285 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 785 over it, 2.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"458823cd3d186c8649dc665c8891ed93ab0c16ea56759a8bca1b5567cb525806"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BundledState: ClassTooLong \u2014 1025 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 723-2180. The bar is 400 significant lines; this is 625 over it, 2.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7b757ab4074b320ab1f704c41fd9642329a25e9895dc542de1c678f34eaf17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: decoder/mod.rs: FileTooLong \u2014 1261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: CallTraceDecoder (2 blocks, 238-1870). The bar is 500 significant lines; this is 761 over it, 2.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eaf3a660a202b880b36b0eaaef06d75d8b1a958a59f85cbd4da1c6526bcbac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Cheatcodes: TooManyFields \u2014 75 stored fields beside 88 methods. The bar is 30 stored fields; this is 45 over it, 2.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"13709986cff2e64c56db517237df5631e984d2b3a9164a10f11a81f337d0206e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.try_seed_invariant_corpus_from_frontiers: MethodTooLong \u2014 try_seed_invariant_corpus_from_frontiers runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":3378}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef763a5077a4f0bde86794ccf28c93d9e9e74e4aa663f0813508425fa8a6863"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.replay_symbolic_artifact: MethodTooLong \u2014 replay_symbolic_artifact runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ad616f3a642204a0cbea565654b3585157757404efb8cfac15d4a54b51b9a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PathState: ClassTooLong \u2014 982 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 4 blocks, lines 10-1993. The bar is 400 significant lines; this is 582 over it, 2.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21af2d3e5b77244f7fdb3ee8b75855ad4c1ab7799f26526f1445fb421b4acd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executors/mod.rs: FileTooLong \u2014 1226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 726 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e732479efe3eeb4f22d18f4b61e43ecfacb45e5535f08ead5a6e89e7cf465910"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: evm/lifecycle.rs: FileTooLong \u2014 1209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 709 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea8a50079f2146a62f69350cb0566f43f1f987c5eade01d49912964b1d946e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClientFork: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"02566d2a8c8948cac5b73148be0f0bcb067603a017226545d2b749d645f75277"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cheatcodes.call_with_executor: MethodTooLong \u2014 call_with_executor runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e761afc2f94322fa74b3bba8951f7a0b84e0b5ee904a9d8804c05b474786b2cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeConfig: TooManyFields \u2014 69 stored fields beside 123 methods. The bar is 30 stored fields; this is 39 over it, 2.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edae6031774440d329480db71c07d282af30d0ada8ff048e62f38223824d3c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymbolicWorld: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36e9a04e0ad1eb91b47790a3b46940f85fffaabf035d7331edaec468a80a889"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemappingsProvider.get_remappings: MethodTooLong \u2014 get_remappings runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed993629acb643395b5cf69e8002af1ae1019cf06d009b133684102e1729ccc6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Backend: ClassTooLong \u2014 893 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 100 methods, 2 blocks, lines 139-1592. The bar is 400 significant lines; this is 493 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c763e8b6efb536a40453b90be82e7fc7c9f89481f5b472af52718baa18bbd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/properties.rs: FileTooLong \u2014 1113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 613 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7354817dc664c6f08e29da44a67f62759adf7fc32e59a3846cf9da84ca716ece"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Analyzer: ClassTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 2 blocks, lines 330-1549. The bar is 400 significant lines; this is 482 over it, 2.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"35168d8e795827364e6d09c762520e32607fa66b81d757c4c756bb1ccb17a4e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Executor: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18f49f79a2d700e4660a58a0e9ed0251e2ce8fe94eb85fe8aa1398599e76da0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PathState: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0054f7eae6b116ee56f1e6868149058362d21aef9f704e95aa7c675341e3e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.call_symbolic_target: MethodTooLong \u2014 call_symbolic_target runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6856d5d0b191f4c545fde3c2ad0330f9407ca88cac399ff88cabf6669a49afa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContractRunner.run_tests: MethodTooLong \u2014 run_tests runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"525ccdd046bb0f3ddf0a31184df1667f016b58f88dd3041df14e55091ae2d7a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Git: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d0b530f06f1945fa5569d5158fe5565f663125369b5a53971924d26ee2a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CreateArgs.deploy: MethodTooLong \u2014 deploy runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/create.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"091ef41aefb7e086b29704d72e361a7c990ee346e870a58ae00e0db6b58dede2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstraintContext: ClassTooLong \u2014 850 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 62 methods, 3 blocks, lines 513-2235. The bar is 400 significant lines; this is 450 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b45f4cf89536a5a3b4084c6f7b17edc2545a35e01d720bd413f7436a1fc542"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EquivalenceArgs.run: MethodTooLong \u2014 run runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/equivalence.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3ceeb0566126ae2a45599497250bf34315cd9000f5793b1393dba548cf70a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConstraintContext: TooManyMethods \u2014 62 methods, declared across 2 files: normalize/mod.rs (54), normalize/rounding.rs (8). The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1abe5887d6b7ffe641cab5d7565bf015cd5c85b5d177c3e53670837e87cfd1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/mod.rs: FileTooLong \u2014 1015 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Backend (2 blocks, 139-1592). The bar is 500 significant lines; this is 515 over it, 2.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"496551055f73280ccd98b903890c9da840f76a0c24aba8aeddd813fd3a156d37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.call: MethodTooLong \u2014 call runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d8fe963fc418a043fdb0ddb510a806ca90a65684bfee22a461fd6ec70d442f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/symbolic_minimizer.rs: FileTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 476 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cddc7f74b4e2a961cf6e27717b82a673ca2000d9f4fd499028f6de8c57857d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/fuzz.rs: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 463 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64423141ca59d92ddbdf63241732b75aae2267ec58946798c238072bd582468d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/recovery.rs: FileTooLong \u2014 962 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 462 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f07773b77c95acacca14bcd7cf84d116664c25d832db930c4a3f2018d2d7db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_cheatcodes::evm::get_recorded_state_diffs: FunctionTooLong \u2014 foundry_cheatcodes::evm::get_recorded_state_diffs runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"052d1032c71939facd044f1aa0dad2b4ed62b0fc969bbcfa450840ccbe478aed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: invariant/shrink.rs: FileTooLong \u2014 957 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 457 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faf459d07d2d3511a9b924abf5835620d09e790dc26e551b40de755c2f26c32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Campaign.report: MethodTooLong \u2014 report runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ec84ead3c1b8ac640d1239448bbb791c062fe091cba24c299a5de01169a815"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Linker: ClassTooLong \u2014 747 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 42-1088. The bar is 400 significant lines; this is 347 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/linking/src/lib.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d1e4b5bae0a638407f4a98d9b2c936f43623db3f727903c781254a909b3852"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MakeTxArgs.run_generic: MethodTooLong \u2014 run_generic runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cc5be6115b07ac88c679c352bb2c2ee3bfa0d790e1c7a408327ff5ccc6222d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wallet/mod.rs: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: WalletSubcommands (2 blocks, 57-1017). The bar is 500 significant lines; this is 429 over it, 1.86\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f191b54d9e774e1f36b62e69b1d70e6667219bb64e428869ad1f06a6e83530c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 921 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: ScriptArgs (3 blocks, 118-1063). The bar is 500 significant lines; this is 421 over it, 1.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be46f6c0bf40fd4ec454a571ecd3dd56a389680aa685190b95ef95bec6a8b1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InvariantExecutor.invariant_fuzz: MethodTooLong \u2014 invariant_fuzz runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"648f9a8ecc8324a9775ce5f73c05698b7834f7317000e73a92d4965c06f82cce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FmtArgs.run: MethodTooLong \u2014 run runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02432b41707c8bc08968338a862b75f260d102f9a344c15193fe315c769f208"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ui.rs: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 416 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/fmt/src/ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"090cf3833cb48a1ea1777840efe3875a5968dffa240f12922bc0c8f48d657583"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/erc4626.rs: FileTooLong \u2014 912 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 412 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/erc4626.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f640576ef7c1c1bb069bc000ffab5812eb313253de21024d0713cd8d3c944350"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/mod.rs: FileTooLong \u2014 908 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 408 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4de06a338b625a9485b10fc61680ddb32a1a3507c66659d78ca726fe0d0c9f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymbolicWorld: ClassTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 68 methods, 3 blocks, lines 2194-3250. The bar is 400 significant lines; this is 326 over it, 1.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"179a5031e555148e8d4488a55b8c20187c8d8925b3e0d6c8137f394d3bcc426b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/opts.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: EvmOpts (3 blocks, 49-1268). The bar is 500 significant lines; this is 392 over it, 1.78\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/opts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de47b246bff3e3a82a16bc591e544d303272f8b2aacdc2d5d7eb54f722074eac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge::mutation::orchestrator::run_mutation_testing: FunctionTooLong \u2014 forge::mutation::orchestrator::run_mutation_testing runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/orchestrator.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e67c99070460a920a535e14ff81c557d9e545ded890f69ce204f54d73c2b4b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CallTraceDecoder: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38dae9a274f221cc142923c1c2ca09e56988fb2b8cbc4cfae4614fee9ee34ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FunctionRunner: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d628275710ec6c0b5bea5915ab4a627d7d3af40aea350839e26b9d32f15e6cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/memory.rs: FileTooLong \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: SymMemory (2 blocks, 55-913). The bar is 500 significant lines; this is 374 over it, 1.75\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e60313e9da80402510d074abe0162801d7bd470d65df42edcac151865b0807"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: preprocessor/deps.rs: FileTooLong \u2014 870 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 370 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1912a4847c128aafd66acf3d58fa1496623048e149cd1303d95ebe9b51e36b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cast::cmd::erc4626::check_compatibility: FunctionTooLong \u2014 cast::cmd::erc4626::check_compatibility runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/erc4626.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee94b2a965d1cf0f28614819da028ae92071e5266503d17e11dbc48bfc83f080"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.expr_inner: MethodTooLong \u2014 expr_inner runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abe419a2fb74bba6c2942ca713bb305c6d714cc8d7002e9c24fa196b33494ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/db.rs: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 362 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d433dbc5bd02b65e9ba8f3e1e76591b997c16705e7ac2745f6dc17193bfd35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.run_inner: MethodTooLong \u2014 run_inner runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3213a5b40d6f56f19907fd109d8ad8796ee7232448199e8a3a3f7d58a225ef36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/cheatcodes.rs: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 353 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/cheatcodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e909ba593aa1f982fc4e8773668f191c8e987311568ca4912b53e6efb737c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvmOpts: ClassTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 3 blocks, lines 49-1268. The bar is 400 significant lines; this is 280 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/opts.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9f35ab2eb128f2f2a9720059c684b52e39c50bebe3de6d524a6ad5d0a67a41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.create: MethodTooLong \u2014 create runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"674f245e197b6c07145f9f130a1e1da3a2ba7d53c585f9dbe1bda33e346e870b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymExpr.binop: MethodTooLong \u2014 binop runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ec0d9cd03aa1dffb54010113f67100352d9fb8498e69d80006964fca60c59b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExecutionLifecycle: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"be317b98c726f747637016950432f56a24285091e50cd0e1e49532372bc5547a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.replay_symbolic_counterexample: MethodTooLong \u2014 replay_symbolic_counterexample runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0b38a270559cb70d8fc1adabac8c7c8a1f862f7485431868ccc438754c0a23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/mod.rs: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: Git (2 blocks, 387-1172). The bar is 500 significant lines; this is 319 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a23e7f65df68f3f99653df00e0f5e99296d495707551f06ac64bca38e1d115"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/run.rs: FileTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 318 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57392f5e7df83d2990cc0ef507cbf9bc8ee32d5e7170ebf3996ba32dfb4f9484"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 49 methods, declared across 3 files: pp/mod.rs (22), pp/convenience.rs (21), pp/helpers.rs (6). The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/fmt/src/pp/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6784172495d084f82d7533427b49a34440bae6285630616bd2f073aac0bcb36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db210083c28734dcc811bdcfe7b57fafb55c0ba58798e14ac8923f8c5bd5c393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: med/unsafe_oz_erc721_mint.rs: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62770a97af03fdbf62e0555e55d9a4f3d904f4426ab19a14ab27d318f04a500"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: Linker (2 blocks, 42-1088). The bar is 500 significant lines; this is 302 over it, 1.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/linking/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd70f931df3bf4e3f80f6be84798f13fb99b876c7e52024615bf88d7e9d7bd47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PathState: TooManyFields \u2014 48 stored fields beside 66 methods. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1059638aadcfb0a3a45304a1c34b880f2a88b13310224604e0d90072bfb291b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: med/cheatcode_environment.rs: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Checker (2 blocks, 336-1112). The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66279343bf84e12ba067b581daea7f9c049a88656f37f30e866d3698f5a0187f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fs.rs: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 294 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f3690250df357866d7c0eeda7e485bd92051af5ec05090f61926fc89f683f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compile.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba50cd471e4178991c275df0964f3208cc176a244620fc9af420577ffd3adc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymBoolExpr: TooManyMethods \u2014 47 methods, declared across 3 files: expr/bool.rs (37), normalize/mod.rs (8), fallback/mod.rs (2). The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f84316348b3ee760ccac9de71c87896623536795c4221f26cabd1e9228fc55"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymMemory: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9b34b3321fa35399c89ec538d9e8e9aa39e4c4f049eced55e39f27142abec0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkerCorpus: ClassTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 698-1979. The bar is 400 significant lines; this is 225 over it, 1.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"21360e03a2b9ef9ac3cdde1d1f6dda404c131cdea74efcba50934151d1e599be"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExecutionLifecycle: ClassTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 50 methods, 4 blocks, lines 453-1497. The bar is 400 significant lines; this is 224 over it, 1.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fbf3cc66af9b9fd4932056f06415b57c04680b86701d547ac5428d2729284"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CreateArgs.run_generic: MethodTooLong \u2014 run_generic runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/create.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7d9c2c8b2a656bf0d7cdcb0684c4c02b5a3b44170cc16f0e9027e231b0e0d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Executor: ClassTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 66 methods, 3 blocks, lines 120-1227. The bar is 400 significant lines; this is 218 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ed6ece9b0353bb8bed2e4f8c3d1ac26a7eede2d130ee69de79e04d50e0845"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymMemory: ClassTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 2 blocks, lines 55-913. The bar is 400 significant lines; this is 215 over it, 1.54\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cf894d60a83aabd91a6341e0adc5f99473ace46492eebcfe6b2ed5de8cf547"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fallback/mod.rs: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 256 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b9c5d9a43220f1a69a18d4641dc7ee9f5b185ca1e2d2a4fe98492953e4d1e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.run_fuzz_test: MethodTooLong \u2014 run_fuzz_test runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":5205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd54dceade9a64dd3300c01d101c9a276507a58bcf119057135e3af1a925e4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/fork.rs: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: ClientFork (3 blocks, 112-935). The bar is 500 significant lines; this is 250 over it, 1.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57648e0251498a2ae1b9557dd9ac810d8600de3d5c9a6a2d68b6e7b2ca322eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm_symbolic::runtime::solver::run_solver_commands: FunctionTooLong \u2014 foundry_evm_symbolic::runtime::solver::run_solver_commands runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"261ca41a46c3aaec185fa176e9d592b6a9bbd1c83f2e56329c2501f6275ec84c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_expr: MethodTooLong \u2014 print_expr runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57d93bb270793a875ba09ced5ed3ba874576203f278424c4c7132def6c7f314"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/multi_runner.rs: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/multi_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f06fc574964aaff5c9f758ea74287e9de9efc33bf12a4ed8ea384edb7516d40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/abi.rs: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 245 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9c817a8ff166ac9eceeaf9dc583bc1ae044f633b5ad557c1e215c12d93de9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.default: MethodTooLong \u2014 default runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":3276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67962cc03042d36668672e83a607b5871fd5be03a081243ef1b0c050190a294"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.run_invariant_inner: MethodTooLong \u2014 run_invariant_inner runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f323b1217312168c2c69727e9ae71fee2d910c25903ad829cd2b531fa88ff196"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScriptRunner.setup: MethodTooLong \u2014 setup runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/runner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce7d4e177449cdabe8b68ad08171dbec7bd0d6e97ec55a7fc380a5b996cebff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: InspectorStackInner: TooManyFields \u2014 44 stored fields beside 9 methods. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7614e88a2b093996df913432034f0d74ef464e295b62104f172fd13b2e0c4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthApi.estimate_unsponsored_gas_with_state: MethodTooLong \u2014 estimate_unsponsored_gas_with_state runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"9521ee20ab0a8663d08fa854062986bef723a0d70f8972bb8c8b3f432f9ecdcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Doctor.run: MethodTooLong \u2014 run runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbf9ef523abaed5dc06c603737f1360ba9f4e6c4cabd95196fe0c41bae36230"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge_script::owner_approvals::prepare: FunctionTooLong \u2014 forge_script::owner_approvals::prepare runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/owner_approvals.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e786ab3ee88f4bbdd1a76f46f41eea3674e1b0d80caae8595231138894536bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Checker: ClassTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 336-1112. The bar is 400 significant lines; this is 169 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca8941f12f3803701f682f1f351ecb7e1fba58ab13b3c6b5c842210bef787b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InspectArgs.run: MethodTooLong \u2014 run runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f128f7a88cbc615bf35207032db56fe70db6cb5f6d2b868220dcd0a0d2df5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WalletSubcommands: ClassTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 57-1017. The bar is 400 significant lines; this is 165 over it, 1.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"80db07cd7fc64a61ffd883912649a3da836d083efdc2e9650310eb6c4ff84828"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bytecode.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: VerifyBytecodeArgs (3 blocks, 63-860). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/bytecode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47658b87f68c0cb0c0987c81d30fb229bb50e2bc7961b07e8c042a63e8a9f36d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoverageArgs.build: MethodTooLong \u2014 build runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c28376b13195e332c9db89bfb59650c71fd703f4f2bea21067d27928390f743"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/clone.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1827a31733974ee9c8d8a69e1b85f38280204c6b6b44334b964022cac925b1ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeychainSubcommand.run: MethodTooLong \u2014 run runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f80205bb252ee4225e5c45d7fb0bf60356181560c2a614649cc144d9afcbf68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreprocessorDependencies.new: MethodTooLong \u2014 new runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6fcf637086d91b09ee6445495975cd322c7a2711bfc7df83f23101c2e1285a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge_doc::render::render_contract: FunctionTooLong \u2014 forge_doc::render::render_contract runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed7acc05b2be49802845bfefeb346b02c4f00c27c2a24c62b5a2239497fe4fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir_ext.rs: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 198 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc4c0ea7b2b59cf6bcd45229149404a4d2e10d0d1f3514bd775ffa513424cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm::executors::showmap::replay_corpus_to_showmap: FunctionTooLong \u2014 foundry_evm::executors::showmap::replay_corpus_to_showmap runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde770b1ce9939be281d425230af07ddade53e066e5264ed52b67040451cda93"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScriptArgs: ClassTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 118-1063. The bar is 400 significant lines; this is 154 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c586807bd2a957628bbee49cb76b9293d93efac271fdf2a90d0a27026bbd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/opts.rs: FileTooLong \u2014 690 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 190 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/opts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ceba6279fba2caecb00115b9d8d45d69ae5c8454eaac9171587e95284329a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cheatcodes.call_end_hook: MethodTooLong \u2014 call_end_hook runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b2d481c22b56b4ca190d32131f97ed63e88ca6ff0e28e2553b75e29e689c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InitArgs.run: MethodTooLong \u2014 run runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/init.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb2bb3ccc4aefd0b79c2cee358491195704e4ed7a2142797da518f91396fde"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_ty: MethodTooLong \u2014 print_ty runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"606a22bd88eb1cd06e9f8f7465adf0dda2299da98017fd1d40c9a1de47f6e6ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateArgs.run: MethodTooLong \u2014 run runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/update.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"679ac02e63833dfb4a9f92d5d5ce6e0afbd6a82111deab60b0aeb3cb32122f18"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClientFork: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 72 methods, 3 blocks, lines 112-935. The bar is 400 significant lines; this is 143 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"13940741616a94fbea609f4a3d8842b9293de54d9ee9d9bd02c164669e1b0873"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CreateArgs: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 57-826. The bar is 400 significant lines; this is 143 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/create.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"87be95cc531c13c32d95433c81435186ef6dbaeb26e1cc6f79fe59d081c8efef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/create.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: CreateArgs (3 blocks, 57-826). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/create.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f98faaf99967261104a6fb46a11345c1c185825d6968380c936ee379c7e89ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.search_invariant_candidates_inner: MethodTooLong \u2014 search_invariant_candidates_inner runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/invariant.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc4d47700fd28e4445ad755fb99c0f382568242602609f27e995fb6cb1a62d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge_script::verify::verify_contracts: FunctionTooLong \u2014 forge_script::verify::verify_contracts runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"253478e724fa0007af95048998aa6f402ee508428ca1f9ab8f314febf26d10f4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Git: ClassTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 2 blocks, lines 387-1172. The bar is 400 significant lines; this is 134 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f86565f35119ca3b93034e55a0f96db5c60f03046638aa4667d2fdbb079e737"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/remappings.rs: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 167 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8b626f3f14295786f644073e92f2fd42e69083d444026526450f84ae38adec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Analyzer: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"235af796a5dfffd11348b0e346325b259201c00c92479af92463deefb921c193"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ScriptArgs: TooManyFields \u2014 40 stored fields beside 18 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4125f00eb5554deb9d31aec6bb6fa2aaf1d8e2f735079c5e4ce98b0fb08286"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.deploy_code_cheatcode_call: MethodTooLong \u2014 deploy_code_cheatcode_call runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13ef1fe0e4202f19f057331e14170d5587ad083c1121462f93c97b9875fb40e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_function: MethodTooLong \u2014 print_function runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4b5650af575757530604c9f82f32f7ddfa9ab43c0befbc7b166f4c8592aec6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VerifyBytecodeArgs: ClassTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 3 blocks, lines 63-860. The bar is 400 significant lines; this is 128 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/bytecode.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9f189f33e05f0dd32864df516f399974df5ce53682929854564039a093202"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.execute_call_path_batch: MethodTooLong \u2014 execute_call_path_batch runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfc4ac52d16e42266c5a64d77604c93f6397a75beb80463c33b3d0ae3c2da36"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CallArgs: ClassTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 97-985. The bar is 400 significant lines; this is 126 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ea8beeca730eae6e912344e5b65bb2ee30f7d6139decacab654ec0eccdc0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EvmOpts: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/opts.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d04a3e3dcd95449063573004eae2e4cb322b01c2e06cb13ed6e30ef112af670"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Campaign: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 523-1204. The bar is 400 significant lines; this is 116 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb62c6b7739f3db37868f5390c2338cf4a5c19a9a12976319ae23172efad54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: high/arbitrary_send_erc20.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c869738156a048e8e8afa928a5a75729afa240c2f47877d36e44aa7dae037f24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anvil::eth::error::blockchain_error_to_rpc_result: FunctionTooLong \u2014 anvil::eth::error::blockchain_error_to_rpc_result runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/error/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd21f7a275e8d2e1bd543caeb0c33a858ab5d7ce0af1c0aeab343101ba1a2e38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/call.rs: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: CallArgs (3 blocks, 97-985). The bar is 500 significant lines; this is 144 over it, 1.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0dca49520b629b6cc12a58bb03f6df2333f81382dffac7ee22bc82032fd07e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tx.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/tx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d344ac245b6ae58c94a45964d68986a5f5728c189611e0fc56917d9027a45351"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/verify.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"560e4588a6b4c087945ee5d8cc246817de9af77c1365e5c9f56a89330bb88369"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge::symbolic_regression::plan_symbolic_regression: FunctionTooLong \u2014 forge::symbolic_regression::plan_symbolic_regression runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_regression.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb5d0f16d7d415d9796f048b13751d1571a92e8f613a515bc884b7bc1363d46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tempo/configurable_account.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/tempo/configurable_account.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3570e24a6f2383f40a2cfef05eeb2d7f4ff85a9cf282e5204da8c8afcab24ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: high/arbitrary_send_eth.rs: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 136 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_eth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca0f563557be4d686a8a3ed82a10e259fe76d867532769ce0c1e362c7dddc36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/slot_identifier.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: SlotIdentifier (2 blocks, 391-1053). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0be406ad2d1f77d8254129d1926fca9d1ec77fc117498549e294482d93d87b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Linker: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/linking/src/lib.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c477bf0d801b478c7e706e01b1805c5e1467526181b0e51d657bc97dbfd45f17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/json.rs: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 130 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1394e7d9db91c752b6475cbcab685bb140022891f4a4e42224e60153dbac183c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Campaign.run_agent: MethodTooLong \u2014 run_agent runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15416da6bb019fd604e8baa34e720a75c042cb4da0010a7e7673a4460133832"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymBoolExpr: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 3 blocks, lines 9-795. The bar is 400 significant lines; this is 102 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d48f021aada7b33de8512d2311694df1d28b7576a1aa0d1c2fc4427af591b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verify/external.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify/external.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524405ba8d9d2175abc27a904f7e01f8e3f85a2740e6909104475570fea83869"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cheatcodes.record_state_diffs: MethodTooLong \u2014 record_state_diffs runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d72a6772ef7d820fe48d25b0f5d51cd077942c441bf2170dd475e8fffee4a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/crypto.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/crypto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b93025f863737a21a6f4d492b140a4cae8746eab377ee84ab0fd898a1cab1b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/bool.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: SymBoolExpr (3 blocks, 9-795). The bar is 500 significant lines; this is 119 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6620f70bcc2667a76c7e57181ba5aa8b6780d37f1c43467f795d3d3de194305"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/inspect.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 119 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9864fadf1aa0213ba069b294ec998d57779bf322baef071cc825530279c288"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/external_compiler.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/external_compiler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3fa9c03df910ac8733daca3f39e3a2d4d158ed2cab6af6eca1acf73e20cd2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkConfigs: TooManyMethods \u2014 37 methods, declared across 2 files: src/lib.rs (35), src/optimism.rs (2). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"crates/evm/networks/src/lib.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"38397cfc3ccd63f8777407efd1c54bdf1f4fe6937acaa2d0dee19f620c51dbac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Analyzer: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaa7485340a86cd97469267d2a5c4a9c95885cfd567dc472a46e5ae2675e9eb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeArgs: TooManyFields \u2014 37 stored fields beside 4 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/cmd.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"011c022365501e2fa43cdf0ed536b8f07b6f5e3983cc297604d3881ad5a0044b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/run.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: SymbolicExecutor (4-868). The bar is 500 significant lines; this is 116 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c0e04fa5695345bc346777db61199e0db1fcb0db14aadc32f64743142465dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/soldb.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/debugger/src/soldb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce51f2cf7774c6490bf58b3cab3e2db5cd4fad770f3eeb53642107ca98d8ae0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/networks/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a879bebaf3481f8dbd255d0263e52706e5a0a857eca3a62cca7011dbd8b147"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EthRequest: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 87 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/core/src/eth/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8515a704e97dd1a640a8c50967564b6b724925cdf25981176f3687f8fc7742f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnvilBlockExecutor.execute_pool_transactions: MethodTooLong \u2014 execute_pool_transactions runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fd8d3d760f5c430502cf5ea1dbcbf13e308afcb26090c23c099101b4509786"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_yul_stmt: MethodTooLong \u2014 print_yul_stmt runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/yul.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b301e0a1a33efda41c212506d329ade82cadf26b4a6ed405dcf2ce6c16f97f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge::workspace::copy_project: FunctionTooLong \u2014 forge::workspace::copy_project runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/workspace.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee40269b72c1452c8bdc2f1840f7eb3b3dfd88932cbc0c722ab766f803300f79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FoundryTransactionRequest.try_from: MethodTooLong \u2014 try_from runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6bd96e8abb783976dda4678e41dfcec612750de79b8622989fcf2c7cce1824"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: med/ecrecover.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: Analyzer (3 blocks, 155-848). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893cf4e6784b2e176516d35bdf8502a44db7a22f9e871303c6406569e8987584"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FoundryTransactionRequest: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 15 blocks, lines 51-824. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4286a02809b35ff6d8904f39497ac9da9c5d10aab04d9f5dd210055cc1479d79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/evm.rs: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/evm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2141da543740a6b9fe7bcd0a2e595a360ed43403c0ae13cc9e20cf836bedf78c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Cx: ClassTooLong \u2014 479 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 92-835. The bar is 400 significant lines; this is 79 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"67090f31997cb7d56f5d6cfa9b6d17f6d00c4078039e468515280ce35bfd714a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeConfig.as_string: MethodTooLong \u2014 as_string runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725299a241e8bd9e6c5ccc30b380184c386a32137d60724a2472949d34c57f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthApi.reorg: MethodTooLong \u2014 reorg runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"650b6dd1067039ea90177621c396781c2e556f0ab1333fb731241299526acbe7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunArgs.prepare: MethodTooLong \u2014 prepare runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/run.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fed88f5f89eff1807e47530237589b58224fa3b4fa3671466b9242abd98a663"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.handle_symbolic_vm_cheatcode: MethodTooLong \u2014 handle_symbolic_vm_cheatcode runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56599c087da1bd0bd964de59c71f38418c554cd458efd1c806a533160b9acb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.replay_persisted_handler_failures: MethodTooLong \u2014 replay_persisted_handler_failures runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b802c6cfda4576d36f9db4cd396dadd86b5032a9b4beafc0e06ae833cc7853"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FunctionRunner.import_symbolic_fuzz_frontiers: MethodTooLong \u2014 import_symbolic_fuzz_frontiers runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"554631575f057414f86a0fd5565327c4c96b63e720df96560edfd759e0a6c435"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge::symbolic_minimizer::minimize_compound_value: FunctionTooLong \u2014 forge::symbolic_minimizer::minimize_compound_value runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7a234cc266034aed91b6b1349633f1d5548aff3ac39f3084b8533500f35f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymBoolExpr.cmp: MethodTooLong \u2014 cmp runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557a2077b0856a9209dcc3887127ad85dab43fd934cdfcfd715ac9c075333a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallTraceDecoder.decode_cheatcode_inputs: MethodTooLong \u2014 decode_cheatcode_inputs runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9486d57c778995c8133b4bbec4891700030a1dc0feb8594b866e3a4fd2085931"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolidityLinter.lint: MethodTooLong \u2014 lint runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0272098588acb93b688bf22cc6a264f3b61030b86a17740fb742c145d887bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: forge_lint::sol::analysis::exprs: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/exprs.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0affdf5e768dea1a52eaff63ceb8804066ff7f0b614a7bacfdac4b2a974f4ecb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.stmt: MethodTooLong \u2014 stmt runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b6e4dc2cb2e80e84a610a25394b4b6e2c05a2009fc2525f2ca49506e88efb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eth/mod.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: EthRequest (74-968). The bar is 500 significant lines; this is 77 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/core/src/eth/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c31b563979e9fd71c6cb8df4a703d26940ab9043c88516108c9bcf1139e993"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymbolicExecutor.join_call_outcome: MethodTooLong \u2014 join_call_outcome runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d52684f349a6f7164bcbc2d6d235fd4ee9166610ea043c79db16dcdf2cd6136"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContractRunner: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 459-1201. The bar is 400 significant lines; this is 57 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c26da6bdd16790b836f08f71941f31522bd4619277f4421e2c5873079064599"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cf52f94730e17ea888fe89263a78c49efcd12f04046afcb37553c1f723c9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.print_assign_rhs: MethodTooLong \u2014 print_assign_rhs runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dc26e1bba21945e77019fc19ebe795753ea7094ada2d07ac68aae3811c600f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fork/multi.rs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"276154753d3f2b69290a64304bbf2985ca96890be4e7f91f283f75a1c2387748"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EvmOpts: TooManyFields \u2014 34 stored fields beside 39 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/opts.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b9950d46892163aa6eb37df02bec50a5f3394632eaf6fddb382739233489dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InspectorStack: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bb4c63307133dc90e13792adff837599741931d76f15a8ca95db28a3611000"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cheatcodes.create_hook: MethodTooLong \u2014 create_hook runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475f696374ca9c9b98deb6cd93b0cbc23b278fbcf32e479839cafacd32b6fed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cmd.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d99b8bdc59f9525b99cfaf85ea1dd5fa4540fc730438b99e4e8e4789de23f02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anvil::try_spawn: FunctionTooLong \u2014 anvil::try_spawn runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"481388a733dd147a101f5a04c3193614526595dede0d110f22dae2c541251660"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/owner_approvals.rs: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/owner_approvals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178ef6c9a8b0760db097c1d1c35053a86b4d485349edc76ca4dda241776f52d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Analyzer: ClassTooLong \u2014 447 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 3 blocks, lines 155-848. The bar is 400 significant lines; this is 47 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a5292ea63e13457a1a15d39030a9266c0a28907b7ef30f5b95656b7be7b3f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm::executors::invariant::result::can_continue: FunctionTooLong \u2014 foundry_evm::executors::invariant::result::can_continue runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/result.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"167c66ebef04b19629a78097ac57a51347acd2d5e04d22e9cd60b2dce34abb98"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Shell: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/io/shell.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e484ab53aa9ebfefab83e9cd3c09fb282da898d1a7cdbeecf0ed5cc78f95673"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_common::preprocessor::deps::remove_bytecode_dependencies: FunctionTooLong \u2014 foundry_common::preprocessor::deps::remove_bytecode_dependencies runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c1b3e648893cdcf6383fa8dc2d45737eb34bc6471197edd81e0b3cec3c02e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathState.apply_executor_env: MethodTooLong \u2014 apply_executor_env runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"245d2715f85c053bef45bc7deff9d0962306272d4cc20bba14adbd4d63758451"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/install.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36aee482094296b40308911bd7b33127b588f2f85ed9ad685c5720ce9d2bd52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executors/showmap.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"271827ca48a6b6bf59a81e7d8c824e8b077bf3bec2da9655f0b6c03d82c517fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/executor.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: AnvilBlockExecutor (3 blocks, 174-702). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81f76ca3f3479a4f21762d6d3cf6a66f441b30f234d66b5af707e857b57e141"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/ext.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12275de296100131ec685bb693f7f3a4e93df1dec07fc0390e14acea65d30e94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/equivalence.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: SymbolicExecutor (95-685). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/equivalence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"467f5d5a5821b988182fd8d57c0475118e982fa761ba05ee06e75131777e1071"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContractRunner._setup: MethodTooLong \u2014 _setup runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c93ec45986b75fa868691d50213ccd31b3d30171480bdfb1abd2f26d1852d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge::symbolic_regression::write_call: FunctionTooLong \u2014 forge::symbolic_regression::write_call runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_regression.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0857912c451918b1f5950f9bdaf649bbd2369272eaae0326866d1d4dfc19d86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VerifyArgs.resolve_context: MethodTooLong \u2014 resolve_context runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac98a7b3a7639ebf886b6c2db2bc6d2008bd920e5e904aed4b655200d51a011"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/coverage.rs: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: CoverageArgs (2 blocks, 71-728). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de158089dd49565376a384688b422122014ca1d312152a68240056c88c08540b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SourcifyClient.contract_source_code: MethodTooLong \u2014 contract_source_code runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d32c542a4a52c5be0d65c512a5bff90c9a5dc6b8507a0d8cba3daefa408ea6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/send.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: SendTxArgs (2 blocks, 41-554). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/send.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e71fc89e621ea9cbc7a943bef306ec9cf7006a21cb58cab7365dd63489743af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: high/function_selector_collision.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: DelegateTargetCollector (3 blocks, 216-696). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da26944e990021a12416f1f2308bacf0401c1fb6514101a9a411eebbb13f40c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RawCallResult: TooManyFields \u2014 32 stored fields beside 14 methods. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70c3e8f1a0cef4d168a75e6927d2a08e0efbfcaaa33462ce0008164ba545cbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mem/monad.rs: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Backend (233-748). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/monad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843d977b3a5d4ec18e6e1015ad7212c57d7321de2c9d6bd34707b13340032ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transaction/request.rs: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: FoundryTransactionRequest (15 blocks, 51-824). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf61c34a277e4d8517e411cc5f380a9b3edbb4134bf46c1d17399bfb31fe2eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RecoveryStore: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 101-661. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/recovery.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ff2f4a283bb1ae4397386d7df494bb3ddaa856ba8fe7fa016ed291ff501d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: identifier/external.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3455457d69c052b0399f3577a2f4a7f4d20c87f2546a550079573e72eacedaac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_cheatcodes::fs::deploy_code: FunctionTooLong \u2014 foundry_cheatcodes::fs::deploy_code runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b7928730f19a8d85b84a54afcff67a60d7555416d861873c2a00ce1f545815"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PathState.expr_upper_bound_usize_cached: MethodTooLong \u2014 expr_upper_bound_usize_cached runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"866393d6837976fc94ad6bd37485caaecc771c902940a08029c7fda43fbbdc00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TomlFileProvider.read: MethodTooLong \u2014 read runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/ext.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce8f30e3717c35880eaff6489da8602099c0e1c19756b05bd7469e6511c5d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm::executors::corpus::replay_corpus_sequences: FunctionTooLong \u2014 foundry_evm::executors::corpus::replay_corpus_sequences runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d418204fedb045273768a6390cb948e2f57fe5842074694251eb719857ac125"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm_symbolic::runtime::solver::fallback::checked_mul_guard_branch_model: FunctionTooLong \u2014 foundry_evm_symbolic::runtime::solver::fallback::checked_mul_guard_branch_model runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12de532014c43d97263335697a6fcd2c796fa70cce494d7135843a468103983"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuzzCminArgs.run_to: MethodTooLong \u2014 run_to runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"713495f176d682c13c1f05646c587f0e5ae9b698c12bce31edf03e9614bf076f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SymBytes: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 3 blocks, lines 4-633. The bar is 400 significant lines; this is 18 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc9ca35e912240df9d83d10d5506830077617f7e49082b7d252653d158d041d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeArgs.into_node_config: MethodTooLong \u2014 into_node_config runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/cmd.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacaeced6e4af1d92937f441bd785344fc633726be90234f87dd4a555a2e5d9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoverageArgs.collect: MethodTooLong \u2014 collect runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74ae6649750f87d1bdffcb46ecbde321b31e2c07e815ca0469f53360c6fbb12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: forge::mutation::runner::run_mutations_parallel_with_progress: FunctionTooLong \u2014 forge::mutation::runner::run_mutations_parallel_with_progress runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/runner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1be4a45eec7cfc12c757360915f566296da3fea45161ce6c3c6ab91db474f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScriptProgress.wait_for_pending: MethodTooLong \u2014 wait_for_pending runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/progress.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9417fef1efca8c41ed18b84311ee3ec5ba16a6f78adcab19e0c0aa2f840a3c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Backend: TooManyFields \u2014 31 stored fields beside 324 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf2c21d01d840fa3bf9470a5e66436a3d3d3d78ac593bf6d70c6691a7cca5a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FeeManager: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/fees.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0165082e8ca68163a951ffb57917bc6ac8da7be3eec622de3402da53f5b95b3a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChiselDispatcher: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/dispatcher.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b4a708e1aa0903e8412d7982a369165a2590c215a9f79364f94137f742caeb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymBytes: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93a5869edc4d363f1548535914c142356b2ce0e161d5d5c29d9baaf4f4d202"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TestResult: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/result.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"33abf5e1f4ac8e8010eade4fd4b90eff32a5e825c45055b32dee25723b41afbd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AnvilEvmArgs: TooManyFields \u2014 31 stored fields beside 1 method. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/cmd.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d141a4330a68784276b62bd1120a93df74a30683609c940355d3ecb19189bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CallTraceDecoder.init: MethodTooLong \u2014 init runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"66841ecd3ca3076f43dbe501d3d588dfbe232c5c506589dd6c3877e3fe15762d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExploitArgs.run: MethodTooLong \u2014 run runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/exploit.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3aa45aa454adf608eee423c6aedff22a3df283dccec0ee6e49c50f8f242de1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SmtLibSubprocessSolver: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 120-659. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8990288d1332daea230af038f145eb7812b331b64389137badbad059578732b8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SlotIdentifier: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 2 blocks, lines 391-1053. The bar is 400 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d0507c2642104a3bcd014f64ea9e7705dbc14f9cacfad6d1ec5114ecf97874"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wallet/session.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a054da715f7edd0f2c50ff98f554e6d319dfbc30a7dc70508688a65d768f066a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/simulate.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/simulate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfbacc364096777091c05bfc80d1c9520449347c24a21c18cdbc4c73ff6e4ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: foundry_evm::executors::showmap::replay_sequence_for_minimization: FunctionTooLong \u2014 foundry_evm::executors::showmap::replay_sequence_for_minimization runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d7cc171501a8c0577dbcd384c6edb673d5a109581c1eb513349b26b2dfc864"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SmtLibSubprocessSolver.is_sat_inner: MethodTooLong \u2014 is_sat_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"749d4267459f5e666b26f753de334ba4b24e0e9ec62123eab5eceeeb6af44212"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): crates/lint/src/sol/high/arbitrary_send_erc20.rs:540-635 | crates/lint/src/sol/high/arbitrary_send_eth.rs:265-340 \u2014 These two members are variants of one another: 49 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedbcb6d7d37e562f56de71f698c37710ed5dc967ee8af7b193abd2fffadbaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/anvil/src/eth/backend/mem/mod.rs:4447-4495 | crates/anvil/src/eth/backend/mem/mod.rs:7226-7267 | crates/anvil/src/eth/backend/mem/mod.rs:8021-8055 | crates/anvil/src/eth/backend/mem/mod.rs:8357-8420 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57159172c5c325024cc54318bea856496615fae942ab1b40989f4edcc6cc5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/evm/symbolic/src/executor/calls.rs:14-253 | crates/evm/symbolic/src/executor/calls.rs:266-302 | crates/evm/symbolic/src/executor/calls.rs:470-500 | crates/evm/symbolic/src/executor/cheatcodes.rs:739-774 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f610971c28126c5f4289a607cfdf1545301bf5ef26e026c406b9118887b1cd95"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/lint/src/sol/info/internal_function_used_once.rs:26-99 | crates/lint/src/sol/info/missing_inheritance.rs:19-122 | crates/lint/src/sol/info/unused_error.rs:21-62 | crates/lint/src/sol/low/inconsistent_type_names.rs:20-58 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/internal_function_used_once.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4946e33df968008cb8e5aab57a24763b6858fd6075f917ec641c3831fa4161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/cast/src/cmd/erc4626.rs:973-1043 | crates/cast/src/cmd/erc4626.rs:1051-1123 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/erc4626.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb90a3297dcfbe0d5ac77f6eb63f1665348f5bc0c93b564751a4c1bed18c03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:7446-7498 | crates/anvil/src/eth/backend/mem/mod.rs:7537-7598 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7446}}}],"partialFingerprints":{"codehealthFindingId/v1":"262906efd95643c2953373e2446035c0115aec5c163b68d41fbc3984ce65a192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/config/src/providers/warnings.rs:268-320 | crates/config/src/providers/warnings.rs:330-400 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/warnings.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13bb4c852f7f9dab6cbc0f4a6d6b315786446841228379aa67cecd5709f891c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1876-1903 | crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1905-1932 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1fba1d6e8a1c1d69e82817141cc1977a9cf728fc8f07ada3443e4e00c7325c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:65-109 | crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:976-1027 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c111263ae04e1ae986414bd1343a6ed0ae783c99910718d6cf47b17ca2942e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/anvil/src/eth/backend/mem/fork_db.rs:216-256 | crates/anvil/src/eth/backend/mem/in_memory_db.rs:586-625 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/fork_db.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f3af0de999af1774461217be6154be1a5eb934a4184bea218f1dabb57fc794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): crates/lint/src/sol/high/arbitrary_send_erc20.rs:402-440 | crates/lint/src/sol/high/arbitrary_send_eth.rs:214-248 | crates/lint/src/sol/high/controlled_delegatecall.rs:180-215 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"b859223d9367efa5ba1dd0946f52ac380995fd3aaf5b8ec034464e30ea132edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/anvil/src/eth/api.rs:3243-3274 | crates/anvil/src/eth/api.rs:3284-3323 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3243}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fb6b64ae348eb0e0452c749d45be5a8cfb54333b37185e35662a5976d1f578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/cheatcodes/src/evm.rs:1681-1711 | crates/cheatcodes/src/evm.rs:1716-1742 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f9cceb200680a86c9c56f39695a944a70240c63a16f78e02bbcf6722922e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/evm/symbolic/src/runtime/expr/bool.rs:699-722 | crates/evm/symbolic/src/runtime/expr/bool.rs:741-767 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f748aee4d321c1362dd456c7a1096a8d0fa0c354b3d10bac01a3c735d4ac96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/evm/symbolic/src/runtime/solver/smt/mod.rs:73-106 | crates/evm/symbolic/src/runtime/solver/smt/mod.rs:129-162 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/smt/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f9e90886d1f2bfd9cfe13d841c5804875ac79ec3f8d3df556a34016d08afed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/anvil/src/eth/backend/fork.rs:398-418 | crates/anvil/src/eth/backend/fork.rs:452-473 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"75df5a23ec7b20e3432244b4ba5b5f376fa8e5aa28b385ac70c5fe149554afd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/forge/src/symbolic_minimizer.rs:961-989 | crates/forge/src/symbolic_minimizer.rs:995-1028 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"461d1880b4377bda4460f068a34fbefbc0b22f025b723b045bf7ad864f984aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/config/src/providers/ext.rs:310-327 | crates/config/src/providers/ext.rs:350-367 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/ext.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af9e21db948d32211dd8fb85f9aa3c6e2688d0dd138c6221069c77608c53627"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:626-649 | crates/anvil/src/eth/backend/mem/mod.rs:689-708 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaaaaa7c3dea095507d755d1890a5fc9807fc43e5c6ef375a3611a282961a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/lint/src/sol/high/arbitrary_send_erc20.rs:261-284 | crates/lint/src/sol/high/arbitrary_send_eth.rs:127-145 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc681b87e53fd0a6885823742470147539ea0b328a7100ddedaf5eeb583289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/primitives/src/transaction/envelope.rs:352-368 | crates/primitives/src/transaction/receipt.rs:281-297 | crates/primitives/src/transaction/receipt.rs:395-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/envelope.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"59494401d9995707742596373a1877f1a1856326600eb40d5d0cd351835418ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/anvil/src/eth/api.rs:3007-3024 | crates/anvil/src/eth/api.rs:3079-3099 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"decc679b90e15f0980b157b28ab10a828ca8c0129d873c7e9a094c2a77993a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/evm/symbolic/src/abi.rs:488-508 | crates/evm/symbolic/src/abi.rs:516-536 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b099f309309c9705b634c5ac727282e43c15e1bb4bb6b2114180d29c52b98305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/cli/src/opts/rpc.rs:98-115 | crates/cli/src/opts/rpc_common.rs:97-118 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/rpc.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec351ef16b0e3b8e5612f555e1bfd2dc4d35a0d29b458d06c61382ded48d39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/script-sequence/src/sequence.rs:240-266 | crates/script/src/multi_sequence.rs:62-93 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script-sequence/src/sequence.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cac07e75e9909eba9c3b55ef405ddd61d3d6161b0fb0c8dd2412d9a424a038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/lint/src/sol/gas/immutable.rs:120-135 | crates/lint/src/sol/high/arbitrary_send_eth.rs:923-938 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/immutable.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a16b2c357943c69d6db73d869dce403b19ff5a26e05247fb8e55d96374799f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/primitives/src/transaction/receipt.rs:300-316 | crates/primitives/src/transaction/receipt.rs:319-335 | crates/primitives/src/transaction/receipt.rs:413-432 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/receipt.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6365c60726019308255764e0f04118d7327cc1b7f1b1438be4949ea24cbf5681"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/lint/src/sol/high/reentrancy.rs:766-790 | crates/lint/src/sol/low/missing_events_access_control.rs:107-127 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"03918bd7452ddb8a9169cb0a36c907563a4f53d1843790c88551da1d9a7f5cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/anvil/src/eth/backend/mem/in_memory_db.rs:103-117 | crates/anvil/src/eth/backend/mem/state.rs:38-49 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92557e3f4b6c2c0bb4acc50711a290f24d7e0a887c18b8dea62c6e611659a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:7830-7850 | crates/anvil/src/eth/backend/mem/mod.rs:7994-8014 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7830}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b579a12634aa0527ad7a6e5b9dccb0a3a30cc7a79d8a889473d5168bee5c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/forge/src/symbolic_minimizer.rs:446-476 | crates/forge/src/symbolic_minimizer.rs:1362-1383 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdf0e2cc1671ecc6e143846f9376fb111ec7c2b166c7cdfcd704a7d15bb01fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/primitives/src/transaction/receipt.rs:195-211 | crates/primitives/src/transaction/receipt.rs:214-230 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/receipt.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae54de83494ed751ac78b3cce4594f647ec00ca747e3804c0dd86788004dc05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs:146-157 | crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs:160-171 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8322cc7700bca68ff9c088380bf2143288e6ae9708a1f6463b635632b4de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/common/src/provider/curl_transport.rs:44-63 | crates/common/src/provider/curl_transport.rs:155-182 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/curl_transport.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae447f5bccae12562b8c2ad5e3a3d5ddb29ddcc0a2983ccc75e5ac71c9c394a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/forge/src/symbolic_minimizer.rs:545-578 | crates/forge/src/symbolic_minimizer.rs:1180-1201 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f802d2f505d65719daac9d32b603bfc8565c8e473ab65579b798da97e5f6d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/evm/symbolic/src/runtime/state.rs:2944-2957 | crates/evm/symbolic/src/runtime/state.rs:2966-2979 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b84f0e3594701e5dc72d763d29ffd54ec6a03932c6d00b327042fdb06d87f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/anvil/src/eth/api.rs:4538-4566 | crates/anvil/src/eth/api.rs:4592-4614 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":4538}}}],"partialFingerprints":{"codehealthFindingId/v1":"04abd98d907e49c582771b96b32cff954bb8a47f83cecb77c2648dedc55f1bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/common/src/fs.rs:148-160 | crates/common/src/fs.rs:163-178 | crates/common/src/fs.rs:181-194 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/fs.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf01172ee7e87b5dde3cbe37664c249870644929ba0d5e366e9515e67d83e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/common/src/provider/mpp/transport.rs:280-295 | crates/common/src/provider/mpp/transport.rs:301-316 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/mpp/transport.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f8cf155f8d86d4cc3e0ca5cf92ca158672bb65a1a78a60264b3718051a4b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/cheatcodes/src/inspector.rs:1214-1244 | crates/cheatcodes/src/inspector.rs:1254-1278 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ff99aa909c7d4c2ee5b1331487fd56aeab05d81ff692e6268428bb6baa2707"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/common/src/preprocessor/deps.rs:420-442 | crates/common/src/preprocessor/deps.rs:549-565 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff988090da33946f94e3fcccfe29dbf79ff184f8ee0ab8a9250ae914620cd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/evm/symbolic/src/runtime/memory.rs:729-744 | crates/evm/symbolic/src/runtime/memory.rs:754-768 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7700d70b7791352deae29cb7b13b327a4ef393be92c1720b1189c88e01abe520"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/lint/src/sol/low/missing_events_access_control.rs:228-246 | crates/lint/src/sol/low/missing_events_arithmetic.rs:183-202 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/missing_events_access_control.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d152b53a66d89bc889b1602a98f90531531d47e6cc4f68e6b38a12448678593c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/evm/symbolic/src/executor/calls.rs:2615-2628 | crates/evm/symbolic/src/executor/calls.rs:2635-2648 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03582831f64808352f0f8b4482ffc3840790bf70a4133e3e3769503d8085b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/evm/symbolic/src/runtime/solver/smt/mod.rs:108-127 | crates/evm/symbolic/src/runtime/solver/smt/mod.rs:164-188 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/smt/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d32b2171727fb5812e3cef37a13c0a8ff16555182b68dca83877f740120912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/chisel/src/dispatcher.rs:532-545 | crates/chisel/src/dispatcher.rs:547-560 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/dispatcher.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f29229d2f2cb5844d19307090d091f4e754be056b4f8e595ac4c55354271fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/lint/src/sol/high/unprotected_initializer.rs:210-221 | crates/lint/src/sol/high/unprotected_initializer.rs:223-236 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/unprotected_initializer.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf2dc770de8719843ff88ebe6114f0943d898bb5a75d161abfb1a955fc74b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/cheatcodes/src/crypto.rs:785-795 | crates/cheatcodes/src/crypto.rs:797-807 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/crypto.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da28d282ba30b8be09d469760b876c78f329e428da735d79f638461199b72d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/anvil/src/eth/backend/mem/inspector.rs:397-407 | crates/anvil/src/eth/backend/mem/inspector.rs:436-447 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/inspector.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"20941d4264552f34bec26fbf17556ea0eb0543550262b9698d8e8241fe3fdf16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/anvil/src/eth/pool/mod.rs:419-432 | crates/anvil/src/eth/pool/mod.rs:435-451 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"89818f3af7b6a5cee62bd4f8a9efeb94bc542beb65fcd5eb13e00c53cc3b8cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/evm/core/src/backend/mod.rs:1634-1648 | crates/evm/core/src/evm/tx.rs:266-283 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaf56eb6f2d855a852c4c38fa4c58651b47392de11e023ef8c2d5c0ca3f6b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/evm/symbolic/src/runtime/bytes.rs:105-116 | crates/evm/symbolic/src/runtime/memory.rs:453-463 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d095292f5a45d14be9100be7b08a1afe90570b016a56954c3744e4952cb4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/anvil/src/eth/backend/env.rs:123-135 | crates/evm/core/src/utils.rs:26-38 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/env.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc96b2f1aa480f4af3dc04f85e4d4e5dceeb6228ca5a33706d1d9017a79a2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:3148-3166 | crates/anvil/src/eth/backend/mem/mod.rs:3176-3194 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d48f089462a42c3265af1603eded9f779f2aa23060b6726282357fded1fb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:4055-4068 | crates/anvil/src/eth/backend/mem/mod.rs:4089-4102 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea037fc0e1d3144143fe3852cd7a93df85d3d877d70d65db7d5fb76a6a42936e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/cheatcodes/src/evm/fork.rs:355-366 | crates/cheatcodes/src/evm/fork.rs:384-396 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm/fork.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f1c9fdd7c0b096be9b26968da93e0826e5db1615b65d707f1ca21a9f5c6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/evm/core/src/backend/mod.rs:1598-1607 | crates/evm/core/src/evm/tx.rs:213-224 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"51216fb6224bfd9239dfd053247168b8f8821cf945e42e882e75c399c36a6e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/anvil/src/eth/api.rs:5151-5168 | crates/anvil/src/eth/api.rs:5174-5191 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"03987138ad1135bbdfd4c7530234444eb1c783d7c8b65a53e5d3ef2078753ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/evm/symbolic/src/runtime/bytes.rs:197-207 | crates/evm/symbolic/src/runtime/calldata.rs:36-45 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/bytes.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fa61467d71cbd3d59358d52f870a7546b0f5e8f563aa8d7b40ada23b6a7437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/evm/symbolic/src/runtime/expr/expr.rs:1195-1203 | crates/evm/symbolic/src/runtime/expr/expr.rs:1759-1767 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83dfaaed07e0dc420981e6182e254ec35efdadad1c22fc7421f04386c97cd95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1934-1941 | crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1943-1950 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"168ec431c9436d8f2909a817b5ae176f6239b3b0f2be50e2e90064933ddb2264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): crates/cli/src/install.rs:71-71 | crates/forge/src/cmd/fmt.rs:57-57 | crates/forge/src/cmd/reinit.rs:17-17 | crates/forge/src/cmd/remappings.rs:20-20 | crates/forge/src/cmd/remove.rs:29-29 | crates/forge/src/cmd/update.rs:35-35 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/install.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b274e88dc8e0fe12916bc7754ff979f708af839a80c643ba062347435d7f3f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): crates/config/src/lib.rs:2746-2762 | crates/config/src/lib.rs:2767-2783 | crates/config/src/lib.rs:2788-2804 | crates/config/src/lib.rs:2809-2825 | crates/config/src/lib.rs:2830-2846 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4495ea033bb75e5d35883f395671248b00bec1382e5d932e0e1445b738a1e36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/forge/src/symbolic_minimizer.rs:821-840 | crates/forge/src/symbolic_minimizer.rs:868-888 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bde2f861e8000f10ecc60fa41a49d6f750e834dda9373d74107fe9d1983e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cast/src/cmd/tempo/zone/auth.rs:26-34 | crates/evm/evm/src/inspectors/stack.rs:2736-2743 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/tempo/zone/auth.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5043418239ecd36ffa1e9b32f86e8e27cf01da69ba43d1ac9a027177cb0502"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/forge/src/symbolic_minimizer.rs:521-540 | crates/forge/src/symbolic_minimizer.rs:1144-1158 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dc3ceca0e31a37ee85d9f6b509c02c57841033dec1970df81eb9c2ab6b78f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/forge/src/mutation/mod.rs:457-469 | crates/forge/src/mutation/mod.rs:557-565 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d397eadf1159d6120006a224d71cc2bf4192b46e4e26e4a3693e9bca9818b402"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/evm/symbolic/src/runtime/solver/smt/mod.rs:190-200 | crates/evm/symbolic/src/runtime/solver/smt/mod.rs:202-215 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/smt/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49cec0bf96c53a63e740854392cee17ae036482468114087a35fb537c8ef65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/anvil/src/eth/api.rs:2819-2832 | crates/anvil/src/eth/api.rs:2841-2854 | crates/anvil/src/eth/api.rs:2900-2915 | crates/anvil/src/eth/api.rs:3176-3187 | crates/anvil/src/eth/api.rs:3198-3213 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8845c4879f86c5244b2bf3fff42316175dad17c1b74f0a2e3cc56237d7e54ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/anvil/src/eth/backend/fork.rs:283-294 | crates/anvil/src/eth/backend/fork.rs:488-500 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"492cfb68874e29c3c34eb5aa18e499cd13d2459541c47447c2b532c5eb76438c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/forge/src/mutation/visitor.rs:149-161 | crates/forge/src/mutation/visitor.rs:166-187 | crates/forge/src/mutation/visitor.rs:189-209 | crates/forge/src/mutation/visitor.rs:211-232 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/visitor.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aad6ec632f782cc85233af818cf1bee2a6e150a96ebf8fdd093389fb70506f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1072-1084 | crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1145-1157 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"6886d89a5bbea3910892b115f429422eb6f877d7e8d74c5e0138a9ccf738cae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/evm/symbolic/src/runtime/state.rs:1638-1649 | crates/evm/symbolic/src/runtime/state.rs:1740-1747 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d7552d9e6ec175c5345e0e99025bd475ecb0321c4afd6264037a3114f29640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/evm/core/src/edgecov.rs:76-87 | crates/evm/core/src/edgecov.rs:110-127 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/edgecov.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c83f86df5c5f75e106eaa563ba7e75d41a6ffefafc5d6d8a06c8b397fc764a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/anvil/src/eth/api.rs:1301-1311 | crates/anvil/src/eth/api.rs:1320-1330 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed62984b116bd1391a71a5c50ef178d9439edbeeaf1aa27fd039957abd03cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/common/src/selectors.rs:67-79 | crates/common/src/selectors.rs:86-99 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/selectors.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0530f6974559c7a193c69c1f561109bef5a670b6534eecbd3345d8ae67768f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/lint/src/sol/analysis/exprs.rs:106-115 | crates/lint/src/sol/high/arbitrary_send_eth.rs:951-962 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/exprs.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f8492f245c1a23198194e5051f9c2397dae40881f5c53390c431d260af089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:6059-6070 | crates/anvil/src/eth/backend/mem/mod.rs:6079-6089 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":6059}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12eaf214a7ed2f9b864b3b3c801a6a934291f80928a74f04f405b3b1b66f669"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/evm/core/src/evm/eth.rs:120-132 | crates/evm/core/src/evm/eth.rs:134-146 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/eth.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffeb282581809c221601c2300174ae59dfe7cef5da85350f6b9b2364f79f7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/primitives/src/transaction/request.rs:129-139 | crates/primitives/src/transaction/request.rs:311-321 | crates/primitives/src/transaction/request.rs:335-345 | crates/primitives/src/transaction/request.rs:349-359 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"60da6b49d919b863a0bc059ecd509d810c9731746320272a38781bfab44fb2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/evm/symbolic/src/runtime/state.rs:2727-2738 | crates/evm/symbolic/src/runtime/state.rs:2745-2756 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2727}}}],"partialFingerprints":{"codehealthFindingId/v1":"576f72b9d4f0dbc4cd7238d0bced69f7ca79739d2f6dd0141c21450b57272f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/evm/traces/src/debug/sources.rs:309-317 | crates/evm/traces/src/debug/sources.rs:320-328 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/debug/sources.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c0fc811c2478ce4c3f295eb50764bdb7774957d97e5117651847202bcb410f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/fmt/src/state/sol.rs:856-870 | crates/fmt/src/state/sol.rs:872-889 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a71b2ed8440986735cab1ff8eb6ae942dcdf47a3d8386ec98bda27398fc514b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/lint/src/sol/analysis/exprs.rs:119-128 | crates/lint/src/sol/high/arbitrary_send_eth.rs:877-887 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/exprs.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff08ed784ddf66a9e7b6836fef92c642550791d925aff7e68fbb39177303092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/anvil/server/src/lib.rs:98-111 | crates/common/src/provider/mod.rs:524-534 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/server/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e2220a6bb627ef9548b24b1f84c2d15c15d38ec67d149adcd59366762ab2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/common/src/tempo/session.rs:282-293 | crates/common/src/tempo/session.rs:295-306 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/tempo/session.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8964fe4b19299edb790bb12a72a44f7aa4787576b08951aecf80e38de064a677"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/fmt/src/pp/mod.rs:238-246 | crates/fmt/src/pp/mod.rs:276-287 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/pp/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b752ff0913a4e9277e9f3ab01cae3bebc3ba334ae6f5717b6f42578be0422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/lint/src/sol/high/protected_vars.rs:1001-1012 | crates/lint/src/sol/high/reentrancy.rs:929-937 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/protected_vars.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d11805ea2be8689ab4a711d48bf503a61ff66dd6cee7c351a530dc42445d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:4142-4156 | crates/anvil/src/eth/backend/mem/mod.rs:4208-4227 | crates/anvil/src/eth/backend/mem/mod.rs:8283-8295 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d435f4e4a4a694fcc25e1970d959eb1d5c12e7cbd1b46addeae25c431d8eefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/cast/src/cmd/auth.rs:67-77 | crates/cast/src/cmd/auth.rs:89-98 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/auth.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7188242996a7157ff0cf7bd5a362f378193b0a55f75f7b2c1f4f13a4eb5b2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/cheatcodes/src/json.rs:443-454 | crates/cheatcodes/src/json.rs:456-466 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/json.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ccc64d50b9619eadfd5145edb1c0d775f5670361726d3266a4aef670cfa2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/forge/src/brutalizer/visitor.rs:52-57 | crates/forge/src/brutalizer/visitor.rs:62-68 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/brutalizer/visitor.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ce8cc4879aeb9a2b0c311faf8964e44ccf75f48fe3164191d0f5302b6ec551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/evm/evm/src/executors/showmap.rs:717-733 | crates/evm/evm/src/executors/showmap.rs:739-751 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7847a8a7a7df7bb7e7732c2bbff3d206ba93faa13cc2a13d072977176162352a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/anvil/src/eth/backend/mem/cache.rs:58-70 | crates/anvil/src/eth/backend/mem/cache.rs:75-89 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/cache.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"06943e006b60aad5d17638a53552be3daf3650e0e01980ba2a7cd18bfaea2371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:2691-2702 | crates/anvil/src/eth/backend/mem/mod.rs:2707-2718 | crates/anvil/src/eth/backend/mem/mod.rs:2723-2737 | crates/anvil/src/eth/backend/mem/mod.rs:2742-2756 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d60bf51f5a27093ead767ec78bc8f8e846ee59cf351f2aacd17bb68855fb77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/config/src/inline/mod.rs:128-141 | crates/config/src/inline/mod.rs:149-159 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/inline/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"887a13db1921564ed69368da9a22c605bb2e49f6c483cbf64b6ac4d6e5782bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/evm/symbolic/src/runtime/memory.rs:146-155 | crates/evm/symbolic/src/runtime/memory.rs:169-179 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa39c8fbee1bb1a2056850c48e211ef3bb9fb9abb77a91b3724b3130dd634c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/forge/src/cmd/inspect.rs:441-461 | crates/forge/src/cmd/inspect.rs:463-482 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c873a24eb3adc3f036d59057faa9d910ef1079e228723101fac762813ad70f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cli/src/opts/rpc.rs:89-96 | crates/cli/src/opts/rpc_common.rs:87-94 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/rpc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c28d9ed7843124cb901204ca190107582a90464cf66c85c416910ba799310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/common/src/fs.rs:91-97 | crates/common/src/fs.rs:121-126 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/fs.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a047911a989d01a4e5dfd666d028f37eaf6420f258b75fda39da35a1f670a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/evm/symbolic/src/runtime/expr/bool.rs:656-664 | crates/evm/symbolic/src/runtime/expr/expr.rs:1328-1336 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5ddd4aa985534372c82d51ddebf320f71295ba7670cf43ef353a9fdfb57b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/lint/src/sol/low/missing_events_arithmetic.rs:169-179 | crates/lint/src/sol/low/missing_events_arithmetic.rs:390-401 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/missing_events_arithmetic.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad304cfa61edf2481aa441cb5da49ff5a45e2d9d4ad19c54957d67206d98ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cli/src/opts/rpc.rs:201-210 | crates/verify/src/verify.rs:1026-1033 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/rpc.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e196e17de851c899b13aaea307b84e750bc277831788d4b441f325bd89ff408"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/script/src/simulate.rs:97-110 | crates/script/src/simulate.rs:119-131 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/simulate.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"800840713ee9fa3da715e445b5f0aa2565d01f5b302d063bb1128d23c0174934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/anvil/core/src/eth/serde_helpers.rs:42-51 | crates/common/src/serde_helpers.rs:135-144 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/core/src/eth/serde_helpers.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c269966500e9688f361deb2f810d36b452adb8d27fb5830bc9db1b6609e24bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/anvil/src/eth/backend/fork.rs:703-713 | crates/anvil/src/eth/backend/fork.rs:740-754 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4deac0cbc1641b31458fa4f68c353437502f8d4df10e5aac345a8b1741167e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/cast/src/cmd/send.rs:717-722 | crates/cast/src/cmd/send.rs:735-740 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/send.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca8ea5c9d3b015d68b25704135b307abf694a3ce9f0c05318c11f80c036e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/cli/src/opts/build/utils.rs:252-263 | crates/config/src/lib.rs:3629-3637 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/build/utils.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a7a9a7b24283de6ed8e91cf89af8500a35631f2cd5e33736f740805d15294d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/anvil/src/args.rs:7-20 | crates/cast/src/args.rs:109-120 | crates/chisel/src/args.rs:31-42 | crates/forge/src/args.rs:13-25 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/args.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316ee68cc365ef422093a621337e1675a20069321980b9ae3b3963399bd30b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/evm/symbolic/src/runtime/expr/expr.rs:2502-2509 | crates/evm/symbolic/src/runtime/expr/expr.rs:2517-2530 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"831c7ebe0e04b9c69f30d0f342ef74cb6302252bb1d85c71f6514b0b1765ed8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/lint/src/sol/low/block_timestamp.rs:108-115 | crates/lint/src/sol/med/div_mul.rs:251-259 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/block_timestamp.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa57ab762a8c4499fcf0ce12312814c13e145a83a41601e42489e608b61801b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): crates/evm/core/src/fork/multi.rs:200-206 | crates/evm/core/src/fork/multi.rs:211-217 | crates/evm/core/src/fork/multi.rs:225-231 | crates/evm/core/src/fork/multi.rs:239-246 | crates/evm/core/src/fork/multi.rs:251-256 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"025012ec19b3cd0c3845f317ee4a2dc9b150c51d5c849ed7f0ca6d4397894681"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/evm/evm/src/executors/showmap.rs:806-816 | crates/forge/src/cmd/fuzz.rs:1354-1366 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c127be74fa4c14e7472efe12390ccd9fe0414a08022c44f3f01dce6b7d8e444d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/forge/src/mutation/mutators/mod.rs:52-59 | crates/forge/src/mutation/mutators/mod.rs:62-71 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/mutators/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"262e554b1625b611af7caa4e47f81c8cef9345812bf98206224ff698b4a8300e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/script/src/verify.rs:405-410 | crates/script/src/verify/external.rs:740-748 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e9bf12e79b6715a9b5fa3165ee442a0a6c540560828f4511b2de8d9e5c7a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/anvil/src/eth/backend/mem/monad.rs:640-649 | crates/anvil/src/eth/backend/mem/monad.rs:691-700 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/monad.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dd089e53c353444c37052a05ad698b0734a7cc16d3d41870e98c0a52a87df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/cheatcodes/src/crypto.rs:472-483 | crates/common/src/tempo/configurable_account.rs:625-636 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/crypto.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"455d3a8620b37f4f4d70a9e780871f4addbf1e710a8d7760799b7b85a0a9067f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/lint/src/sol/high/function_selector_collision.rs:193-201 | crates/lint/src/sol/med/ecrecover.rs:889-897 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd32fc4d3826151683a01ab48d8ce700c391a9136071c5df3f6fee058d7d64f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/lint/src/sol/low/deprecated_oz_function.rs:22-32 | crates/lint/src/sol/low/solmate_safe_transfer_lib.rs:19-29 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/deprecated_oz_function.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38c11ef830b96acc056240e68f27ce8a62122d6dcd519012ad4fb10420c3e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/cast/src/cmd/call.rs:947-966 | crates/cast/src/cmd/run.rs:1144-1161 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea9a0c0d09208edf04e10f92ee97fe7482bc4681e1e2a1443c4f2de998db02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/anvil/src/eth/backend/mem/mod.rs:2498-2507 | crates/anvil/src/eth/backend/mem/mod.rs:4039-4049 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d50a103d4c2e90496043fcdf3aa290939a891032a3fd406eff653c11c1a3c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/chisel/src/session.rs:285-293 | crates/chisel/src/session.rs:328-335 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/session.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"589eae26b3b9fdbdb7d9868781f6f24ee0168e4ea4f3c37388087110454fec7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/cli/src/utils/mod.rs:414-424 | crates/cli/src/utils/mod.rs:431-441 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d520a1a34090444dabb57b05211843068abe7f81a99bf6ab024e73e5a11d944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/forge/src/mutation/mutators/binary_op_mutator.rs:130-134 | crates/forge/src/mutation/mutators/require_mutator.rs:130-134 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/mutators/binary_op_mutator.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d6c88ac42bff75ec1e103bf57d2cb96aa5ba8924f0789a8f3ac7ea0a5d8c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/lint/src/sol/high/arbitrary_send_erc20.rs:174-176 | crates/lint/src/sol/high/reentrancy.rs:1655-1657 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b14f9a8a1f6e59ce4cd931bef69d1acafab2c390ac024c6bf4265ee47b2aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/test-utils/src/lib.rs:61-70 | crates/cli/src/utils/mod.rs:121-128 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d083215aca0a21fd332b8f8b6f50a7b4417188b7c9ce3b3e396c26c9bc8ef4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/lint/src/sol/gas/cache_array_length.rs:142-149 | crates/lint/src/sol/high/arbitrary_send_eth.rs:986-993 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/cache_array_length.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d63ed5ae632d98af4925d8c3ea18f1ff877e042aaf0030a19b4d1490f03984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/cast/src/cmd/tip20/mine.rs:235-240 | crates/forge/src/runner.rs:6191-6196 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/tip20/mine.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0336aa2bbfa2a4a59e0851a62d109334b84e144523cbd1fb45905af485892143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/config/src/endpoints.rs:167-172 | crates/config/src/etherscan.rs:430-435 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/endpoints.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b99f7fee8c2a879e532a195b416051266a6b8df2f840568e1a3f8fa92d1c190"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/lint/src/sol/high/arbitrary_send_eth.rs:965-973 | crates/lint/src/sol/high/controlled_delegatecall.rs:418-429 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_eth.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"717d2caa7b49d625202dfc338125986c5f70c649d416d74e30ddb970c540b8bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/cast/src/cmd/mod.rs:73-79 | crates/cli/src/json.rs:189-196 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4401088bd4385bfd0ac351839fc2b8e02fccdac4f76d8f4440b16d6a53b191c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/evm/traces/src/folded_stack_trace.rs:213-219 | crates/evm/traces/src/speedscope/builder.rs:123-132 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/folded_stack_trace.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37cef19f534d32c0aba680bdc495b4f942ef1fa03fafb39442d773ecbbff782"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/lint/src/sol/analysis/exprs.rs:80-83 | crates/lint/src/sol/high/enumerable_loop_removal.rs:380-383 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/exprs.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e2a373f573b79cf45193cb6fa24bd70e099a1552ba6b33de8d3103c3913cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/lint/src/sol/high/unprotected_initializer.rs:188-194 | crates/lint/src/sol/low/require_revert_in_loop.rs:40-46 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/unprotected_initializer.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd5f238b0fe1bbf715be55663a173612d2c419afcb9ff9fde4c16e0dbe76ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/anvil/src/eth/backend/db.rs:655-660 | crates/evm/core/src/evm/db.rs:313-318 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/db.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"080bb073a2ece03551ac1da4b3d7472df07043ecddb7231b53a51e0c809bfdd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/common/src/provider/curl_transport.rs:128-134 | crates/common/src/provider/runtime_transport.rs:511-520 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/curl_transport.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a045eccf4cec072461af96107dea77f5f8c1286b8c5a249fffc698eb631cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/lint/src/sol/analysis/exprs.rs:94-98 | crates/lint/src/sol/high/arbitrary_send_eth.rs:981-984 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/exprs.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"51258b90d19e36d4cd416ccb048358248e18ab4f4b468f7803db8843903e1e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/forge/src/brutalizer/transform.rs:24-28 | crates/forge/src/mutation/mutators/unary_op_mutator.rs:141-145 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/brutalizer/transform.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24c8d0f21a267d8bd0e029672c91ef924e5924147e77dded77cfd538952251c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/lint/src/sol/high/arbitrary_send_erc20.rs:298-301 | crates/lint/src/sol/high/arbitrary_send_eth.rs:185-188 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b5bab3d6ac0fa9ee3dbccd158a1cc98d2868fb49c9a7a9a2300edb9fcc0de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/verify/src/etherscan/mod.rs:543-545 | crates/verify/src/sourcify.rs:125-127 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/etherscan/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f69dc3d5b1747ecc6ba07bde00a4d8c645ddc86e210de437c932d17f6203aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs:190-193 | crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs:313-316 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cfdc978f59e2dea3d5a17de8375d72706c7701137a8059c77c4fd6c6dbf830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/anvil/rpc/src/request.rs:107-113 | crates/config/src/endpoints.rs:80-85 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/rpc/src/request.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f7052c051610a45b6388a3e3f9acb3b16f4183f79d643b52c66b47d0d42c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/config/src/endpoints.rs:138-143 | crates/config/src/etherscan.rs:439-444 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/endpoints.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8661c710b3e0e36259af6cb2672fd354077472e451c755ba81ff6e3da548d20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/lint/src/sol/analysis/exprs.rs:75-77 | crates/lint/src/sol/high/encode_packed_collision.rs:39-41 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/exprs.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a2632e383bff6a6dfed655d5f81e030678a04448db6c82d8bf4c5b3961d5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/verify/src/etherscan/mod.rs:73-76 | crates/verify/src/sourcify.rs:45-48 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/etherscan/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"43de88b167f4ce18486e69c2ebc5c01511856daca716c231833e5e2435eb3298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/config/src/endpoints.rs:129-134 | crates/config/src/etherscan.rs:409-414 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/endpoints.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"58961b422a106840e6da8d3f141570eabe53d7d5e977153aad87b79d809d633d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/forge/src/brutalizer/mod.rs:95-99 | crates/forge/src/cmd/fuzz.rs:895-899 | crates/forge/src/cmd/inspect.rs:878-880 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/brutalizer/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2058b82ea92fd5d7e69c308e574c5934069ad36d5f90b805a72f7f5ba7c9448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): crates/script/src/simulate.rs:240-262 | crates/script/src/simulate/monad.rs:200-219 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/script/src/simulate.rs:240\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":"crates/script/src/simulate.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0f3cf24c6cbb96c76bfebdeea840695ec74bb6cbdb6622e18c1efeba1fc2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/evm/symbolic/src/executor/run.rs:231-251 | crates/evm/symbolic/src/executor/run.rs:264-284 \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":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ffc68da7105047e493bcd061d4846d325b9567cd1110234742c5d8a8cf76e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/cli/src/install.rs:538-557 | crates/cli/src/install.rs:659-675 \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":"crates/cli/src/install.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"81001efffe378abcb1399cbe3b08a074a261ff46b6d9ca9f5d4775faf6eb0075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/cheatcodes/src/inspector.rs:2391-2409 | crates/cheatcodes/src/inspector.rs:2824-2842 \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 \u0060crates/cheatcodes/src/inspector.rs:2391\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":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"089c39444e4dbd59805ac31a5914d8f7f608eef8c0a6054edb8f00a937d197a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/fmt/src/state/mod.rs:1045-1063 | crates/fmt/src/state/mod.rs:1079-1097 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5b04846752aea8048ebc4859eb30fa8b6460c949a3049e4ba8ba261b6fa5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/forge/src/cmd/fuzz.rs:334-352 | crates/forge/src/cmd/fuzz.rs:613-629 \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 \u0060crates/forge/src/cmd/fuzz.rs:334\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":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef97906e48cb5d52d05ea60d1c1c4935142eb61f9eae69147cab064ef5e085b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/script/src/simulate.rs:268-286 | crates/script/src/simulate/monad.rs:224-241 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/script/src/simulate.rs:268\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":"crates/script/src/simulate.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"742fd324ac532f8e1d2e3a6e4ead1fbaf180811fa5ae4d492c658bd2c9c521bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): crates/lint/src/sol/info/internal_function_used_once.rs:28-44 | crates/lint/src/sol/info/missing_inheritance.rs:21-36 | crates/lint/src/sol/info/unused_error.rs:23-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/info/internal_function_used_once.rs:28\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. 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":"crates/lint/src/sol/info/internal_function_used_once.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1915c67cc717d0489e9899d6c2489354403bc3666768da5609cfc5b5774141c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/forge/src/cmd/create.rs:358-375 | crates/forge/src/cmd/create.rs:377-394 \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 \u0060crates/forge/src/cmd/create.rs:358\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/create.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd33e947e38d2acb5692ce6647d9575d05324405a0768ba2a363255f75f23165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/evm/evm/src/inspectors/stack.rs:2149-2165 | crates/evm/evm/src/inspectors/stack.rs:2366-2382 \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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f6c5209443f43e4c7c0a2f1f69d0631240c8238834d4a84c9a54a3b6430879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/evm/symbolic/src/abi.rs:492-508 | crates/evm/symbolic/src/abi.rs:520-536 \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 \u0060crates/evm/symbolic/src/abi.rs:492\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"214b78b569a61e85f14b4cdc1a5a9d2108dfa4afa07b40cf308f0c0e67a9b7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:405-421 | crates/lint/src/sol/high/arbitrary_send_eth.rs:217-233 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:405\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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace0147c1548d0389361f9d0e41221eb44b3870e4042e4bb4c3246fc0e7e1221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/anvil/src/eth/backend/mem/fork_db.rs:242-256 | crates/anvil/src/eth/backend/mem/in_memory_db.rs:610-625 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/anvil/src/eth/backend/mem/fork_db.rs:242\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":"crates/anvil/src/eth/backend/mem/fork_db.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ced5d7d61d68a65dbc89f6d649f23aba41681ec263044498f6228a48ad83452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/linking/src/lib.rs:679-694 | crates/linking/src/lib.rs:754-769 \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 \u0060crates/linking/src/lib.rs:679\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":"crates/linking/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2b2e8b79cde97169da5c6bf0b9b9de447a281668b0cb90ee1f8ef76c929522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/anvil/src/eth/backend/mem/mod.rs:7308-7322 | crates/anvil/src/eth/backend/mem/mod.rs:7345-7359 | crates/anvil/src/eth/backend/mem/mod.rs:7385-7399 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7308}}}],"partialFingerprints":{"codehealthFindingId/v1":"01938d14df4c90cfc86fe99bc362609d02a1fd15235e8d38f66f345f60fcca8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/config/src/providers/warnings.rs:346-359 | crates/config/src/providers/warnings.rs:386-400 \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 \u0060crates/config/src/providers/warnings.rs:346\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/config/src/providers/warnings.rs:385\u0060 calls \u0060keys\u0060, \u0060cloned\u0060, \u0060collect\u0060 and \u0060crates/config/src/providers/warnings.rs:345\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/warnings.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff296bcb5d05d7e61c7cf37ee6ecebb03b748c725b8fc7c035a8b47bfda7b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/evm/symbolic/src/executor/calls.rs:80-94 | crates/evm/symbolic/src/executor/calls.rs:100-114 \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 \u0060crates/evm/symbolic/src/executor/calls.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9f3b0faa92d1a5c66493fa5b21bcedb6c295d1660ecfa6825d8a0a44cdaeaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/evm/symbolic/src/executor/calls.rs:274-287 | crates/evm/symbolic/src/executor/calls.rs:473-487 \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 \u0060crates/evm/symbolic/src/executor/calls.rs:274\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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f36b6ed879b6129bbcfd741da3ed28130e202bbd505cf828f0a264a537f88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): crates/anvil/src/eth/backend/mem/mod.rs:4483-4495 | crates/anvil/src/eth/backend/mem/mod.rs:7254-7267 | crates/anvil/src/eth/backend/mem/mod.rs:8043-8055 | crates/anvil/src/eth/backend/mem/mod.rs:8408-8420 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/anvil/src/eth/backend/mem/mod.rs:4483\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060block\u0060 to \u0060BlockNumber\u0060 in one and \u0060\u0026Block\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ec08bfd770df658db704c3115b0177c4ec604c14224d497a6bf5c845c69dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:4862-4875 | crates/anvil/src/eth/backend/mem/mod.rs:5089-5102 \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 \u0060crates/anvil/src/eth/backend/mem/mod.rs:4862\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4862}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a068ac849c523a24c6d97a625a4b2be9328fa3a9128c22afc9028eaa8be4f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/config/src/providers/warnings.rs:300-313 | crates/config/src/providers/warnings.rs:380-393 \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 \u0060crates/config/src/providers/warnings.rs:300\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/warnings.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d47f964ed87759d45b939a80fa9ad21f7be302546964e48bea7bb02d2e4fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:697-710 | crates/lint/src/sol/high/arbitrary_send_eth.rs:392-405 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:697\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d94705142724345984cdb2ab174cd0c91ce0ff174e44504252a62f5dbc5a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/cheatcodes/src/inspector.rs:3498-3510 | crates/cheatcodes/src/inspector.rs:3522-3533 \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 \u0060crates/cheatcodes/src/inspector.rs:3498\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/cheatcodes/src/inspector.rs:3521\u0060 calls \u0060stack\u0060, \u0060peek\u0060 and \u0060crates/cheatcodes/src/inspector.rs:3496\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":3498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb731db594a8b88abfaad219bd788f6b9476d4c07d39c597057ea5e92b5150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/common/src/provider/mod.rs:409-421 | crates/common/src/provider/mod.rs:480-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/common/src/provider/mod.rs:493\u0060 calls \u0060default\u0060, \u0060connect_provider\u0060 and \u0060crates/common/src/provider/mod.rs:423\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9d6f0b5e675b98801044f954873bb816eebc6a5845aa0f15138ded0e12ae13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201313 lines \u00D7 3): crates/evm/symbolic/src/executor/cheatcodes.rs:2646-2658 | crates/evm/symbolic/src/executor/cheatcodes.rs:2667-2668 | crates/evm/symbolic/src/executor/cheatcodes.rs:2670-2682 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/cheatcodes.rs:2646\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/cheatcodes.rs:2659\u0060 calls \u0060read_abi_word_arg\u0060 and \u0060crates/evm/symbolic/src/executor/cheatcodes.rs:2669\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aecb20393d8a5c3e4cd3f60293493a7ac22b294c0372c4c5893980503085385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/evm/symbolic/src/executor/invariant.rs:150-161 | crates/evm/symbolic/src/executor/invariant.rs:185-197 \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 \u0060crates/evm/symbolic/src/executor/invariant.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/invariant.rs:198\u0060 calls \u0060push\u0060 and \u0060crates/evm/symbolic/src/executor/invariant.rs:162\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/invariant.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9667c0a51f62356e61651b7b1078e7ba21dc39492aa0a94ddaf7159c01a975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1891-1903 | crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1920-1932 \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 \u0060crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:1891\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":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b171763e9628bd1e28c62921736821fc1646e7f0d3ba96c91a43967d93b21e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/forge/src/runner.rs:2148-2160 | crates/forge/src/runner.rs:2301-2312 \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 \u0060crates/forge/src/runner.rs:2148\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":"crates/forge/src/runner.rs"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c48bedb1c1e3d590b1f33a5fbdc4498ff9ceb03bb6d51e9e75a558c8785044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/linking/src/lib.rs:884-897 | crates/linking/src/lib.rs:981-994 \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 \u0060crates/linking/src/lib.rs:884\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/linking/src/lib.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"9626d5c46ed47a85e15740ff456ec6b0e4b0e8d25c1eed1a8cbe3542072714c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/script/src/execute.rs:408-420 | crates/script/src/execute.rs:561-573 \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 \u0060crates/script/src/execute.rs:408\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":"crates/script/src/execute.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"004fb3f97d02e8802e861f6c37588e657fb8d20cf991873d4c0f510cfcf1a160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:6311-6321 | crates/anvil/src/eth/backend/mem/mod.rs:6863-6874 \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 \u0060crates/anvil/src/eth/backend/mem/mod.rs:6311\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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":6311}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ac100de971035d5037135c9e09a48882a66fa391402d9fc6ba49e41ea99f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cast/src/cmd/mktx.rs:142-153 | crates/cast/src/cmd/send.rs:152-163 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cast/src/cmd/mktx.rs:142\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"da022fc0285b2aa435c100b52c3cfe9ba56135a8abc18a1335f1bd2d41d12b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/cheatcodes/src/fs.rs:84-95 | crates/cheatcodes/src/fs.rs:97-106 \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 \u0060crates/cheatcodes/src/fs.rs:84\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":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b970a8df34fcfc0b6a87176ce709631d7d1012a639516ff1e929cec11343cee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/evm/evm/src/inspectors/stack.rs:2336-2348 | crates/evm/evm/src/inspectors/stack.rs:2480-2492 \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 \u0060crates/evm/evm/src/inspectors/stack.rs:2336\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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"915d1d58830ba48f69021eedec146125f7f941365b701ed690904ac32dd2ba38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/evm/symbolic/src/executor/calls.rs:46-57 | crates/evm/symbolic/src/executor/opcodes.rs:1282-1292 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f065c906882f21d053a2178051257416dc8d44724423827497427073a9a596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/evm/symbolic/src/executor/calls.rs:510-521 | crates/evm/symbolic/src/executor/calls.rs:524-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/calls.rs:510\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":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de04205c78087df9f6337bc07ace0ec3f273f4a787c31b60eed076b9594b6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/evm/symbolic/src/runtime/memory.rs:730-741 | crates/evm/symbolic/src/runtime/memory.rs:755-766 \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":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcd71c2e1b6c176645baee2d4cc37f6ec006a2a19f7977f0784907b210a30ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/forge/src/mutation/mutators/unary_op_mutator.rs:65-76 | crates/forge/src/mutation/mutators/unary_op_mutator.rs:86-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/forge/src/mutation/mutators/unary_op_mutator.rs:65\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/forge/src/mutation/mutators/unary_op_mutator.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1d7ab5a0fdf337c8ffba5bc469a2bebbb8a3cfd3652e65fac1e313183c776f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:557-569 | crates/lint/src/sol/high/arbitrary_send_eth.rs:282-294 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:557\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:584\u0060 calls \u0060push\u0060, \u0060clone\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs:295\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5324b78acaf97c9cfff0609cfcf40e39b93e8464b94c223973d280245577bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/verify/src/bytecode.rs:594-605 | crates/verify/src/bytecode.rs:936-950 \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 \u0060crates/verify/src/bytecode.rs:594\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":"crates/verify/src/bytecode.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"8661dbec6ee09ef0a4c68812a6833b2706b2b9eab86dcce63b7bb51eb4e1d49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/anvil/src/eth/api.rs:3605-3615 | crates/anvil/src/eth/api.rs:5092-5102 \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 \u0060crates/anvil/src/eth/api.rs:3605\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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c87ec682d561cb44e78fa983dab28e3df4b8efadcc5192768093bbd308058c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cast/src/cmd/access_list.rs:72-84 | crates/cast/src/cmd/estimate.rs:99-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/access_list.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7132123ab6d53a4a9a2e2a1de8695706108170207d87deae968175f4fea42e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/evm/symbolic/src/executor/opcodes.rs:776-786 | crates/evm/symbolic/src/executor/opcodes.rs:878-888 \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 \u0060crates/evm/symbolic/src/executor/opcodes.rs:776\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ebad433743457ae160246fa5a6a26dd8c1c6fbd6183ebd0e079af2538a4a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/anvil/src/eth/backend/mem/in_memory_db.rs:107-117 | crates/anvil/src/eth/backend/mem/state.rs:39-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/anvil/src/eth/backend/mem/in_memory_db.rs:107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn record_changes(\u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"54089b2eaf25c6207aa40bfdf2c20b6328e9f541fd07f24d389ad5d470e34eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:4318-4327 | crates/anvil/src/eth/backend/mem/mod.rs:9323-9332 \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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e17b94d12445441c8d919861b61c029cf0f05dcb78f36a66ffe84946090959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:4409-4418 | crates/anvil/src/eth/backend/mem/mod.rs:7876-7885 \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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66b57cee421cd73304041fa71f10c170362d607af0e4d0a1dd601f2fd34297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:7457-7466 | crates/anvil/src/eth/backend/mem/mod.rs:7551-7559 \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 \u0060crates/anvil/src/eth/backend/mem/mod.rs:7457\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/anvil/src/eth/backend/mem/mod.rs:7455\u0060 calls \u0060Ok\u0060 and \u0060crates/anvil/src/eth/backend/mem/mod.rs:7549\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe00bf40fa32c755b24afdc94f5703ec4c91f939a26148f31809ed1523e2c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:7835-7844 | crates/anvil/src/eth/backend/mem/mod.rs:7999-8008 \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 \u0060crates/anvil/src/eth/backend/mem/mod.rs:7835\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":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7835}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb3389c30af19f721c6e42a4bb64d038b05c865b23a3dafa5588fc591c45648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cast/src/cmd/erc4626.rs:984-993 | crates/cast/src/cmd/erc4626.rs:1063-1072 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/cast/src/cmd/erc4626.rs:1075\u0060 calls \u0060wrap_err\u0060 and \u0060crates/cast/src/cmd/erc4626.rs:996\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/erc4626.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e69d31a5b277c05276df76adb4977491c1a4e2f1126c83dba2114140f1d99c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/chisel/src/executor.rs:438-447 | crates/chisel/src/executor.rs:456-463 \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 \u0060crates/chisel/src/executor.rs:438\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":"crates/chisel/src/executor.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"015e1855cd366c0b7b3cdc1f589435293a793268e9294314030a342b29ebb8c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/common/src/tempo/configurable_account.rs:491-499 | crates/common/src/tempo/configurable_account.rs:789-798 \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 \u0060crates/common/src/tempo/configurable_account.rs:491\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":"crates/common/src/tempo/configurable_account.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cd3ac915173ab61c37d2ea5236ca34c010d60fa035b56bd4b2c193b8178e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/evm/core/src/opts.rs:372-381 | crates/evm/core/src/opts.rs:665-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/opts.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30318219188dbc74d7a4d4cb428447c43c53a60ad4de714c9f71292843cb83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/evm/symbolic/src/executor/cheatcodes.rs:128-137 | crates/evm/symbolic/src/executor/cheatcodes.rs:149-158 \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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aa25e41d67775c185b0ce74cda050701d04c99f525dae363dea459a70ca836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/evm/symbolic/src/executor/opcodes.rs:1155-1163 | crates/evm/symbolic/src/executor/opcodes.rs:1174-1183 \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 \u0060crates/evm/symbolic/src/executor/opcodes.rs:1155\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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"da410913a70b9f5178f12d8bdf9e0a94e685ea4dd1a0bc8199c23d4f600834d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:592-601 | crates/evm/symbolic/src/runtime/expr/expr.rs:674-683 \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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eeb3ae606c3aeefc1f4acdba67e33f97e0cbc7503161cd6bba5ce02f0bdf7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:85-97 | crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:1003-1015 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:98\u0060 calls \u0060default\u0060 and \u0060crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:1016\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/fallback/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c24d29bc757d3a3465f890bf2e05c5d730b32156aa876bdc7336845d3f97cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/linking/src/lib.rs:721-732 | crates/linking/src/lib.rs:816-827 \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 \u0060crates/linking/src/lib.rs:721\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/linking/src/lib.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aa6d5c120a040396ccc3a9c4a04f5a1a3ff4f05788c22df26e18bfe457e578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:541-552 | crates/lint/src/sol/high/arbitrary_send_eth.rs:266-277 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:541\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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d83f3c202b861e3e13451b297e5fd971fa0c4652acdd1d0d4776d563847cddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:607-616 | crates/lint/src/sol/high/arbitrary_send_eth.rs:314-323 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:607\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba3988aff3af6d2e603bbb63bc57e226d78ae02d5b8dba32046a0b6e383f2c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:651-660 | crates/lint/src/sol/high/arbitrary_send_eth.rs:356-365 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:651\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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ae9734c9acaa14b8db3ecdf95ffb42086a7dc4ebc16ca724a3130934c18781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/anvil/src/eth/api.rs:1905-1913 | crates/anvil/src/eth/api.rs:3436-3444 \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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9aaf8c18deb6aec117e0ae0438112aac0428f2dbd8728b7aa04923c3f182fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/cast/src/cmd/batch_mktx.rs:154-161 | crates/cast/src/cmd/mktx.rs:386-394 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cast/src/cmd/batch_mktx.rs:154\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. 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":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a6205b791c165483a5de7b7d901ecc04ae472118940d798e42905148a2a3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cast/src/tempo.rs:329-337 | crates/cast/src/tempo.rs:367-375 \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":"crates/cast/src/tempo.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4575fe1e22bf9f52edba3863603ccb9814f1e9dec052065b49e4a70ffa95bb64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/core/src/opts.rs:296-304 | crates/evm/core/src/opts.rs:308-316 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/opts.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa2c12a51b04ba1f12c860c7eb7361091939a09b12c8d3f8d935d92da0907c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/symbolic/src/executor/calls.rs:2616-2624 | crates/evm/symbolic/src/executor/calls.rs:2636-2644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3988bcb14118fac5ddb94d4be288e4bc1cfdc84e8ac22528257c9277f667e827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:1451-1459 | crates/evm/symbolic/src/runtime/expr/expr.rs:1471-1479 \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 \u0060crates/evm/symbolic/src/runtime/expr/expr.rs:1451\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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"800a9069ee05bedc2fb4dc229d210b01fdbef4fd18a8521f5bca0dafdce92c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/forge/src/cmd/eip712.rs:81-89 | crates/forge/src/cmd/inspect.rs:533-541 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/forge/src/cmd/eip712.rs:81\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/eip712.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c14a74aa9e113fc5bdb95c6d1a38816d3d33be9887ea1cdb4929b37f372dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 5): crates/evm/symbolic/src/executor/create.rs:19-25 | crates/evm/symbolic/src/executor/opcodes.rs:758-765 | crates/evm/symbolic/src/executor/opcodes.rs:814-821 | crates/evm/symbolic/src/executor/opcodes.rs:867-874 | crates/evm/symbolic/src/executor/opcodes.rs:1287-1294 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/opcodes.rs:766\u0060 calls \u0060pop\u0060 and \u0060crates/evm/symbolic/src/executor/opcodes.rs:822\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a11060b950a0d9868c012195ac27866916cb10967a182e372ac03bb9982114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/evm/symbolic/src/runtime/expr/expr.rs:508-515 | crates/evm/symbolic/src/runtime/expr/expr.rs:695-702 | crates/evm/symbolic/src/runtime/expr/expr.rs:714-721 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b8c17c2189d87df98044e865f5fb47d067416e8a4a08ab55e787177f4db881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/lint/src/sol/high/arbitrary_send_erc20.rs:403-410 | crates/lint/src/sol/high/arbitrary_send_eth.rs:215-222 | crates/lint/src/sol/high/controlled_delegatecall.rs:181-188 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060pred\u0060 to \u0060\u0026Expr\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027gcx Expr\u003C\u0027gcx\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"178713b7d56df1f2b1938c2270a13cbe318d468435df3e2df721209ed4b4bd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/anvil/src/eth/api.rs:3619-3626 | crates/anvil/src/eth/api.rs:3849-3856 \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 \u0060crates/anvil/src/eth/api.rs:3619\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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2bd94faf3b752fbf774a28b25406a967904b8a7c1f1754a740f011aeac7402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:7479-7486 | crates/anvil/src/eth/backend/mem/mod.rs:7579-7586 \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 \u0060crates/anvil/src/eth/backend/mem/mod.rs:7479\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":7479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba31ac9c253129dbca2e35168a6b9f5de36c605dc45d161010e010bc302cc629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/common/src/preprocessor/deps.rs:429-436 | crates/common/src/preprocessor/deps.rs:458-465 \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":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7dc3887067e1d74c119faf9a08edb829da6562e3b9694d004dd5927d35af11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/doc/src/hir_ext.rs:913-928 | crates/doc/src/hir_ext.rs:935-950 \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 \u0060crates/doc/src/hir_ext.rs:913\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":"crates/doc/src/hir_ext.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d6ec8ccaa826aeadedaac2e22d461e39c71e4398fe3c75f3379ffcb599b711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/evm/src/inspectors/stack.rs:2201-2208 | crates/evm/evm/src/inspectors/stack.rs:2388-2395 \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 \u0060crates/evm/evm/src/inspectors/stack.rs:2201\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":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3868042350269db74db397f67e2ba644ecaffb99bc53411f7ccde9cc0c21198c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/executor/cheatcodes.rs:2520-2528 | crates/evm/symbolic/src/executor/cheatcodes.rs:2552-2559 \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 \u0060crates/evm/symbolic/src/executor/cheatcodes.rs:2520\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e27579674b1e9c9e8386c79854c033309a059f99486a5e939da309f6e84060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/executor/equivalence.rs:202-209 | crates/evm/symbolic/src/executor/equivalence.rs:217-224 \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 \u0060crates/evm/symbolic/src/executor/equivalence.rs:202\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/equivalence.rs:225\u0060 calls \u0060check_timeout\u0060 and \u0060crates/evm/symbolic/src/executor/equivalence.rs:210\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/equivalence.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"739ab6155b9f90511cd613dcf8d4c06f37f817ad9200316264f6bec99d5cb94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/executor/opcodes.rs:973-980 | crates/evm/symbolic/src/executor/opcodes.rs:985-992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"332a5e7528ef4dcb0648f83c221c88cca2e57b9c41eb3f976c4c1ba1ca3601ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/bool.rs:657-664 | crates/evm/symbolic/src/runtime/expr/expr.rs:1329-1336 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"3455101bf09e4c6b3dea075c9cd7e3374a5aee6b221296927b9a80403f47f9e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:525-532 | crates/evm/symbolic/src/runtime/expr/expr.rs:577-584 \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 \u0060crates/evm/symbolic/src/runtime/expr/expr.rs:525\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91eab43bb1d12029a225625eead2a9bfe2e609e8888c9b4dcbf807167027e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:1831-1838 | crates/evm/symbolic/src/runtime/expr/expr.rs:1847-1854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"966ea8f137008ddc882da5a4d1dbdec9772bc790e982d10b657967c7d2b7f0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/runtime/state.rs:724-731 | crates/evm/symbolic/src/runtime/state.rs:732-739 \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 \u0060crates/evm/symbolic/src/runtime/state.rs:724\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":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef232329d6e9881ed991872f621b987ddf8f59793021239124bde8302f8622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fmt/src/state/sol.rs:2255-2262 | crates/fmt/src/state/sol.rs:2366-2374 \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":"crates/fmt/src/state/sol.rs"},"region":{"startLine":2255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20602b1bf6e4527e7beabe96d7a1ffdc19a8129d0d5d4ceb615f15b09b2545f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/forge/src/runner.rs:2183-2190 | crates/forge/src/runner.rs:2336-2343 \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 \u0060crates/forge/src/runner.rs:2183\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":"crates/forge/src/runner.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cad78a5feb1bb52400400c9e7e3553caccd9c08e4873a26687eb26b65c90ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/forge/src/symbolic_minimizer.rs:402-409 | crates/forge/src/symbolic_minimizer.rs:1208-1215 \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 \u0060crates/forge/src/symbolic_minimizer.rs:402\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":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e73b51c95895848f17ea2ac28b5f9eb8fd832363eb75b07b51f4449081cfaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/lint/src/sol/high/reentrancy.rs:1316-1323 | crates/lint/src/sol/high/reentrancy.rs:1385-1392 \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 \u0060crates/lint/src/sol/high/reentrancy.rs:1316\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":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a382c53737b915e9c7fe3fdd7d7684070fde6226cd7c3066c32317f4250a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/script/src/runner.rs:133-140 | crates/script/src/runner.rs:178-185 \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":"crates/script/src/runner.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa631613c88ef4528468e1ab5f0d07d3a7527e7c60159976e53a94dd6069f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/script/src/verify/external.rs:150-157 | crates/script/src/verify/external.rs:203-210 \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 \u0060crates/script/src/verify/external.rs:150\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":"crates/script/src/verify/external.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"54176a6b6283a34fb5cb724e8b0cd0243a712cb400e1c180c11e40ffbd2984b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): crates/evm/symbolic/src/executor/calls.rs:134-140 | crates/evm/symbolic/src/executor/calls.rs:274-278 | crates/evm/symbolic/src/executor/calls.rs:472-478 | crates/evm/symbolic/src/executor/cheatcodes.rs:749-752 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/calls.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e6eb30e0bbb7137b27a5af8b35334716da2a75bafadd995f0e374b00707768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/evm/symbolic/src/executor/opcodes.rs:961-967 | crates/evm/symbolic/src/executor/opcodes.rs:972-978 | crates/evm/symbolic/src/executor/opcodes.rs:984-990 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a5e49f21faee3995cee10491c134ee23edf0ea3f2407dbddf54c4c06007d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cast/src/cmd/batch_mktx.rs:163-169 | crates/cast/src/cmd/mktx.rs:397-403 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cast/src/cmd/batch_mktx.rs:163\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. 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":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b33658b3ae66b60936060ec1dab85cfbd4acd83fed916324beb094beb90ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cast/src/cmd/storage.rs:423-429 | crates/forge/src/cmd/inspect.rs:423-429 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cast/src/cmd/storage.rs:423\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/cast/src/cmd/storage.rs:430\u0060 calls \u0060into\u0060, \u0060to_string\u0060 and \u0060crates/forge/src/cmd/inspect.rs:430\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/storage.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c6b747a45943952106d97e8b168b5c552a48fc0c278751365ebd524e0cc9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/evm/symbolic/src/executor/cheatcodes.rs:430-436 | crates/evm/symbolic/src/executor/create.rs:144-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/create.rs:151\u0060 calls \u0060transfer\u0060 and \u0060crates/evm/symbolic/src/executor/cheatcodes.rs:438\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0953833e5b39b1aa3da522d0f80a51cab701207d3e79896030bc7b089f27a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/symbolic/src/executor/opcodes.rs:903-911 | crates/evm/symbolic/src/executor/opcodes.rs:1279-1287 \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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e32707ecd8882a45dd82102e2b70aba8733eb89a0690b3c46b922b9af0aef8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/forge/src/cmd/equivalence.rs:191-197 | crates/forge/src/cmd/equivalence.rs:209-215 | crates/forge/src/cmd/equivalence.rs:226-233 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/forge/src/cmd/equivalence.rs:191\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":"crates/forge/src/cmd/equivalence.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3867685c33a6fb9dbb29c74cf2fc07166e6393520cd49bf402fa937de9fe92ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/forge/src/mutation/mutators/elim_delegate_mutator.rs:18-24 | crates/forge/src/mutation/mutators/elim_delegate_mutator.rs:44-50 \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 \u0060crates/forge/src/mutation/mutators/elim_delegate_mutator.rs:18\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":"crates/forge/src/mutation/mutators/elim_delegate_mutator.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cd307504b66f21ee67889e3855fa56ec4ebfcf267f000b03ebd4f8a2f86c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:58-64 | crates/lint/src/sol/high/arbitrary_send_eth.rs:54-60 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d395665e5609f73e47609aa624e893cea2463955ff5c6f8dc165fec1eb04f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:592-599 | crates/lint/src/sol/high/arbitrary_send_eth.rs:301-308 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:592\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a601c466fcdd0c1907ce2095fbcad0773eb5177a542f8d7aa547f5704814b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/primitives/src/transaction/envelope.rs:460-466 | crates/primitives/src/transaction/envelope.rs:482-488 \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 \u0060crates/primitives/src/transaction/envelope.rs:460\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":"crates/primitives/src/transaction/envelope.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"8715bd3d5349689968fdcdc044e94c9f5d0a61d6973f54d569937ef0ec0d8d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/evm/symbolic/src/executor/create.rs:19-24 | crates/evm/symbolic/src/executor/opcodes.rs:646-652 | crates/evm/symbolic/src/executor/opcodes.rs:758-764 | crates/evm/symbolic/src/executor/opcodes.rs:814-820 | crates/evm/symbolic/src/executor/opcodes.rs:867-873 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/opcodes.rs:765\u0060 calls \u0060pop\u0060 and \u0060crates/evm/symbolic/src/executor/opcodes.rs:653\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779ed2da43b1557b7321faecd17a763a17e8f56a104c5f6feb949215e2124b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/evm/symbolic/src/executor/opcodes.rs:817-822 | crates/evm/symbolic/src/executor/opcodes.rs:870-875 | crates/evm/symbolic/src/executor/opcodes.rs:914-919 | crates/evm/symbolic/src/executor/opcodes.rs:1290-1295 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/opcodes.rs:817\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6915731a03c5c743d30044274d0388904e18028707c7ffcf825636ed4c7a05d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/evm/symbolic/src/runtime/expr/expr.rs:559-564 | crates/evm/symbolic/src/runtime/expr/expr.rs:747-752 | crates/evm/symbolic/src/runtime/expr/expr.rs:760-765 | crates/evm/symbolic/src/runtime/expr/expr.rs:772-777 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/runtime/expr/expr.rs:754\u0060 calls \u0060Const\u0060, \u0060is_zero\u0060, \u0060zero\u0060 and \u0060crates/evm/symbolic/src/runtime/expr/expr.rs:778\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"680fbdd0f4365603d36a82f729052d9b2b60b9a6d554c100ca8f5db1dc7bbdfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/cast/src/cmd/mktx.rs:310-315 | crates/cast/src/cmd/mktx.rs:337-342 | crates/cast/src/cmd/mktx.rs:391-396 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4383cd834752a4b1bdbda2f339af993af1fba70e52f3b6e40a6324cf99198597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/evm/symbolic/src/runtime/expr/bool.rs:449-454 | crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:155-160 | crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:172-177 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/runtime/expr/bool.rs:449\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/evm/symbolic/src/runtime/solver/fallback/mod.rs:171\u0060 calls \u0060push\u0060 and \u0060crates/evm/symbolic/src/runtime/expr/bool.rs:448\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"81430b1c1b3ddbe36860d5f8e93d8a695ce0291f12a07d17658de4d765788084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/anvil/src/eth/api.rs:1207-1213 | crates/anvil/src/eth/api.rs:3165-3171 \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 \u0060crates/anvil/src/eth/api.rs:1207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9db7fb6fdf159ef45883404bf8594e9ef78aacd5c0899e7d2006904cca9887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/anvil/src/eth/api.rs:3009-3014 | crates/anvil/src/eth/api.rs:3081-3086 \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 \u0060crates/anvil/src/eth/api.rs:3009\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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a0560392a69c2139d62d8ce43e4f194744b79f155045259aab8d1fd2441372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/anvil/src/eth/backend/fork.rs:402-407 | crates/anvil/src/eth/backend/fork.rs:456-463 \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 \u0060crates/anvil/src/eth/backend/fork.rs:402\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c66c881ab591684f6510e298e29e4da8b64f77959159719fee4a1621b6e9fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/anvil/src/pubsub.rs:213-218 | crates/anvil/src/pubsub.rs:228-233 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/pubsub.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"78364ae9d1f92ff0504266c845b9e084daac9833ecf75e2dfc9692546d6c3e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/common/fmt/src/dynamic.rs:190-197 | crates/common/fmt/src/dynamic.rs:201-208 \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 \u0060crates/common/fmt/src/dynamic.rs:190\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/common/fmt/src/dynamic.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03d2ba4086fe5bfb953c75178429c2a01188b7193c9de471c6f947d0c77d941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/abi.rs:392-397 | crates/evm/symbolic/src/abi.rs:415-420 \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 \u0060crates/evm/symbolic/src/abi.rs:392\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":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c72829976f4b550592a9901a61ea146607de55fcce3dbeb2504a2a70595e356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/executor/cheatcodes.rs:378-383 | crates/evm/symbolic/src/executor/create.rs:51-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/cheatcodes.rs:378\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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9679463aa3c1876f165644ed85045cb5b7bf5e836b4630960643e40744de2e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/executor/opcodes.rs:354-359 | crates/evm/symbolic/src/executor/opcodes.rs:465-470 \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 \u0060crates/evm/symbolic/src/executor/opcodes.rs:354\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/opcodes.rs:471\u0060 calls \u0060expand_range\u0060, \u0060clone\u0060 and \u0060crates/evm/symbolic/src/executor/opcodes.rs:360\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa9a4def6f888128d7c463fbb711f6cb85bd5f0a2e73af78eab452246d83b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:531-536 | crates/evm/symbolic/src/runtime/expr/expr.rs:538-543 \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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e05db86cf9670c10153cde96d4046e778fcc5c5666c62a128ac680fa429c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:626-631 | crates/evm/symbolic/src/runtime/expr/expr.rs:656-661 \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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f560d12d956c6b623237fa478dcab907c09197649770e2d8cfe496434b9914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:925-930 | crates/evm/symbolic/src/runtime/expr/expr.rs:932-941 \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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2498de1ecb56e0260a7dd84146c06e0f2bae0513a4788d448109a5930c813c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:1196-1203 | crates/evm/symbolic/src/runtime/expr/expr.rs:1760-1767 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcbeb5423e613fa0c73023b0dd08b0a775f392cf318b0d4b1152859ec69cc8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs:90-95 | crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs:97-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/reasoning/monotonic_product.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccf118da881eda66f70f859e4cb6f864e1b30cbf1cdfeee1b6abcb789d7e232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/traces/src/decoder/mod.rs:1373-1378 | crates/evm/traces/src/decoder/mod.rs:1382-1388 \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":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d978306f77ce1460d9eee33976ecd44173c5e1e06f83d54829d5bd2b1e43cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/forge/src/symbolic_minimizer.rs:549-556 | crates/forge/src/symbolic_minimizer.rs:1181-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/forge/src/symbolic_minimizer.rs:549\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":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"107049a95e73fa675a04dd332b15d97a1f93e389233ca009cbb64460ad0e3e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/linking/src/lib.rs:839-849 | crates/linking/src/lib.rs:909-919 \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":"crates/linking/src/lib.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"3905793c1a70e17938e4260109a583e974173cbf6af8424f60f707738cf3da06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:263-269 | crates/lint/src/sol/high/arbitrary_send_eth.rs:129-135 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:263\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":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f833e66c43ffc8cf2440caa2a642d787c1f35ba951df2be7e76524d7c2d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:585-590 | crates/lint/src/sol/high/arbitrary_send_eth.rs:295-300 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d307f4a8714ce4f672d9b451f641ff371f2d80eca8b6b910394ede99f7b74423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/lint/src/sol/high/arbitrary_send_erc20.rs:658-663 | crates/lint/src/sol/high/arbitrary_send_eth.rs:373-378 \u2014 before extracting anything, compare \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060 and \u0060crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lint/src/sol/high/arbitrary_send_erc20.rs:658\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f2f9c621c3df4e51524d62dc411e3c2e4138710eeda7636bf770f9186b9e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/evm/symbolic/src/executor/create.rs:19-23 | crates/evm/symbolic/src/executor/opcodes.rs:646-651 | crates/evm/symbolic/src/executor/opcodes.rs:758-763 | crates/evm/symbolic/src/executor/opcodes.rs:814-819 | crates/evm/symbolic/src/executor/opcodes.rs:867-872 | crates/evm/symbolic/src/executor/opcodes.rs:1464-1469 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/executor/opcodes.rs:765\u0060 calls \u0060pop\u0060 and \u0060crates/evm/symbolic/src/executor/opcodes.rs:653\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab6fabd329c0d835afb34c05c93f32c0a6368003928b2d7f5347a2213c83cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/evm/symbolic/src/executor/opcodes.rs:644-648 | crates/evm/symbolic/src/executor/opcodes.rs:756-760 | crates/evm/symbolic/src/executor/opcodes.rs:812-816 | crates/evm/symbolic/src/executor/opcodes.rs:865-869 | crates/evm/symbolic/src/executor/opcodes.rs:1323-1327 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/opcodes.rs:644\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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"a742d093458daaca0f83439d4af50e959bc12b8a5939f8e9bb27c972a4ec8f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/evm/symbolic/src/executor/opcodes.rs:764-768 | crates/evm/symbolic/src/executor/opcodes.rs:819-823 | crates/evm/symbolic/src/executor/opcodes.rs:872-876 | crates/evm/symbolic/src/executor/opcodes.rs:916-920 | crates/evm/symbolic/src/executor/opcodes.rs:1292-1296 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/opcodes.rs:764\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/evm/symbolic/src/executor/opcodes.rs:763\u0060 calls \u0060pop\u0060 and \u0060crates/evm/symbolic/src/executor/opcodes.rs:818\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c45f25498694870ce5c4dd29c7c0dd4da57dd40ba4c4e5ad8a6016eeac74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/lint/src/sol/info/internal_function_used_once.rs:34-41 | crates/lint/src/sol/info/missing_inheritance.rs:26-33 | crates/lint/src/sol/info/unused_error.rs:30-37 | crates/lint/src/sol/low/inconsistent_type_names.rs:26-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/lint/src/sol/low/inconsistent_type_names.rs:25\u0060 calls \u0060source_map\u0060 and \u0060crates/lint/src/sol/info/internal_function_used_once.rs:30\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/internal_function_used_once.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17f207bea203b9aab095f7e11d55316833194af3e84a7a7877635ae1e608626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/evm/symbolic/src/executor/opcodes.rs:904-908 | crates/evm/symbolic/src/executor/opcodes.rs:1280-1284 | crates/evm/symbolic/src/executor/opcodes.rs:1462-1466 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/opcodes.rs:904\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":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ca9a9802085507cb0bcac6086eb0c76063d908afdbba0291c78520269fdba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/evm/symbolic/src/runtime/expr/bool.rs:198-202 | crates/evm/symbolic/src/runtime/expr/bool.rs:213-217 | crates/evm/symbolic/src/runtime/expr/bool.rs:258-262 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/symbolic/src/runtime/expr/bool.rs:204\u0060 calls \u0060Const\u0060, \u0060is_zero\u0060, \u0060constant\u0060 and \u0060crates/evm/symbolic/src/runtime/expr/bool.rs:263\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f95628246a7be4cd80c4d60cb50f50a2502d9f5fb5eddf6280b89ab85412a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/anvil/src/eth/api.rs:3223-3227 | crates/anvil/src/eth/api.rs:3245-3249 \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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43c17959c368f9cc62f9ab3d1977e92a9f362d55caf845d934fd6ce71649c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/anvil/src/eth/api.rs:3260-3265 | crates/anvil/src/eth/api.rs:3309-3313 \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 \u0060crates/anvil/src/eth/api.rs:3260\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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8970fb67cd6e1d78dd22baea5f1ff13dc3487d9b4bc1da79bab7efab310b8c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/anvil/src/eth/api.rs:5155-5159 | crates/anvil/src/eth/api.rs:5178-5182 \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 \u0060crates/anvil/src/eth/api.rs:5155\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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":5155}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c2bf5dd1fa3061917a067443c1d550a7155d020ede958126dd6a7d5ac5d0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cast/src/cmd/batch_mktx.rs:110-115 | crates/cast/src/cmd/batch_send.rs:99-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/cast/src/cmd/batch_send.rs:95\u0060 calls \u0060Some\u0060, \u0060key_id\u0060 and \u0060crates/cast/src/cmd/batch_mktx.rs:108\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9431bf7379e1aa0a5a4edcb94bf79447acda4e853af6e02f312d5b9a5b6f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cast/src/cmd/mktx.rs:203-209 | crates/cast/src/cmd/send.rs:278-282 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f996b3c301acf16303ec2daf55390eea9d7b57ed8a930b49a8712855da7825c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/common/src/contracts.rs:283-287 | crates/evm/traces/src/identifier/local.rs:68-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/common/src/contracts.rs:283\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":"crates/common/src/contracts.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7905a55482a84acb4fb5415c7fdb581a4445f86505f3d57d8abe64aa32195923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/common/src/serde_helpers.rs:33-37 | crates/config/src/utils.rs:322-326 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/common/src/serde_helpers.rs:33\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/common/src/serde_helpers.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a3f698a9b6a7477438aa5f7cc8fcaa28ba25ae431776b8ff31d8d3616eb464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/core/src/evm/lifecycle.rs:1734-1738 | crates/evm/core/src/evm/lifecycle.rs:1759-1763 \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 \u0060crates/evm/core/src/evm/lifecycle.rs:1734\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":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50877f49e4039be829efc65a146c7634ec8fdf5f5ecd09b9e02fa7f474350f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/symbolic/src/executor/invariant.rs:108-112 | crates/evm/symbolic/src/executor/run.rs:686-690 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/symbolic/src/executor/invariant.rs:108\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/invariant.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117c3f50c495645b8e7f51a8543cd5381496607b2f641fdec8a1971cc148dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/bool.rs:228-232 | crates/evm/symbolic/src/runtime/expr/bool.rs:243-247 \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":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49cc8d186b5e800a47e034b202b0e9a836e62776898ba99d27a99749db491d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/expr.rs:964-968 | crates/evm/symbolic/src/runtime/expr/expr.rs:971-975 \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 \u0060crates/evm/symbolic/src/runtime/expr/expr.rs:964\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":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a53e4d60ca54d9f49d357986988c10b0448d9f3acb97c5cefb715584f94e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:467-473 | crates/evm/symbolic/src/runtime/solver/normalize/mod.rs:474-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2385090c23e01f9561330c2eb4be118431c675c080d11cb91ba0c8f5970a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/forge/src/symbolic_minimizer.rs:524-528 | crates/forge/src/symbolic_minimizer.rs:1145-1149 \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 \u0060crates/forge/src/symbolic_minimizer.rs:524\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":"crates/forge/src/symbolic_minimizer.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b67bfb269ea6ae11a5e74f2c7b5a3cac35dbcfec84bf17ed04b4ca7268e72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/cheatcodes/src/crypto.rs:913-927 | crates/common/src/wallet.rs:80-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cheatcodes/src/crypto.rs:913\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":"crates/cheatcodes/src/crypto.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4c4c577d9fc3cc55c852106b31f78b0a6ad5e8318c6840f7f3feb980a58227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cast/src/cmd/call.rs:234-240 | crates/cast/src/cmd/run.rs:244-250 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb40ac4cf70b184f95bf2c0a42696d424745dd67d23124ea16e5b3cb34fa0065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cast/src/cmd/erc20.rs:319-323 | crates/cast/src/cmd/erc4626.rs:949-953 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cast/src/cmd/erc20.rs:319\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":"crates/cast/src/cmd/erc20.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"269c271ed93e7ec6922ae36eee3527c3b161de55aca5faf56efee0de010288dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/bool.rs:317-325 | crates/evm/symbolic/src/runtime/expr/expr.rs:497-503 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"32528dc827a9f5f76ab1df21559628bad1cad8785e47ef3d4df80f96f947ae6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/evm/symbolic/src/runtime/expr/bool.rs:675-680 | crates/evm/symbolic/src/runtime/expr/expr.rs:2083-2088 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5755e3655b34f4356760544a4b64750fe1dee561ef47480bfb7ddccd61efa74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/evm/symbolic/src/runtime/expr/bool.rs:782-787 | crates/evm/symbolic/src/runtime/expr/bool.rs:789-794 | crates/evm/symbolic/src/runtime/expr/expr.rs:1579-1584 \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":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ff842864fe55702d76a111cc1351b36a494470e5ec6309bc7d721ae2a91288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/script/src/lib.rs:988-996 | crates/script/src/simulate.rs:339-350 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/script/src/lib.rs:988\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":"crates/script/src/lib.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11963c1e458ea91f84faf5e7025aee9f5fccea5bcf71c42fed1c7be620f12fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/config/src/lib.rs:2748-2757 | crates/config/src/lib.rs:2769-2778 | crates/config/src/lib.rs:2790-2799 | crates/config/src/lib.rs:2811-2820 | crates/config/src/lib.rs:2832-2841 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/lib.rs:2748\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":"crates/config/src/lib.rs"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05965156432796cb0bd7e7cbea6a1e5c1c0e966d7d94632db7df0d429cdc5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/forge/src/brutalizer/value.rs:37-46 | crates/forge/src/brutalizer/value.rs:49-58 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/brutalizer/value.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee3de238ff611f1e8d1460ba8473ac3809c8ca75beda56c635d9e4435e8a8b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/forge/src/runner.rs:588-597 | crates/forge/src/runner.rs:628-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"crates/forge/src/runner.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb323474c950e5ecb998dfcdb7c989428a1efa651e08c33608041c9227a6d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/evm/symbolic/src/executor/cheatcodes.rs:2940-2949 | crates/evm/symbolic/src/executor/cheatcodes.rs:2962-2971 \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":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":2940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae0e76cecfe8f5fab148503d0322e75ef8315a444b04140fe2b2a3aba28f04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/anvil/src/eth/api.rs:3267-3274 | crates/anvil/src/eth/api.rs:3315-3323 \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 \u0060crates/anvil/src/eth/api.rs:3267\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02b77a4253938f12721b0daa9ca36e070a0668bab080515f4fe0d48fb0ad1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/symbolic/src/runtime/solver/mod.rs:325-333 | crates/evm/symbolic/src/runtime/solver/mod.rs:446-454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8466cd222caab7751684764be7bbe344acd814215d10491cb25aedc1f687ebf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/forge/src/cmd/selectors.rs:420-428 | crates/forge/src/cmd/selectors.rs:431-439 | crates/forge/src/cmd/selectors.rs:442-450 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/forge/src/cmd/selectors.rs:420\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":"crates/forge/src/cmd/selectors.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce861079213e9898709ad003ce25f7884578a078af90d18a6976f0f67329315d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/config/src/providers/ext.rs:314-327 | crates/config/src/providers/ext.rs:354-367 \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 \u0060crates/config/src/providers/ext.rs:314\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/config/src/providers/ext.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccffaf70783dfe4b48d195b45e2d06b3ae85558c58c021d23e7e5217664e850a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/evm/traces/src/decoder/mod.rs:1360-1368 | crates/evm/traces/src/decoder/mod.rs:1372-1378 \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 \u0060crates/evm/traces/src/decoder/mod.rs:1360\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/traces/src/decoder/mod.rs:1369\u0060 calls \u0060String\u0060, \u0060to_string\u0060 and \u0060crates/evm/traces/src/decoder/mod.rs:1379\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dca4d82ba54a04a0e599ac34f4c510cc591c55b46e6a7cdd8d3d7f42093658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/anvil/src/eth/api.rs:1988-1995 | crates/anvil/src/eth/api.rs:4677-4684 \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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe3e0d6b8afb50c74e9695fcd58e18f6417054961a4beaee555d61fdd3d725a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/anvil/src/eth/api.rs:4558-4565 | crates/anvil/src/eth/api.rs:4606-4613 \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":"crates/anvil/src/eth/api.rs"},"region":{"startLine":4558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a1bfebd5ff10fe1121dd2ef3b89cd07912138fb0aa19d3f3f986a51fff9f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cast/src/cmd/wallet/configurable_account.rs:553-560 | crates/script/src/owner_approvals.rs:546-553 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/configurable_account.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c009c14420371af473cfbdab891b9198364e822e385cdecf7cdfdd9b485de47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/anvil/src/eth/backend/mem/mod.rs:5461-5468 | crates/anvil/src/eth/backend/mem/mod.rs:5669-5676 \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 \u0060crates/anvil/src/eth/backend/mem/mod.rs:5461\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":5461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1131d48d190a763ab567d88215cbb5234d99a4c6252395b0d3d288b524ef2277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/anvil/src/eth/pool/mod.rs:421-427 | crates/anvil/src/eth/pool/mod.rs:439-446 \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":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00bbfb4ba96f1fef1ac306ab7b35ed6009f5ce4b8d2051a99aac325d16b4cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/forge/src/cmd/clone.rs:1035-1040 | crates/forge/src/cmd/clone.rs:1045-1050 \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":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cc65f73e07c24bf3faff47e2be111892e20810250fb35d7b30fca0b12bc964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cheatcodes/src/crypto.rs:631-635 | crates/cheatcodes/src/crypto.rs:639-643 \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 \u0060crates/cheatcodes/src/crypto.rs:631\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":"crates/cheatcodes/src/crypto.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0a066046e04e9196d277c600e77e59b4962359e0e362ef662ccec23c593bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/anvil/src/eth/backend/mem/state.rs:317-322 | crates/anvil/src/eth/backend/mem/state.rs:340-345 \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 \u0060crates/anvil/src/eth/backend/mem/state.rs:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/state.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce0fad3f5bf45b21c70833d2d41801ae8eddf0fa39d65a11fe7835efa16ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cast/src/cmd/configurable_key_auth.rs:159-163 | crates/cast/src/cmd/wallet/configurable_account.rs:383-387 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/configurable_key_auth.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f768402c8cc65889e8d9e087881bbd61458e1e781e2a9221c4e2e53439856460"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/providers/ext.rs:106-110 | crates/config/src/providers/ext.rs:169-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/config/src/providers/ext.rs:99\u0060 calls \u0060Ok\u0060, \u0060file\u0060, \u0060clone\u0060 and \u0060crates/config/src/providers/ext.rs:166\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/ext.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca88cba02d9f2f6da9393e9ab7124398cf7756b82a0a8aab440d478f6bad896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/core/src/evm/lifecycle.rs:1101-1105 | crates/evm/core/src/evm/lifecycle.rs:1153-1157 \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":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca666b2fb782d74f6134a45742041be78a1a79d95f03d5b7e2bd27922119bd4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/fmt/src/state/sol.rs:740-744 | crates/fmt/src/state/sol.rs:2531-2535 | crates/fmt/src/state/sol.rs:2592-2596 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"f614a8ce96b0ab8dbeabda25078cc7048014f51b3d9874ca440b824d6298b442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): .github/scripts/finalize-release.py:81-85 | .github/scripts/finalize-release.py:92-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/finalize-release.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c22cf6ad4c5103131b520d948c3281de10b412b02af198f3540adabf59a4d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/test-utils/src/rpc.rs:304-334 | crates/test-utils/src/rpc.rs:506-545 | crates/test-utils/src/rpc.rs:553-586 | crates/test-utils/src/rpc.rs:636-679 | crates/test-utils/src/rpc.rs:819-865 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/rpc.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe6d0e408450929fec3c81b5cf9c00588ece1e4cc216086a3ac4b94627bc1dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/test-utils/src/rpc.rs:304-334 | crates/test-utils/src/rpc.rs:506-545 | crates/test-utils/src/rpc.rs:553-586 | crates/test-utils/src/rpc.rs:743-789 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/rpc.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9519edf9a6b93f26bbfa44b7ac034a7388599e794de9db8b0e433e3924a7154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/test-utils/src/rpc.rs:457-496 | crates/test-utils/src/rpc.rs:592-628 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/rpc.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3496619aa78efe5dc5fddf761829e33661d90f4900478c79643d62283f879e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/evm/fuzz/src/strategies/int.rs:140-157 | crates/evm/fuzz/src/strategies/uint.rs:120-137 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/int.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2fee4b3c6cd99ce71e33719dbbb46952894eae4cadca32eb8ab49ef4264a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/evm/fuzz/src/lib.rs:207-225 | crates/evm/fuzz/src/lib.rs:232-250 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/lib.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4972f6a846596cc13b0bc1b4ad544c4fa11d9476e19deddf0734af0b8a77e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/evm/fuzz/src/strategies/calldata.rs:161-180 | crates/evm/fuzz/src/strategies/calldata.rs:188-201 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/calldata.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e464d7d426e5993d8a221dccf42df03d012d6fb8daf0b74e7874b5105816239b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/test-utils/src/prj.rs:750-757 | crates/test-utils/src/prj.rs:761-769 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/prj.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a01d9e3c8063e28cf91a5b412aa3100bbad144db561513271caec2bae81d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/evm/fuzz/src/strategies/mutators.rs:426-434 | crates/evm/fuzz/src/strategies/mutators.rs:438-446 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/mutators.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05571b76362eaca3ae478866a709d362423a4fce28bc6e398e3987cc1239998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/test-utils/src/prj.rs:691-697 | crates/test-utils/src/prj.rs:701-707 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/prj.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a874cce67205bb84847f2d4e800608cbf8981c5d91ca9267433b12849f87c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/test-utils/src/prj.rs:420-431 | crates/test-utils/src/prj.rs:434-446 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/prj.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"663a239a9fb5ad6496f80a1853cce32252e5c16ebe44b35fa467b9ff467c78fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/test-utils/src/script.rs:83-94 | crates/test-utils/src/script.rs:98-110 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/script.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a36e48f72f896160ff35e215050cdac7f17a96dc64231a9869d3ab1927b51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/evm/fuzz/src/strategies/int.rs:30-40 | crates/evm/fuzz/src/strategies/uint.rs:30-40 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/int.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"765208d085841b0afd5703988152eeaeef90ce26a673804685725eda90b1cab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/evm/fuzz/src/strategies/int.rs:57-63 | crates/evm/fuzz/src/strategies/uint.rs:50-56 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/int.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3971f36cb3626a32a50e6e37b0796883f3fc5b459df05d2ee1414af7b2245ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201321 lines \u00D7 5): crates/test-utils/src/rpc.rs:329-332 | crates/test-utils/src/rpc.rs:540-543 | crates/test-utils/src/rpc.rs:581-584 | crates/test-utils/src/rpc.rs:656-676 | crates/test-utils/src/rpc.rs:842-862 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/test-utils/src/rpc.rs:329\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/test-utils/src/rpc.rs:676\u0060 calls \u0060local_addr\u0060, \u0060unwrap\u0060 and \u0060crates/test-utils/src/rpc.rs:332\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/rpc.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74278c44511ed690406e0ebd51dd291f5d496b633867d7caa785a09e7aeb970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/test-utils/src/rpc.rs:476-493 | crates/test-utils/src/rpc.rs:770-786 \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 \u0060crates/test-utils/src/rpc.rs:476\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":"crates/test-utils/src/rpc.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a247c7ad455c90d36c243b6f56cb7b8a77d174769e8c234d9dfa73ecd050383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/test-utils/src/rpc.rs:307-321 | crates/test-utils/src/rpc.rs:556-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/test-utils/src/rpc.rs:307\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":"crates/test-utils/src/rpc.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f9f9b8d35e7784975a3562c08755de496e2fc990f3688520e1b451a8cc8172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): crates/evm/evm/src/executors/fuzz/mod.rs:576-583 | crates/evm/evm/src/executors/fuzz/mod.rs:710-723 \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 \u0060crates/evm/evm/src/executors/fuzz/mod.rs:576\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":"crates/evm/evm/src/executors/fuzz/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d721d955a1087880e25f65272df5278fc4394fe874756b7e0829e83908beb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/test-utils/src/rpc.rs:311-322 | crates/test-utils/src/rpc.rs:511-522 | crates/test-utils/src/rpc.rs:560-571 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/test-utils/src/rpc.rs:311\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/test-utils/src/rpc.rs:310\u0060 calls \u0060clone\u0060 and \u0060crates/test-utils/src/rpc.rs:510\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/rpc.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bfe4d0b5176f1f3fb19c2206a41042c2f87cf743dc2b77f759add049ee3fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/evm/fuzz/src/sequence.rs:404-414 | crates/evm/fuzz/src/sequence.rs:436-447 \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 \u0060crates/evm/fuzz/src/sequence.rs:404\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/sequence.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e426a57c1ca86d233cecafb80a967a3554a947d2e089364acbf151d5dc3da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/evm/fuzz/src/lib.rs:215-225 | crates/evm/fuzz/src/lib.rs:240-250 \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 \u0060crates/evm/fuzz/src/lib.rs:215\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, 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":"crates/evm/fuzz/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60e814cb75a9f273d276d67e0423c3ecb906478d532205f723890add3fc7808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/evm/fuzz/src/strategies/int.rs:175-184 | crates/evm/fuzz/src/strategies/uint.rs:151-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/evm/fuzz/src/strategies/int.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/evm/fuzz/src/strategies/int.rs:189\u0060 calls \u0060overflowing_from_sign_and_abs\u0060 and \u0060crates/evm/fuzz/src/strategies/uint.rs:162\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/int.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d247c563419c27156302a489b7ead38799b6c9c709d7a033b11ddcfce92ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/fuzz/src/strategies/int.rs:200-208 | crates/evm/fuzz/src/strategies/uint.rs:174-182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/int.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e10bdb6c69c215db25818293fa5c97607e98abca64f1b25abe69d90be501be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/test-utils/src/rpc.rs:461-468 | crates/test-utils/src/rpc.rs:822-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/test-utils/src/rpc.rs:461\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/rpc.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"456bd2330d65a9367a81d6d80a1ab52c30f394abdd9d970e70646b621bd0db44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/test-utils/src/rpc.rs:507-513 | crates/test-utils/src/rpc.rs:744-750 \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 \u0060crates/test-utils/src/rpc.rs:507\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":"crates/test-utils/src/rpc.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebb616da087aa493d4263bc27cbb698aced764ec6f6a9e692b3d92e023fc1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/fuzz/src/strategies/param.rs:243-247 | crates/evm/fuzz/src/strategies/param.rs:276-280 \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 \u0060crates/evm/fuzz/src/strategies/param.rs:243\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":"crates/evm/fuzz/src/strategies/param.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c15fbeadd00edb9a84de8188d27f3fc0c82cd05ac0cd00733fc8ffe0337767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/evm/fuzz/src/strategies/int.rs:113-121 | crates/evm/fuzz/src/strategies/uint.rs:101-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/int.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6303f061a232d6e45433e1d4642bf9431219f807569eaf4cc68bb6de015137c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/evm/evm/src/executors/fuzz/mod.rs:506-510 | crates/evm/evm/src/executors/fuzz/mod.rs:813-817 \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":"crates/evm/evm/src/executors/fuzz/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f5caebaa4f7d8bf3c48d964609f756ba93f823e6ee721f7bc67cdf7235cbce"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project forge-script: forge-script has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"459d648edfec08567ca8b934de5a3577c2304c95258676fcd4ca110a4162a075"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: anvil-rpc: anvil-rpc: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d13f7fd94fb9d066a0405c87b4898e3bceadebfa56f6e9f3a81748515add870"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: foundry-cli-markdown: foundry-cli-markdown: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9a65d79d017f4e4dae4cfc8b6f0bf3aa6d66601fa98ff710cc00000e708a0622"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: foundry-evm-sancov: foundry-evm-sancov: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ef252c259cd14660be6f0a6e741aa4a0d835576ef60b3a75ce6f52afdd9dcafb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: foundry-linking: foundry-linking: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"19ff29cf8b74f86e58e2ee255cc8936236f69b82dbc7ca249ea16b6d03a1ada0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: foundry-evm-networks: foundry-evm-networks: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d3e4e9c8933a4fb76e22e20b486b3f4b25553c05a48791c5fb2eefbe295bf25d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: foundry-config: foundry-config: abstractness 0.01, instability 0.11, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"28403d15997c413546ef8fef0437d7d094c0aa8c592090a2db489251a7df0b9f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodeConfig (LCOM4 17): NodeConfig\u0027s methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"81716774ee17db2145af781e6fd84de875d79e186df3240137fba7b307ee9930"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InspectorStack (LCOM4 10): InspectorStack\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a977da86751e0f231d9482062183f024f09493e199da100c12897fb6a85c65"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PathState (LCOM4 8): PathState\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"079d62bd02577ddc3d1f4cf3796468c15ca2c6961a972b02bebb658272db8bf4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SymbolicWorld (LCOM4 8): SymbolicWorld\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ef8e7e1abf951e0aa996c9f68e0d0b99c200bb608e652c57ba78c7795da7da"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SymExpr (LCOM4 7): SymExpr\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb54fb25a23e796506f723d447bae4d8d89fb3c2762187ebcf80116fceb225c9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ContractsByArtifact (LCOM4 6): ContractsByArtifact\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/contracts.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9936578a72097c6a2365eae6b5884b9c349559e51bf1d8fa6eb38e9c66be8b30"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ScriptArgs (LCOM4 6): ScriptArgs\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69cc9eb6c87db4d12821cf4905667492ee2e765d7985638cf599d74626c551c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InspectorStackInner (LCOM4 5): InspectorStackInner\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d6b959cc6dd879bc862305304491ae4e4d14cce53280c197e8eadd557032ab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InvariantCampaignState (LCOM4 4): InvariantCampaignState\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/campaign.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3748b56da81d59c54b69ea89754314f73a7f0e9cdabae406732746e640841d9a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CommentConfig (LCOM4 4): CommentConfig\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"37833d17c980123922471fb27a92f67f84713c4e71edbeab8540c15cec5bed3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/eth/api.rs: crates/anvil/src/eth/api.rs changed 92 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 191 in EthApi::execute at line 2288. 62 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cda24e537617853aaea27b5639f6a8938ded3c22cee41ce31d018b30d2fb75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/eth/backend/mem/mod.rs: crates/anvil/src/eth/backend/mem/mod.rs changed 170 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in Backend::simulate_raw at line 9386. 91 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/backend/mem/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/mod.rs"},"region":{"startLine":9386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c9cb448929571371c294af8e9a9d04826c24e16c1270278d372ad05ef9a86b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/cheatcodes.rs: crates/evm/symbolic/src/executor/cheatcodes.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 244 in SymbolicExecutor::handle_foundry_cheatcode at line 1000. 29 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/cheatcodes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea259a7442838a25a68e108c0cfda1307bf53d5b115da9859f00a4ee3ddaf29d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cheatcodes/src/inspector.rs: crates/cheatcodes/src/inspector.rs changed 77 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in Cheatcodes::check_mem_opcodes at line 3595. 37 of those changes were fix/bug commits, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cheatcodes/src/inspector.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b105186496d1517207067da0c292d162a471c7b4863cde31c9222ec4cde6ecc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/args.rs: crates/cast/src/args.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 215 in cast::args::run_command at line 132. 14 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/args.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c7e8392ac557b064c23c4176bb0f45dcc0416e6484e447837a0ff5b67db334"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/opcodes.rs: crates/evm/symbolic/src/executor/opcodes.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 175 in SymbolicExecutor::step at line 481. 23 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/opcodes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"794f7cfd108b68a3cabae42b4df8811c66c50f15ae421f104df1780aba20e70b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/runner.rs: crates/forge/src/runner.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in FunctionRunner::run_invariant_test at line 3909. 25 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a836345fa45a0d597fcce379bdf0af38643986addc503e98e82e4ec5a1948"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/calls.rs: crates/evm/symbolic/src/executor/calls.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in SymbolicExecutor::call_concrete_target at line 925. 32 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/calls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6fccab9947f6fd82ff352310b87cce731d7956b90ab030d8b6d7215ba2c03f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/executors/invariant/mod.rs: crates/evm/evm/src/executors/invariant/mod.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in InvariantExecutor::run_invariant_worker at line 1020. 16 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/invariant/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9c46902596cf8bb3bbe2c385a0d027a50c6683c7516cffcdae157de12bc56e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/broadcast.rs: crates/script/src/broadcast.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in BundledState::broadcast at line 794. 19 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/broadcast.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da65347228da7f64bd639ee32b10c00b2d28cf1c8b999b98470edf5b780094"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/inspectors/stack.rs: crates/evm/evm/src/inspectors/stack.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in InspectorStackRefMut::transact_inner at line 1366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/inspectors/stack.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/inspectors/stack.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3d1a096d03f8f468791a22b885beae573f3630e69bb3d436cd920e1c0b08f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cheatcodes/src/evm.rs: crates/cheatcodes/src/evm.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in foundry_cheatcodes::evm::get_recorded_state_diffs at line 2229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cheatcodes/src/evm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf89c81168bec1d341e4b42bd1878cd048b97ef64f844663366e140d9944154"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/call.rs: crates/cast/src/cmd/call.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in CallArgs::run_with_network_and_opts at line 404. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fbd1c588437a12c4cda62c0ce2ca78bdf25ef3404fe6601958b60bdc25e25f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/runtime/state.rs: crates/evm/symbolic/src/runtime/state.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PathState::expr_upper_bound_usize_cached at line 570. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/state.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f418b9dd03b253d287fe623c01fe57a0410efe391b4b8c801854e3999f41c7b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/runtime/expr/expr.rs: crates/evm/symbolic/src/runtime/expr/expr.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in SymExpr::binop at line 505. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/expr/expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/expr.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1693fc4423b7e462f450b6ef776e778c3e55d6aa0e18fa86daab5eebef06f468"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/config.rs: crates/anvil/src/config.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in NodeConfig::setup_fork_db_config_with_replay at line 2152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c780a2f289631e96f903e7fd6f4c5fb99667402f9ea25dd6c0a98bbd0fae8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/verify/src/bytecode.rs: crates/verify/src/bytecode.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in VerifyBytecodeArgs::prepare_runtime_verification at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/verify/src/bytecode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/bytecode.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9361b882224766a5231965ea9f20999de4eb8bd26faa748f6165a0e46df555f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fmt/src/state/mod.rs: crates/fmt/src/state/mod.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in State::print_comment at line 973. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/fmt/src/state/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/mod.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c51b9328bfe92736498b1edd6269f9ff707f350152e7e4d37a2966afd1f29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/create.rs: crates/evm/symbolic/src/executor/create.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in SymbolicExecutor::create at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/create.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/create.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ede546646cdee3f6a6e88f1079d54f814a20afefadd78ba5228b38f5c1ea4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fmt/src/state/sol.rs: crates/fmt/src/state/sol.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in State::print_expr at line 1416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/fmt/src/state/sol.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d179e768001d4c45ea805bb3c1b4ace472d41e09601cfa12f7d0e3d9a62142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/wallet/mod.rs: crates/cast/src/cmd/wallet/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in WalletSubcommands::run at line 467. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/wallet/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8860b81d926d56d68c53d02fdd5c2a2b3a96a5ebc586e07a492fdbb2e09189"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/traces/src/decoder/mod.rs: crates/evm/traces/src/decoder/mod.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in CallTraceDecoder::decode_cheatcode_inputs at line 1295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/traces/src/decoder/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/mod.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"160260d3826ad937dc8c2b3ac3de1fec86365d808a4f8cd41d8671dd8022115a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/lib.rs: crates/script/src/lib.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ScriptArgs::preprocess at line 388. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/lib.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9393c863e65338683a95a062239eba42523cff057b6d1c115d8ebf8921d05e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/runtime/expr/bool.rs: crates/evm/symbolic/src/runtime/expr/bool.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in SymBoolExpr::cmp at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/expr/bool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5cd5cc038bd81abb3b5e312c9edb56743ce7891c678224bfea46c27f542361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/mod.rs: crates/evm/symbolic/src/executor/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in SymbolicExecutor::execute_call_path_batch at line 343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/mod.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d5bbc590e3548ffc07207367d86fa7efbf17ef9765634b028aca79cc2b267c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cheatcodes/src/fs.rs: crates/cheatcodes/src/fs.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in foundry_cheatcodes::fs::get_artifact_source at line 702. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cheatcodes/src/fs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/fs.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"1025eb2306e5ecc456a38c0d4c785f9541a41f17b1a7be4f60f61e3aa6114c47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/executors/fuzz/mod.rs: crates/evm/evm/src/executors/fuzz/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in FuzzedExecutor::run_worker at line 910. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/fuzz/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/fuzz/mod.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a5cd27247c89c5b12723f4b9413e6b6f323d48db4cdadee3db281242175bd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/run.rs: crates/cast/src/cmd/run.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RunArgs::prepare at line 511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/run.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"119f9d352e6ae82b22f998a929a170cf20dfafa1e5b68168f5e5a48a0495e1cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/eth/error/mod.rs: crates/anvil/src/eth/error/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in anvil::eth::error::blockchain_error_to_rpc_result at line 467. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/error/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/error/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fb88c0e350b31518cd793c56b72d5d0019c0ecd8fbf5b91fa2cda71fce38c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/send.rs: crates/cast/src/cmd/send.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in SendTxArgs::run_generic_inner at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/send.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/send.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b32656a769b78e9b8ace4e582276c854aee83b4c5bb1251f8b7ba154b90465f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/recovery.rs: crates/script/src/recovery.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RecoveryPlan::validate_signed_payloads at line 850. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/recovery.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ff90d7b4fb9cdbb3b3bf0628edf29f9a8d66c0a768ad6f9c753f083052f5f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/create.rs: crates/forge/src/cmd/create.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in CreateArgs::deploy at line 509. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/create.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/create.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3c5548910216a093614a496c9168665c8e6a78fed440b4bf9a52284948b9d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/invariant.rs: crates/evm/symbolic/src/executor/invariant.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SymbolicExecutor::search_invariant_candidates_inner at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/invariant.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/invariant.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124ffe2a144f38c640847a29d4f337af4f18a442b433674099f4298d3db01c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/runtime/solver/mod.rs: crates/evm/symbolic/src/runtime/solver/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in foundry_evm_symbolic::runtime::solver::run_solver_commands at line 1068. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/solver/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af70d3b2a58c39c222a616332da10e0c3db209e164cd1497e6e794a34e93af2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/runtime/solver/normalize/mod.rs: crates/evm/symbolic/src/runtime/solver/normalize/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ConstraintContext::normalize_word at line 814. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/solver/normalize/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/solver/normalize/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"807ce844f5745dfac422e98b3590dff4f6af209482580dbafc922b34c529cf7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/chisel/src/executor.rs: crates/chisel/src/executor.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SessionSource::inspect at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/chisel/src/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/executor.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3930a15d60db6bc6328547397ba8c172acb0ead1d60bf7bfdab0d1b29ca2508"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/executor/run.rs: crates/evm/symbolic/src/executor/run.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in SymbolicExecutor::run_inner at line 390. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/executor/run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/run.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d73ecfc0a92c76049882f6c360b84f049c52153dd70dc384d4e2c1334742f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/common/src/preprocessor/deps.rs: crates/common/src/preprocessor/deps.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ReturnDataObserver::visit_expr at line 1208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/preprocessor/deps.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d395cfab10b265c0e2e7dcc646757bc7f6624ece1262d303a24d6e592e9cc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/selectors.rs: crates/forge/src/cmd/selectors.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in SelectorsSubcommands::run at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/selectors.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/selectors.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bebd1aa7d7b54dca6b7eb9909b00da194cc846c245e74a17d110586d3abcdd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/eth/backend/executor.rs: crates/anvil/src/eth/backend/executor.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AnvilBlockExecutor::execute_pool_transactions at line 539. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/backend/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf38ba2c208bb285df9111d07e40dd9aad85eb9adefb5fe0bbaded9b332597"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/common/src/compile.rs: crates/common/src/compile.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ProjectCompiler::handle_output at line 430. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/compile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/compile.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c5b7e5edc0c91b168596e5abf76574f0e2e5c5814d6500b881fe2c3d161d10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/args.rs: crates/forge/src/args.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in forge::args::run_command at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/args.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09117f6f139b1f103ceb3c9438f580ed55e2742ab38b7eee1e80f51304cdb1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/simulate.rs: crates/script/src/simulate.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FilledTransactionsState::bundle at line 691. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/simulate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/simulate.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"7504dac7b5ccf9c481738e54ae919f4cc7e75c675b51832d5857adffacea8758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/executors/corpus.rs: crates/evm/evm/src/executors/corpus.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WorkerCorpusSeed::load_from_disk at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/corpus.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"67afd64f30587f6d93b21eeefcf8affc92e594f14b48e5b4c8b3b017dd88d44b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/mutation/orchestrator.rs: crates/forge/src/mutation/orchestrator.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in forge::mutation::orchestrator::run_mutation_testing at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/mutation/orchestrator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/orchestrator.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bde3761f20fa929bb1fea4276b908cf4fbfc21f2e51ef3e573a3e599973a957"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/core/src/fork/multi.rs: crates/evm/core/src/fork/multi.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MultiForkHandler::poll at line 516. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/core/src/fork/multi.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64d2851ae060f3fd76ae108828fdcb2327f659523f9004d46839c9c47779d92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/tx.rs: crates/cast/src/tx.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TxBuilderInner::build at line 714. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/tx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/tx.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fef315ea101b2630435f4a39c143f3c601dc1d6271da86a3f6f0a67a5d98a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/multi_runner.rs: crates/forge/src/multi_runner.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MultiContractRunnerBuilder::build at line 779. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/multi_runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/multi_runner.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"09446260684aad3c6584101bd4279b855e883751458a99af8be0ab497aa027c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/common/src/contracts.rs: crates/common/src/contracts.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ContractsByArtifact::find_by_deployed_code_exact_inner at line 354. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/contracts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/contracts.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ebea308560a182d2327540a20fbcad899387cce928252b43d99ba803412aee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/mutation/runner.rs: crates/forge/src/mutation/runner.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in forge::mutation::runner::run_mutations_parallel_with_progress at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/mutation/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/runner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5bb8600bb03490cdaca96b3f4e94d6646d28e651baa22f9c327a90e5fecb2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/cheatcode_environment.rs: crates/lint/src/sol/med/cheatcode_environment.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Checker::expr_inner at line 716. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/cheatcode_environment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/cheatcode_environment.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7389b900e197a04f469a04831202f08ff380868f1881c142ca9d97dc0f0366"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/common/src/preprocessor/mod.rs: crates/common/src/preprocessor/mod.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DynamicTestLinkingPreprocessor::preprocess_with_dependencies at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/preprocessor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"464d985f0d4345730d9bcfe230f43087d1abd1e9ce145d57c3d1f34f5ff0750d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/doc/src/render.rs: crates/doc/src/render.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in forge_doc::render::render_contract at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/doc/src/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"825ad91ec540873bf8aeb9fc30790438f5d7d7892c1133f5b57086630a228d98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/executors/invariant/result.rs: crates/evm/evm/src/executors/invariant/result.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in foundry_evm::executors::invariant::result::can_continue at line 255. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/invariant/result.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/result.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfa9347a274247158163ce6bd579d2495debaf2ac5816ff90054d674d1796b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/inspect.rs: crates/forge/src/cmd/inspect.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in InspectArgs::run at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/inspect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb6507830c88e5794ce623f966f3841492f17acf972e904374c0837270c6c4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/executors/invariant/shrink.rs: crates/evm/evm/src/executors/invariant/shrink.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in foundry_evm::executors::invariant::shrink::shrink_sequence_by_removing at line 426. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/invariant/shrink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9447fa6d04da7becda84b612418846841c40d3d8b9118ef3c0833c67f1903428"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/fuzz/src/strategies/param.rs: crates/evm/fuzz/src/strategies/param.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in foundry_evm_fuzz::strategies::param::fuzz_param_from_state_inner at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/fuzz/src/strategies/param.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/param.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"259df8d05bf5cc98d531a982114157954d631378d5fb406061a34de767ac1b00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/mktx.rs: crates/cast/src/cmd/mktx.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in MakeTxArgs::run_generic at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/mktx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8421943052321a56bf6369dd5ebc6f850a8542e7e5c3209d1f8d6be92c903d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/keychain.rs: crates/cast/src/cmd/keychain.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in cast::cmd::keychain::check_expiring_nonce_window at line 2337. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/keychain.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd6aa6f017b0a21c34d2803ff91406f33e80319f74d58ef6b7561b324a1013b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/evm/src/executors/showmap.rs: crates/evm/evm/src/executors/showmap.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in foundry_evm::executors::showmap::replay_corpus_to_showmap at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/showmap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/showmap.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b97753b5c5be1ad5c83ec0ba845c54b84b2837827e2fdeeb216ef325e40693"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/mod.rs: crates/lint/src/sol/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SolidityLinter::lint at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58c38bc2b2b65eb74b24029382d41646e0dcd2f78dbf9f5619daeab63995116"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/install.rs: crates/cli/src/install.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in DependencyInstallOpts::install at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/install.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/install.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"44707d12426655c6c0b784a43dd0cc2d6e142f1db978cf6a8c5c8d3e4b700ca9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/high/reentrancy.rs: crates/lint/src/sol/high/reentrancy.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Analyzer::analyze_expr at line 623. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/high/reentrancy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/reentrancy.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a7bc4742652cf0417af8d99a7a350ee922262ab5478085c98c1be415e2b653"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/ecrecover.rs: crates/lint/src/sol/med/ecrecover.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Analyzer::visit_expr at line 766. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/ecrecover.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/ecrecover.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf70732140435f57686e4d7f0631d2bfa89cbb98e2c9e406e8d7fac6eb6d804"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/coverage.rs: crates/forge/src/cmd/coverage.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in CoverageArgs::build at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/coverage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/coverage.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"af30665786b6e9c2e3b8a55e775a57177bd356e9e7fabfdf97280b2737718dad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/wallet/list.rs: crates/cast/src/cmd/wallet/list.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ListArgs::run at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/wallet/list.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/list.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4600a3c6ef66a3a44d7f75a4f8ea862fe5db4b092ff3816d6720e3826144bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs: crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in GuardWalker::walk at line 1015. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/unsafe_oz_erc721_mint.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4173de71e0908e2d97caab13822257e751c5aa64830a05021a3629f1589548"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/runner.rs: crates/script/src/runner.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ScriptRunner::setup at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/runner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0cdb2cffd4654b6d07405f2284391d9be7e1ed7c3163a3841b4b62d55b88cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/verify/src/verify.rs: crates/verify/src/verify.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in VerifyArgs::resolve_context at line 810. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/verify/src/verify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8903ec340036669f4f67715c40fb7b6694525f8c28226bbe43988407a5ce78b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/verify.rs: crates/script/src/verify.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in forge_script::verify::verify_contracts at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/verify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f03e40e14e8ccd63dc31b2740497f6f1bf370161e2c4020429c07de7e960a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/properties.rs: crates/forge/src/cmd/properties.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Campaign::report at line 602. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/properties.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/properties.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b25516bda71a2b9784d88ae977229fa1d8e589430ee86826e7b1f3a9e8e7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/div_mul.rs: crates/lint/src/sol/med/div_mul.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in forge_lint::sol::med::div_mul::check_expr at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/div_mul.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/div_mul.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e37e6caeabc6b6c3a39b4e672e615c32f5bd5045a737462a6321de4ac06f732"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/runtime/precompiles.rs: crates/evm/symbolic/src/runtime/precompiles.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in foundry_evm_symbolic::runtime::precompiles::execute_symbolic_precompile at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/precompiles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/precompiles.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"86de01a9b8a677937afbfc0f4b2d182433e49738085ec871fb49b3fa987828e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/primitives/src/transaction/request.rs: crates/primitives/src/transaction/request.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in FoundryTransactionRequest::try_from at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/primitives/src/transaction/request.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/primitives/src/transaction/request.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d75f1897a91453efaf376f1d22d05352c1560be95c034072179e7caa266bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/high/function_selector_collision.rs: crates/lint/src/sol/high/function_selector_collision.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DelegateTargetCollector::visit_stmt at line 618. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/high/function_selector_collision.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/function_selector_collision.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0fc5148914b5789035eb47f6aa783d96f409a029bdc756b1b28d7cb0fb05f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/logs.rs: crates/cast/src/cmd/logs.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in cast::cmd::logs::stream_logs at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/logs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/logs.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad768bebe660873d132277f324a0bd8baa700ab5b413d1e5b7d18011b3764372"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/providers/remappings.rs: crates/config/src/providers/remappings.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in RemappingsProvider::get_remappings at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/providers/remappings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c17c890d7c15763a505099a50cda2982d6c30eedeea0da772c6827f7e893a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/update.rs: crates/forge/src/cmd/update.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in UpdateArgs::run at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/update.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6257b7ea99650270415a954d6960c34c27d6b6b2012866041080912800a0492f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/high/arbitrary_send_erc20.rs: crates/lint/src/sol/high/arbitrary_send_erc20.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Analyzer::stmt at line 540. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/high/arbitrary_send_erc20.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"574b5225ec5676adb2ec0fd2e047f20096d55737b38566f192364ef09f091420"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/server/src/pubsub.rs: crates/anvil/server/src/pubsub.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PubSubConnection::poll at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/server/src/pubsub.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/server/src/pubsub.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dae0d22c415e6719d8a3ab854bb16d71bde1c753852f68335591c7d41f821a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/opts/evm.rs: crates/cli/src/opts/evm.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EvmArgs::data at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/opts/evm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/opts/evm.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c51fe6084ae1ec36d5b186c16ff3535ec1343892db0b404cbe9a24714e316f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/storage.rs: crates/cast/src/cmd/storage.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in StorageArgs::run at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/storage.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"040f4232217f307416b41c6587a216e70bd8c3a6d5315622e929acd1c4ee0c06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/high/controlled_delegatecall.rs: crates/lint/src/sol/high/controlled_delegatecall.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Analyzer::visit_stmt at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/high/controlled_delegatecall.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/controlled_delegatecall.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f741990574fc721e4fd78e1c3ccc4da9376c5670c6e4d5f2e51d60e11bd82611"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/lib.rs: crates/anvil/src/lib.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in anvil::try_spawn at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22b76727df1e397f21c7a562a297b2a73c1df3cef27ac60719cedc629833414"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/traces/src/decoder/precompiles.rs: crates/evm/traces/src/decoder/precompiles.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in foundry_evm_traces::decoder::precompiles::is_known_precompile at line 474. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/traces/src/decoder/precompiles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/decoder/precompiles.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47d43ae72f1d21c439505f31e470c6d58343a1ee37d7ce4f782743cd4159df7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/traces/src/identifier/external.rs: crates/evm/traces/src/identifier/external.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ExternalFetcher::poll_next at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/traces/src/identifier/external.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa83a104eaf52bd82ee1e64a0606c863fec661d7d40953f139fc47702bcbb634"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/common/src/tempo/auth.rs: crates/common/src/tempo/auth.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in foundry_common::tempo::auth::ensure_access_key at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/tempo/auth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/tempo/auth.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0f8f3b92e8939565127f8fd4b00d2450d6076d76465a396c15205d75eaf4ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/doc/src/vocs.rs: crates/doc/src/vocs.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in forge_doc::vocs::escape_mdx_outside_code_fences at line 332. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/doc/src/vocs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/vocs.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1f565977f70a666adba9edcd349d4d2bd3ec9721821f65d4841bae27077b45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/low/missing_events_access_control.rs: crates/lint/src/sol/low/missing_events_access_control.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WriteAnalyzer::visit_stmt at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/low/missing_events_access_control.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/missing_events_access_control.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cda3e56de07eddc768881ca64023be1aeb6ae7c7eec173d18d43c4669061398"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/gas/write_after_write.rs: crates/lint/src/sol/gas/write_after_write.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Analyzer::reads at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/gas/write_after_write.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/write_after_write.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1edf61d07e3ada29d6e9812858a81f01f192fde4ab7aaa55da48b046f254d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/gas/immutable.rs: crates/lint/src/sol/gas/immutable.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UnchangedStateVariables::check_nested_contract at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/gas/immutable.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/gas/immutable.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbf16c83943372a669b8c1c833cb3bee810c61392023be548ed47153b95f2c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/lockfile.rs: crates/cli/src/lockfile.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Lockfile::check at line 182. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/lockfile.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lockfile.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf2360d5036a72af5f5508a90432179a0949cfddbd4b56acd1a2e6986602972"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/fmt.rs: crates/forge/src/cmd/fmt.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in FmtArgs::run at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/fmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fmt.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e614c06995aef77f4092993a9334abcb4bffdfb0721e706e574e27cda67704"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/symbolic/src/abi.rs: crates/evm/symbolic/src/abi.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SymbolicCalldata::variants_with_prefix at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/abi.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/abi.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3408387d99de6457754bc0e4bf697cf56f2a6ec5177754b28e7ca5e81f98e8f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/low/reentrancy_events.rs: crates/lint/src/sol/low/reentrancy_events.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Analyzer::analyze_stmt at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/low/reentrancy_events.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/low/reentrancy_events.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54688c9d08e40ab61a18f8357aadd11189f4a76f82c295c189f380f87d45333"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/batch_mktx.rs: crates/cast/src/cmd/batch_mktx.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in BatchMakeTxArgs::run at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/batch_mktx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d27963a0925fe514271267d30c3f82ba91e976954b2e2b374cf3e8742f0ef06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/core/src/evm/lifecycle.rs: crates/evm/core/src/evm/lifecycle.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in foundry_evm_core::evm::lifecycle::merge_changes at line 1840. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/core/src/evm/lifecycle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b2bd3cf9fdabc7e516ef9941efe78213da3eb826c9411de3a5986e87c3f544"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/anvil/src/server/rpc_handlers.rs: crates/anvil/src/server/rpc_handlers.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PubSubEthRpcHandler::on_pub_sub at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/server/rpc_handlers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b4220197adb10aa3b5ddb474c3435b5fc1a98955701b405d51eb7cc1bf6b3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs: crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in forge_lint::sol::codesize::unwrapped_modifier_logic::snippet at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/codesize/unwrapped_modifier_logic.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"862c6ca2c3b8191a9267b114ed32b163dbd3d2cdfd8a6d5cb0a87a8670b08ae6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/script/src/progress.rs: crates/script/src/progress.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ScriptProgress::wait_for_pending at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/progress.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/progress.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bed1898fc62ecd82e2f7db6b808d9e775a1a86ebea4f8583fd4a43717db01e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/uninitialized_state_variables.rs: crates/lint/src/sol/med/uninitialized_state_variables.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in forge_lint::sol::med::uninitialized_state_variables::storage_aliases at line 183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/uninitialized_state_variables.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/uninitialized_state_variables.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"059563dd7dc7faa2f3809411172b2ae52c42fe94ea742776832fa0b29592d688"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/create2.rs: crates/cast/src/cmd/create2.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Create2Args::run at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/create2.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/create2.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a210d48e8e14d92e07b3724f81a30d56c1ed5b4cc66db895f8c65242abfe061a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/high/arbitrary_send_eth.rs: crates/lint/src/sol/high/arbitrary_send_eth.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Analyzer::stmt at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/high/arbitrary_send_eth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_eth.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb2ed5a7f0b6fff2ee80d5f7bbab7840115347fc0d0a0f782e876a318bd9328"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/tautological_compare.rs: crates/lint/src/sol/med/tautological_compare.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in forge_lint::sol::med::tautological_compare::exprs_equal at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/tautological_compare.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/tautological_compare.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3775bb6910b6955499d936c61c809f6d60205a99d7c385caa2f57e0e4330c8a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/evm/traces/src/identifier/local.rs: crates/evm/traces/src/identifier/local.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LocalTraceIdentifier::identify_code at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/traces/src/identifier/local.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/local.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dbe9a4d3ef57e6d036622c297dad5db181fcb5919fe3d64181e4077786b771"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/common/src/comments/mod.rs: crates/common/src/comments/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CommentGatherer::process_token at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/comments/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/comments/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde6862b6438f82e54fcebdde2754389e685ed63559ddfd2894a2daa943c2d8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/lint.rs: crates/forge/src/cmd/lint.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LintArgs::run at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/lint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/lint.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"184bbaf149e0a3fcc4cfe3b4836a41de7775b11b04f353ee1ece00274ec5aaf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/med/uninitialized_local.rs: crates/lint/src/sol/med/uninitialized_local.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Checker::visit_stmt at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/med/uninitialized_local.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/med/uninitialized_local.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62dc74b5ced1259972af3871aa074a283037d80f262c37e60ce70589b14f9df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/info/missing_inheritance.rs: crates/lint/src/sol/info/missing_inheritance.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MissingInheritance::check_project at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/info/missing_inheritance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/info/missing_inheritance.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa04743c74f3519df0a17aab8b0ce676b5c0247968698cfae3bf203efae0844"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cast/src/cmd/wallet/configurable_account.rs: crates/cast/src/cmd/wallet/configurable_account.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cast::cmd::wallet::configurable_account::new_wallet_is_configurable at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/wallet/configurable_account.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/wallet/configurable_account.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2235bd0524193beed55f6f21aed3be790cf5f7d538e8a0fa61683833682aaae5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lint/src/sol/analysis/modifier_outcome.rs: crates/lint/src/sol/analysis/modifier_outcome.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in forge_lint::sol::analysis::modifier_outcome::stmt_outcome at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/lint/src/sol/analysis/modifier_outcome.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/analysis/modifier_outcome.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"383ecb23b6de7364c73e2f9f6b57555b3bb53664a3a9067e748a60bac6c2f010"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/forge/src/cmd/fuzz.rs: crates/forge/src/cmd/fuzz.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in forge::cmd::fuzz::push_scalar_value_candidates at line 974. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/fuzz.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fuzz.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da7de6414c194c73560db0d38dc5c526ad4d96d7d1895e0e871bd39ce0fd16a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/symbolic/src/lib.rs: crates/evm/symbolic/src/lib.rs changed 20 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is SymbolicVmCheatcode::min_input_words at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(symbolic): build svm calldata from the ABI and replay svm values (#18387)\u201D; \u201Cfix(symbolic): consolidate account, address and storage fixes (#18368)\u201D; \u201Cfix(symbolic): consolidate cheatcode argument and result fixes (#18366)\u201D; \u201Cfix(symbolic): model call depth and exceptional halts (#17854)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb7f4bc881ed260c05080d9721959449996a036eef9b95a3adffd00b48fa5e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/anvil/src/eth/backend/fork.rs: crates/anvil/src/eth/backend/fork.rs changed 18 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ClientForkConfig::prefill_cache at line 1039), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tempo): keep account extensions in forks (#18374)\u201D; \u201Cfix(anvil): infer Tempo fork epoch length (#18020)\u201D; \u201Cfix(anvil): allow rollback to the fork root (#17835)\u201D; \u201Cfix(anvil): use source hardfork for fork blob params (#17756)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/backend/fork.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a4ad411c1faab7492aee0740a0910f31437a6b1bd7730abdd8d7998971ad6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/utils/mod.rs: crates/cli/src/utils/mod.rs changed 13 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Git::submodules_in_worktree at line 866), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): name the program when a command cannot be started (#18045)\u201D; \u201Cfix: resolve Windows test failures (#17803)\u201D; \u201Cfix(forge): check out tags shadowed by branches (#17763)\u201D; \u201Cfix(cli): decode git submodule branch values (#17592)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/utils/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/mod.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"a242810bd8308c609e289daaf2e460d159a203a866320d9b3c3308edba181351"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/anvil/src/eth/fees.rs: crates/anvil/src/eth/fees.rs changed 18 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is FeeDetails::new at line 738), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(anvil): restore fee state on rollback and reorg (#17795)\u201D; \u201Cfix(anvil): reject conflicting call fee and input fields (#17307)\u201D; \u201Cfix(anvil): run fee-free calls at zero base and blob base fees (#17310)\u201D; \u201Cfix(anvil): charge cap-only calls at the base fee (#17311)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/fees.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/fees.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"10faef2f377d9626f56eb41a7549af83c4732806e3b3f74b5a259db83716ef2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cheatcodes/src/lib.rs: crates/cheatcodes/src/lib.rs changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is CheatsCtxt::ensure_not_precompile at line 179), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(symbolic): consolidate account, address and storage fixes (#18368)\u201D; \u201Cfix(symbolic): consolidate cheatcode argument and result fixes (#18366)\u201D; \u201Cfix(symbolic): consolidate cheatcode state and prank fixes (#18365)\u201D; \u201Cfix(symbolic): match expectRevert like Forge (#17945)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cheatcodes/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"76166acc5ce396ff0758fd1890c353285c944ea916c8b174ca9b5ead112ce391"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/chisel/src/dispatcher.rs: crates/chisel/src/dispatcher.rs changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is chisel::dispatcher::preprocess at line 681), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(chisel): redact credentials from the fork URL that \u0060!fork\u0060 prints (#17735)\u201D; \u201Cfix(chisel): reject unterminated block comments (#17530)\u201D; \u201Cfix(cast): fetch impl on cast interface (#17153)\u201D; \u201Cfix(chisel): keep credentials out of session cache (#17143)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/chisel/src/dispatcher.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/dispatcher.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a6fd5e44a180ecb35c0d19339a4d5b7597501318c4c53bb1407a0f517a944"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/symbolic/src/runtime/memory.rs: crates/evm/symbolic/src/runtime/memory.rs changed 15 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is SymMemory::byte_dynamic_with_delta_and_bounds at line 514), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(symbolic): run delegate code for EIP-7702 calls (#18459)\u201D; \u201Cfix(symbolic): consolidate account, address and storage fixes (#18368)\u201D; \u201Cfix(symbolic): model call depth and exceptional halts (#17854)\u201D; \u201Cfix(cheatcodes): reset delegated EOA nonces to 0 (#17686)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/memory.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/memory.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e259570df256f7b53d5bfc0f6451f28a1df92aee251008d5e4d9b4632282de0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/chisel/src/session.rs: crates/chisel/src/session.rs changed 13 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is ChiselSession::write_new_from at line 146), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(chisel): stop concurrent saves from reusing an id (#17606)\u201D; \u201Cfix(chisel): keep credentials out of session cache (#17143)\u201D; \u201Cfix: revert automatic foundry.lock enforcement (#16863)\u201D; \u201Cfix: enforce existing foundry.lock (#16817)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/chisel/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/session.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5c03878fc6b7a640f92062857f60b1eeb5e54ffe3f9fdee282932044187733"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/script/src/sequence.rs: crates/script/src/sequence.rs changed 15 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ScriptSequenceKind::restore_delegated_pending at line 439), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(script): name chains in multichain errors and reconcile all on resume (#17880)\u201D; \u201Cfix(script): refuse rebroadcast over an unfinished run (#17851)\u201D; \u201Cfix(script): use --rpc-url on resume (#17758)\u201D; \u201Cfix(script): keep original sponsor on resume (#17753)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/sequence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/sequence.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6fbbcbe4ddcd8dc2a4c996e72c777e98ca774d74e43dfd3af0e6b42eae22a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/anvil/src/eth/backend/mem/tempo.rs: crates/anvil/src/eth/backend/mem/tempo.rs changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Backend::tempo_certified_block at line 502), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(anvil): warn on Tempo epoch fallback (#18077)\u201D; \u201Cfix(anvil): announce full DKG before rotation (#18069)\u201D; \u201Cfix(anvil): infer Tempo fork epoch length (#18020)\u201D; \u201Cfix(anvil): lock Tempo history before storage when mining (#18064)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/backend/mem/tempo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/tempo.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"023c3f0f3d7218c200c0ab3fb328c7e4ed99dcb179be4a79d662f8c9c2a74a48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/common/src/provider/mod.rs: crates/common/src/provider/mod.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ProviderBuilder::new at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(anvil): don\u0027t send fork headers to other origins (#17908)\u201D; \u201Cfix(common): reject an empty RPC URL (#17826)\u201D; \u201Crevert: \u0022feat(cast): restore run prestate from BAL\u0022 (#16930)\u201D; \u201Cfix(script): honor RPC config (#16589)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/provider/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a7fcd26100b88610d5786832b03ec8f0310eb43dcbde12f3e273092baf1be9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/anvil/src/eth/pool/mod.rs: crates/anvil/src/eth/pool/mod.rs changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is Pool::on_mined_block at line 284), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(anvil): respect pubsub backpressure (#17909)\u201D; \u201Cfix(anvil): order fee mempool by effective tip (#17882)\u201D; \u201Cfix(anvil): retry ready txs left by full blocks (#17266)\u201D; \u201Cfix(anvil): order Tempo nonce lanes (#17139)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/pool/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6440de2e6ac714a317033810e6ca48f0527452cbb5a919248c95087d966ff0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/forge/src/cmd/bind.rs: crates/forge/src/cmd/bind.rs changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is BindArgs::cached_artifact_paths at line 273), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(forge): reject binding name collisions (#17690)\u201D; \u201Cfix(forge): ignore orphaned artifacts in bind (#17556)\u201D; \u201Cfix: revert automatic foundry.lock enforcement (#16863)\u201D; \u201Cfix: enforce existing foundry.lock (#16817)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/bind.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/bind.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d9472da5240c556304d3a5911aedcc945cde0928266988504d082ea38c449d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/symbolic/src/runtime/executor_view.rs: crates/evm/symbolic/src/runtime/executor_view.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ExecutorView::new at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(symbolic): run delegate code for EIP-7702 calls (#18459)\u201D; \u201Cfix(symbolic): consolidate account, address and storage fixes (#18368)\u201D; \u201Cfix(symbolic): consolidate call, expectation and mock fixes (#18367)\u201D; \u201Cfix(symbolic): consolidate cheatcode argument and result fixes (#18366)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/executor_view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/executor_view.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"32308deb0a77c9782f4b5b70f563d12a72d579b654eb1013a61751314da70825"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/coverage/src/anchors.rs: crates/evm/coverage/src/anchors.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is AnchorIndex::new at line 133), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(coverage): treat JUMPDEST-led failure stubs as failure code (#18446)\u201D; \u201Cfix(coverage): skip leading failure stubs (#18094)\u201D; \u201Cfix(coverage): track nested ternary branches (#16828)\u201D; \u201Cfix(coverage): anchor lines before branch bodies (#16836)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/coverage/src/anchors.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/coverage/src/anchors.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"da98d76cc1824d12232197073aca19fe5741803aacf2f202f48a21c37e013165"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/common/src/preprocessor/data.rs: crates/common/src/preprocessor/data.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is foundry_common::preprocessor::data::solidity_string_content at line 218), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(compile): keep DTL cache on unrelated removals (#18026)\u201D; \u201Cfix(common): preserve helper ABI coder v2 (#17591)\u201D; \u201Cfix(forge): stabilize test linking helpers (#17576)\u201D; \u201Cfix(forge): skip deploy helpers in removed source warning (#17172)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/common/src/preprocessor/data.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/data.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fdf5dfa085b835b3943be3a6eb42a11fa953f6bde878dbc47cbe9ed56d9202"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/anvil/src/eth/otterscan/api.rs: crates/anvil/src/eth/otterscan/api.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is EthApi::ots_search_transactions_after at line 196), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(anvil): keep block tx order in ots_searchTransactionsAfter (#18015)\u201D; \u201Cfix(anvil): clamp ots search block number to head (#18014)\u201D; \u201Cfix(anvil): respect genesis number in RPC lookups (#17731)\u201D; \u201Cfix(anvil): return null from trace_transaction for an unknown hash (#17089)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/eth/otterscan/api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/otterscan/api.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"92604f724b9cb22588939c45bc65fafde70710a71d5ac410713ff6dd45df72d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cast/src/cmd/creation_code.rs: crates/cast/src/cmd/creation_code.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is cast::cmd::creation_code::parse_code_output at line 77), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cast): fetch impl on cast interface (#17153)\u201D; \u201Cfix(cast): reject ambiguous constructor args (#17233)\u201D; \u201Cfix(cast): decode dynamic constructor args in creation code (#16922)\u201D; \u201Cfix(cast): reject short creation bytecode (#16567)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/creation_code.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/creation_code.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e889df988c49a91c1bf8c8d567eb99a4259a00ed7b7ade244ca9a1aa83931252"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/evm/src/executors/invariant/campaign.rs: crates/evm/evm/src/executors/invariant/campaign.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is foundry_evm::executors::invariant::campaign::fold_outputs at line 298), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(invariant): drop unexecuted input after complete runs (#18454)\u201D; \u201Cfix(invariant): bound shrinking by the invariant timeout (#18405)\u201D; \u201Cfix(forge): report interrupted campaigns as skipped (#17461)\u201D; \u201Cfix(fuzz): persist parallel invariant corpus (#16065)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/evm/src/executors/invariant/campaign.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/campaign.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d29d5758bf899acfdbf32324fa205f03c9e0ed84eaf6c4f83ae5801cbee53"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/providers/ext.rs: crates/config/src/providers/ext.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is TomlFileProvider::read at line 88), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(config): hint that profiles inherit default when \u0060extends\u0060 names a profile (#17827)\u201D; \u201Cfix(config): respect project selection in --fix (#17667)\u201D; \u201Cfix(config): honor the selected project root (#17469)\u201D; \u201Cfix(config): scope compiler overrides to profiles (#17454)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/config/src/providers/ext.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/ext.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eadbf6eec305d1edf5feefd14494388aab072b16437846c71c20501bf0d24ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/sol-macro-gen/src/sol_macro_gen.rs: crates/sol-macro-gen/src/sol_macro_gen.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is MultiSolMacroGen::parse_license_alias at line 216), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bind): display paths without debug escaping (#17533)\u201D; \u201Cfix(bind): check single-file bindings consistency (#17523)\u201D; \u201Cfix(sol-macro-gen): don\u0027t panic on a $ in a Solidity contract name (#16581)\u201D; \u201Cfix(forge): generate typed enum bindings (#16379)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/sol-macro-gen/src/sol_macro_gen.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sol-macro-gen/src/sol_macro_gen.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2074b39c92fd29d970ac20ec473cdb65f83cdc697fcbc8d5ae88dcb0667eaca6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cast/src/cmd/safe/transaction.rs: crates/cast/src/cmd/safe/transaction.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is SafeSendOpts::send at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cast): verify Safe transaction hashes locally (#18418)\u201D; \u201Cfix(tempo): resolve fee tokens on local Tempo nodes (#17327)\u201D; \u201Cfix(cast,script): resolve transaction networks more consistently (#16790)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/safe/transaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/safe/transaction.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f341a9c18496f5cc7a73fe6a974a6da43244147cc13a96335bb7e35ae54e367"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/debugger/src/soldb.rs: crates/debugger/src/soldb.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is foundry_debugger::soldb::write_bundle at line 725), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(evm): restore Tempo AA traces (#18385)\u201D; \u201Cfix(debugger): show PUSH values in the opcode pane (#18115)\u201D; \u201Cfix(debugger): restore terminal and validate --dump (#18035)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/debugger/src/soldb.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/debugger/src/soldb.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b7e0554019399b2cd4e7a12c3740682564fe4b0b345179e3ac3b27b4f1b30"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/symbolic/src/runtime/expr/cx.rs: crates/evm/symbolic/src/runtime/expr/cx.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is SymCx::mk_bytes_kind at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(symbolic): consolidate account, address and storage fixes (#18368)\u201D; \u201Cfix(symbolic): memoize nested ite normalization (#18169)\u201D; \u201Cfix(symbolic): model aliasing for large storage offsets (#18057)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/symbolic/src/runtime/expr/cx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/cx.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a47a8eb75f94b8a98dfed13f72375b8af71b5e5c1f348e54285de6136847373"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/anvil/src/service.rs: crates/anvil/src/service.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is BlockProducer::poll_next at line 181), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(anvil): enforce strictly increasing block timestamps on default path (#17373)\u201D; \u201Cfix(anvil): retry ready txs left by full blocks (#17266)\u201D; \u201Cfix(anvil): restore txpool on snapshot revert (#17044)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/anvil/src/service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/service.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"85de12649c66011186924af941a5bf205b90f9cf217d20287972226128f5ba92"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/forge/src/cmd/snapshot.rs: crates/forge/src/cmd/snapshot.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is forge::cmd::snapshot::diff at line 463), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(forge): include the tolerance boundary in snapshot checks (#17658)\u201D; \u201Cfix(forge): reject overflowing snapshot values (#17420)\u201D; \u201Cfix(forge): stop reporting a false diff for zero-gas snapshot tolerance checks (#16565)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/cmd/snapshot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/snapshot.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"875845065020a221ae5a43478cbe64074445158d1d28ea4132614bbc356b3ccd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/forge/src/symbolic_regression.rs: crates/forge/src/symbolic_regression.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is forge::symbolic_regression::plan_symbolic_regression at line 192), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(symbolic): build svm calldata from the ABI and replay svm values (#18387)\u201D; \u201Cfix(forge): restore symbolic regression storage (#17161)\u201D; \u201Cfix(forge): preserve symbolic regression caller (#17147)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/forge/src/symbolic_regression.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/symbolic_regression.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc47a4e705db1b3856ecf11dead39c88c780f999ed70af35812783bd0a5802c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cheatcodes/src/env.rs: crates/cheatcodes/src/env.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is foundry_cheatcodes::env::env_default at line 280), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cheatcodes): redact env values in errors (#17724)\u201D; \u201Cfix(cheatcodes): surface parse errors from envOr (#16924)\u201D; \u201Cfix(symbolic): make vm.isContext honor the actual forge execution context (#16743)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cheatcodes/src/env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/env.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e08e3c96d97ee223b8ff54c69e45292ec1c1b299ed02403642c08e8f9d2a4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/script/src/receipts.rs: crates/script/src/receipts.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is forge_script::receipts::check_tx_status at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(script): warn while waiting on a pending receipt (#17977)\u201D; \u201Cfix(script): stop polling after an invisible transaction (#17603)\u201D; \u201Cfix(script): reject foreign or incomplete receipts (#17439)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/script/src/receipts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/receipts.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd936dfb7f339d95914203299a0657cbd51b84d7cfbe448e2320e74b9d7799b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/evm/coverage/src/analysis.rs: crates/evm/coverage/src/analysis.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is SourceVisitor::visit_stmt at line 322), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(coverage): track nested ternary branches (#16828)\u201D; \u201Cfix(coverage): anchor lines before branch bodies (#16836)\u201D; \u201Cfix(coverage): track both Yul branch outcomes (#16835)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/evm/coverage/src/analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/coverage/src/analysis.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c08a2116c51a2b27c376cee5c69134be0a7096c467990970f17296c289c766"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/src/utils/cmd.rs: crates/cli/src/utils/cmd.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is foundry_cli::utils::cmd::print_traces at line 337), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: revert automatic foundry.lock enforcement (#16863)\u201D; \u201Cfix: enforce existing foundry.lock (#16817)\u201D; \u201Cfix(forge): install missing deps in source commands (#16722)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cli/src/utils/cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/cmd.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b144e4bbd78e8ee7262aee651de18888b8b296e0e5494446677aa9bfeb0612"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cast/src/cmd/interface.rs: crates/cast/src/cmd/interface.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is InterfaceArgs::run at line 66), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cast): fetch impl on cast interface (#17153)\u201D; \u201Cfix: revert automatic foundry.lock enforcement (#16863)\u201D; \u201Cfix: enforce existing foundry.lock (#16817)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:19:29 \u002B00:00\u0027 --until=\u00272026-11-14 13:19:29 \u002B00:00\u0027 --full-history --no-merges -- crates/cast/src/cmd/interface.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/interface.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff96d2bcb5eb84dd09a9ee8e7ee24d235623959e38a02f4d872e820fbce8f69"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: crates/primitives/src/transaction/base.rs, crates/common/src/transactions/broadcast.rs, crates/anvil/src/server/mod.rs, crates/config/src/resolve.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4bf5787fd69f362605e9bb51eb4bbf1ee2750a68e70b8ebec1f543d01df5a9e5"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (9 single-owned of 566 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 566 of the 731 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/evm/symbolic/src/runtime/solver/smt/mod.rs, crates/evm/symbolic/src/runtime/solver/normalize/polynomial.rs, crates/evm/traces/src/erc8021.rs, crates/anvil/core/src/eth/serde_helpers.rs, crates/common/src/external_storage.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally we want the name of the function here if sig is calldata \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":"crates/script-sequence/src/sequence.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1416bac4ac9d2f5a300e73ab6d933ffd926545215a6ec82e23311ed7517059a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: if the current sender is the default script sender (which is a default value), we \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/runner.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46caace1096b85d5c4c914360dde241d7549dab10f1da56ad8a4ad4521eacfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dani): the specific case of \u0060if (x) continue/break\u0060 is not properly covered. \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":"crates/forge/tests/cli/coverage.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4adf5ab0823e4f1b7d160a3dcda98d3e5e04fccc604291e046eeca2f9ecb41d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: make sure original fmt is not changed after projects format and rev available. \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":"crates/forge/tests/cli/fmt_integration.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e472d5d7505405dd70b8750ea8a0bf15e209bd601fa66870f5257b3f3546dbf9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \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":"crates/forge/src/lib.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aec5ded37c2957a3d0d2c72e7d7b2f74caf16c26af56833d28c4065973fd68a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060self.evm_opts\u0060 and \u0060self.evm_env\u0060 are only partially reconfigured. \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":"crates/forge/src/multi_runner.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7fe1322143aeb6fca034a2be5e9d3e23ee15041742f2d5b6b76190a8da0b70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060--legacy-peer-deps\u0060 flag is required waku dependency conflict resolution. \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":"crates/forge/src/cmd/doc.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59b35b0b59087f66793a60db6b8561ee08da98abe05bb0e1b74326df7c36092"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: evaluate if we can relax the conflict with replay_symbolic_artifact \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":"crates/forge/src/cmd/test/mod.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ae7d3a29e3897cabfbfd1c34af76c30d64011984b7e038521bf9945b90a7d0"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: heuristics: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fmt/src/state/sol.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d3708534f5ef0d097e256a28c2f4dfa418c09329211bbc4bc3b4173d48cf7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: alloy parser treats user-defined types as uint8: https://github.com/alloy-rs/core/pull/386 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/debug/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9c76dd73e34a8f6c9b25da65e005e91904cc2310c291b09b80b6449c8d70e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do we want it to be 80% chance only too ? \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":"crates/evm/fuzz/src/invariant/call_override.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c882c374dee29229bfff80f730f20aad63636b040879fec816e3f577084c61ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(monad-fen-lifecycle): Remove this argument after the backend\u0027s Monad fork-position \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":"crates/evm/evm/src/executors/builder.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e714e33a4b6b38808295b0a6b9d5270bfaa3364495d2bd27f025518a4f27e96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dani): currently only master syncs metrics? \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":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f1f46849a2a82650e6420d604901d7057db11043a423ec0f70aafba442e99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: dedup multiple distinct \u0060assert(...)\u0060 within the same \u0060(reverter, selector)\u0060 \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":"crates/evm/evm/src/executors/invariant/error.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c9fe275b90e0a97db8a845e8d3cb7c7069b3b1e232a7df3acb78c5d3b7d655"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dani): (pre-existing) conflicts with corpus metrics \u0060set_message\u0060 \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":"crates/evm/evm/src/executors/fuzz/mod.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d6774e79376f3e372420cc7e4b19ee7c4075063e823e7d38edf7668e13c5a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \u0060#[cold]\u0060 and call \u0060std::hint::cold_path\u0060 once stable. \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":"crates/evm/core/src/utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30e20c0c4f2cf5f2b76a74ebb4e9b44948c86a3779d884e22286fde4bf5faa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We don\u0027t yet have a way to deserialize other outputs correctly, so request only \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":"crates/config/src/lib.rs"},"region":{"startLine":2385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a93f7161c889f5ce4f8a3eb416ff98be17e9b17f246bf998a5dabc10a5732"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///         todo!() \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":"crates/config/src/macros.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d0dc7173fe3423ec0ce3ba8e16b7cda8f29d41bf98b093ca906380459872dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///         todo!() \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":"crates/config/src/macros.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e527bdc55146ae2afc62069de03bce3c6fb9902ad775eb9246e06032e4419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Why do these exist separately from \u0060Config::load\u0060? \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":"crates/config/src/utils.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e847b978b769239d9d82a2f93a3b305b7558431c8a701c691c8d12de4fc470"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid using std::process::exit(0). \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":"crates/common/src/compile.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"800452bce5760d2f2a9b9e6ed5c235cc6c08a192e1fd1b97e8baaf08304dc00b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect vyper \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":"crates/common/src/compile.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead96e14fb3623aa5d9b18086e9bee9973b68821c6522685319c1c8018b60a50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: stdout is the canonical machine-readable result of a command and should NOT be \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":"crates/common/src/io/shell.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b93ccd5b655a63acf30fa2d812c59d9f243cd8963ec08e001de339f52d0e368"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add \u0060known_contracts\u0060 back in. \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":"crates/chisel/src/dispatcher.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78ad6915d0ce3d36fbae066425b0c0b2318e94202bc9710e079dcd5c93af1f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verbosity option \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":"crates/chisel/src/executor.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb3ea2d9816c791ed65c3376a339cbe2086ff80f5d40c4c8717664d79fc1b7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verbosity option \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":"crates/chisel/src/executor.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a936cd0bdb2b6ee5af2b3ec0bae454355cf3d1719c568b74c12dc817adeea9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: mimics \u0060get_or_try_init\u0060 \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":"crates/chisel/src/source.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fb2eb1ea01a9cd0dde9a7ca7d28ab90a6d5d00fa93a809829e2c52e6226c9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a better name for this \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":"crates/cheatcodes/spec/src/cheatcode.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2136f7e078b49a159f87cee88a8b7224174ae959ba2af7739b9c43fcab36e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this check once browser supports T5/T6 KeyAuthorization fields \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":"crates/cast/tests/cli/keychain.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e30e1c931f3b88f3adfa43e04e2eaeb807691fa1fbbff088973a718ded1ede5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Restore exact gas assertions once native Avalanche accounting is implemented. \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":"crates/cast/tests/cli/run_networks.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3a354ae09f3059220ddd9e210e3d22e9362c7850d5fb47a116a43485586424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(OSS-160 follow-up): browser-wallet KeyAuthorization signing still needs a"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28b7ed266db5bd5929231e28682420daec0c5f83572e3d67e1dde976320fd33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this check once browser supports T5/T6 KeyAuthorization fields. Guard before \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":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"931a434a8e2e16dadf85c04207d2f5698eb80a943ac742352c3e934bb46b4359"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once the browser wallet serializes configurable account key authorizations. \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":"crates/cast/src/cmd/keychain.rs"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b2e561cd1016162907dcd67c6aeb9a318fbd12abc4a3baac5bd25679af7eb4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this is a hotfix for \u003Chttps://github.com/foundry-rs/foundry/issues/7682\u003E"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/logs.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c7a564f7c2e6a80b524721b0bd27b0a7dbc66d6a1411da4d4954f10a2407ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Awaits endlessly here. \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":"crates/anvil/tests/it/fork.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9366db52808791d8a2eebc39b53e9aae7e707108f33c304cb653935d57811f12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use .legacy() in tx when implemented in alloy \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":"crates/anvil/tests/it/pubsub.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f1758fab6c0336e80a928c311bd4fe4d47511b61ab68928247c93054b078a9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use .legacy() in tx \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":"crates/anvil/tests/it/pubsub.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb3a0bef4a503fa3cfe8372b40fbebeb83bc903969732602b20e87616e4a23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use legacy() in tx when implemented in alloy \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":"crates/anvil/tests/it/pubsub.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1b49080b4fe21ceb2dbcca4a2e98e1e3c58ad7196892d3a4845b8cf8ae64b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use legacy() in tx when implemented in alloy \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":"crates/anvil/tests/it/pubsub.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8413b608f486127cf86c3a650e509a6367709fb34759a032f0f2625d29b6bd23"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use legacy() in tx when implemented in alloy \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":"crates/anvil/tests/it/pubsub.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7541d238976d65cfa5c8acd919721d127a035cd34f0d30901142e17e4fc09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Needs to be removed. \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":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"007af513e14ca4d36e4cc9704645e37f51aadd773ad72356ccbd0a0b5336fc26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mattsee): once we have multiple Backend types, this should be turned into a trait \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":"crates/anvil/src/eth/backend/info.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"044910a0b5f96c65ead485790153eed29869d3ed3fa675acffda13f96bd4302c"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/solar/Cargo.toml\u0060 makes this repository a deployable product (line 16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/solar/Cargo.toml"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2548cdd2e6585ae5005825f65126c62a197b2706dfdfe42d8dde05bf4417d7"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 5 of 36 project(s) overshoot their size bounds, lowering Project Cohesion to 7.2/10. The most over is \u0060crates/anvil\u0060 (42315 LoC, 182 module-visible types across 13 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d1047a04c6983a8f32d9a903749999e4ff242bdd8cf5863a84bf8f211612fb5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6dd37383d9639c9285a24b91d5e416482f5fe6201e7e9f4a3d66114134058f1d"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f96684d04e94ec63d9833d630258b0156f2351305797cd43385304b1cb00fc6"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa364eebbcc5c6a075895b44e163c1326fc7b8b48341d865b989ca29be0b2337"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e4cf16e0c7935e714322d976689275656dbba8c715825d50211c2354166ae7b"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41ef38f12c7e6f88c726b7064752d22dee2dafcd1974460ad4d8a2d31087d87e"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"9.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ce8d56970d144893b065995d9617fe9ed88a1b4e3bf1580ec9b541a7d5978d87"},"properties":{"dependency":{"package":"@azure/msal-node","version":"5.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa275dcc581e31816223ff250817b0083925776ca9db8bc9a83879cc85b97f8d"},"properties":{"dependency":{"package":"derivative","version":"2.2.0","advisory":"RUSTSEC-2024-0388","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb6c554cfdd729faa556f1aa9ecc479924f58d21610ee22582dde70a4a0aa521"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8546a04f58acc996809e0fb2bac6f5f38c99e28ec37179d4f08f38edf7eea89"},"properties":{"dependency":{"package":"qs","version":"6.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"4d7da47099289bbdbbe62a668c4d3a1573e4ce5b9d01de97b34c9aeacee8e265"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"bc14975a8f09bbdda80d6dbe37eb1f00f560e651271fa4479b48630dfff4edfa"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.7.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.36.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.1","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62ba3f391b97d680ac34e630794a6a7fc0f3b16bd44bab9e323085ff4fa2c944"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 566 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 566 of the 731 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/forge/src/brutalizer/assembly.rs, crates/config/src/compilation.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/brutalizer/assembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f9a8850b493ac7c8e90ea679b557482fb653bd5718c7a38938420564e3463"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/compilation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f1df9f4444c724ca18c7e9eacba50c1be6e2d8d0216bf8b8949ea25cb442f5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mktx.rs \u2194 send.rs: \u0060crates/cast/src/cmd/mktx.rs\u0060 and \u0060crates/cast/src/cmd/send.rs\u0060 change together 80% of the time (28 of the 35 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 28 shared commits counted here, the most recent 3 are \u0060b8eadaa9\u0060 feat(tempo): detect configurable account senders in cast and forge (#\u2026; \u0060b18a091f\u0060 feat(cast): Tempo configurable accounts in cast wallet (#18378); \u00607d1c2338\u0060 refactor(tempo): decouple wallets and mpp (#18095) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/mktx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"436f97afc8cc274bd18c87b500d954da3ffe805c470338fd3169aadf500d3c6a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: access_list.rs \u2194 call.rs: \u0060crates/cast/src/cmd/access_list.rs\u0060 and \u0060crates/cast/src/cmd/call.rs\u0060 change together 68% of the time (15 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060e65dedad\u0060 fix(cast): use --from without unlocking wallet (#17404); \u00602494dc85\u0060 fix(cast,script): resolve transaction networks more consistently (#16\u2026; \u006022931fe9\u0060 fix(cast): complete browser wallet restoration (#16015) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/access_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6432e98e3fe1bb48bf8e8ff833778ce0012b7798e0b2dd511e3112a6c5be33"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: eth.rs, op.rs, tempo.rs: 3 files \u2014 \u0060crates/evm/core/src/evm/eth.rs\u0060, \u0060crates/evm/core/src/evm/op.rs\u0060, \u0060crates/evm/core/src/evm/tempo.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/eth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1d335c91dc3d7d815c80acab84722f0e95ac43c1232751b5bb0d8f50c24183"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: calldata.rs \u2194 invariants.rs: \u0060crates/evm/fuzz/src/strategies/calldata.rs\u0060 and \u0060crates/evm/fuzz/src/strategies/invariants.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060f8798eb7\u0060 perf(fuzz): reduce inactive inspector overhead (#15380); \u00607ba38c2f\u0060 fix(fuzz): bound enum inputs to valid variants (#15375); \u0060e8e36e38\u0060 perf(fuzz): remove locks from invariant dictionaries (#14806) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/fuzz/src/strategies/calldata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"849bd7c49c4f7a8e3c785736e431f9be63c998942b1c7d3fc0b32c903d82efff"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: handlers.rs \u2194 mod.rs: \u0060crates/anvil/src/server/beacon/handlers.rs\u0060 and \u0060crates/anvil/src/server/mod.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e783a509\u0060 refactor(anvil): make EthApi generic over \u0060N: Network\u0060 (#13751); \u0060b6d41bed\u0060 chore(anvil): tidy up \u0060anvil::server\u0060 module (#12663); \u0060a3355751\u0060 chore(anvil): deprecate \u0060getBlobSidecars\u0060 Beacon API endpoint (#12568) (at that commit the file was still \u0060crates/anvil/src/server/beacon_handler.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/beacon/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc92b50dee8260f7c8d66a170f2b2a7fd0230fcc46230fc43a435ccc45057036"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: batch_mktx.rs \u2192 keychain.rs, send.rs, broadcast.rs: \u0060crates/cast/src/cmd/batch_mktx.rs\u0060 changes together with 3 other files \u2014 \u0060crates/cast/src/cmd/keychain.rs\u0060, \u0060crates/cast/src/cmd/send.rs\u0060, \u0060crates/script/src/broadcast.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/batch_mktx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6a7ccf3e3b65d3f8669793f3862949b5baee9c8e9a5191daa7262269e054d0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: tests.rs \u2192 keychain.rs, send.rs, create.rs, broadcast.rs: \u0060crates/common/src/tempo/tests.rs\u0060 changes together with 4 other files \u2014 \u0060crates/cast/src/cmd/keychain.rs\u0060, \u0060crates/cast/src/cmd/send.rs\u0060, \u0060crates/forge/src/cmd/create.rs\u0060, \u0060crates/script/src/broadcast.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/tempo/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"113c5960f88f486c3d675a7d9c459d10711d99868530719e41336947a71e07c6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 lib.rs: \u0060crates/evm/core/src/fork/mod.rs\u0060 and \u0060crates/script/src/lib.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060fd6f899e\u0060 perf(fork): prefetch the state of simulated calls (#18247); \u00602b4b0553\u0060 refactor(fork): let backends own fork preparation (#17376); \u0060587f37b9\u0060 fix(evm): preserve exact fork ancestry (#16131) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f844d305073d83a3f2ccbfb02706456abe97d5b0a5f43017b09c2d74578f17de"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: call.rs \u2194 estimate.rs: \u0060crates/cast/src/cmd/call.rs\u0060 and \u0060crates/cast/src/cmd/estimate.rs\u0060 change together 55% of the time (17 of the 31 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u0060e65dedad\u0060 fix(cast): use --from without unlocking wallet (#17404); \u00602494dc85\u0060 fix(cast,script): resolve transaction networks more consistently (#16\u2026; \u006022931fe9\u0060 fix(cast): complete browser wallet restoration (#16015) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"843cb616dd67dc3543bedf1ec16038fee2d980f0af191328c0e09038629d6708"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: macros.rs \u2194 util.rs: \u0060crates/test-utils/src/macros.rs\u0060 and \u0060crates/test-utils/src/util.rs\u0060 change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060ea7b1546\u0060 test: log TestCommand exit status, output (#12137); \u00600d830288\u0060 feat: snapbox migration (#8728); \u006084d98427\u0060 test: improve external tests (#6991) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-utils/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f94258ffbacb4c668c5bb3b0029be5603c59b57d9df2a7738bdbfc86f887649"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 sourcify.rs: \u0060crates/verify/src/etherscan/mod.rs\u0060 and \u0060crates/verify/src/sourcify.rs\u0060 change together 51% of the time (18 of the 35 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u0060f936b23d\u0060 feat(forge): verify external factory deployments (#15863); \u00600a2d4cce\u0060 fix(verify): keep create --verify stdout clean (#15636); \u006082a76b66\u0060 feat(verify): submit to Etherscan and Sourcify in one go (#15124) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/etherscan/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"559c2498cf8bb023235b21770c15ebf11bb06543940542dd822c4fa4beeeb100"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 flatten.rs: \u0060crates/config/src/lib.rs\u0060 and \u0060crates/forge/src/cmd/flatten.rs\u0060 change together 50% of the time (15 of the 30 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u00600e519ffd\u0060 chore: tweak coverage warnings (#9814) (at that commit the file was still \u0060crates/forge/bin/cmd/flatten.rs\u0060); \u0060fbad377a\u0060 bump compilers (#8011) (at that commit the file was still \u0060crates/forge/bin/cmd/flatten.rs\u0060); \u00600a4d2462\u0060 feat: optimize compilation by reading AST (#7599) (at that commit the file was still \u0060crates/forge/bin/cmd/flatten.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27aaab37a130305e530f1cb5cf76e3230d4a77a539fdd762cd5ab9228aaece5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 replay.rs: \u0060crates/evm/evm/src/executors/fuzz/mod.rs\u0060 and \u0060crates/evm/evm/src/executors/invariant/replay.rs\u0060 change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060b3ccaf9f\u0060 feat(forge): show fork block on failures (#16179); \u006092a84f51\u0060 fix(debugger): identify forked contracts in debug traces (#15048); \u0060e8ad9407\u0060 refactor(evm): thread \u0060Network\u0060 through \u0060Executor\u0060 (#14095) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/fuzz/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e0739b1aea1cd3202d1aa7567bec9410a9add193e5df0f8b059788a06de0be"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: erc20.rs \u2194 mod.rs: \u0060crates/cast/src/cmd/erc20.rs\u0060 and \u0060crates/cast/src/cmd/tip20/mod.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006063ce1f29\u0060 fix(cli): estimate Tempo WebAuthn gas (#15935); \u0060637b8d4a\u0060 fix(cast): honor sync for Tempo access keys (#15930); \u0060043d28e2\u0060 fix(cast): allow remote sponsors with Tempo access keys (#15920) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/erc20.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65041014f2fd0e48cb4791ba33e87ba500ae7c0baf4030a13c49ff3c0de0fdd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 showmap.rs: \u0060crates/evm/evm/src/executors/fuzz/mod.rs\u0060 and \u0060crates/evm/evm/src/executors/showmap.rs\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060561ab83e\u0060 refactor: remove dead code from shared and evm crates (#17339); \u0060195561fe\u0060 fix(fuzz): enforce sender policy on corpus replay (#17274); \u00604939d803\u0060 refactor(evm): reuse resolved tool addresses (#16553) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/fuzz/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ebd0c78871c8488510973b0222ee8d4a14645ce24c449c53e4bc0bb9042a3b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: prank.rs \u2194 script.rs: \u0060crates/cheatcodes/src/evm/prank.rs\u0060 and \u0060crates/cheatcodes/src/script.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060c16acc2e\u0060 chore(cheatcodes): relax \u0060DatabaseExt\u0060 bounds to \u0060Database\u003CError =  D\u2026; \u0060e2f8ef2b\u0060 refactor(evm): relax \u0060Context\u0060 bounds in \u0060cheatcodes\u0060 (#13725); \u0060e1f83573\u0060 chore(cheatcodes): relax some bounds to \u0060FoundryContextExt\u0060 (#13656) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/evm/prank.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f0f0106a46b3cdbb5d89ca3adb3ebdf27d281e3285ea4d9e4f287321ef7499"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62be97213ea1339ea93e68cd49976dbbfb107e2c5ea1b399592920d493df1c5e"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"598500d32721cb57062266f95170a82054cd734a71feea7b3f25b8a34cf3acf8"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 21/22 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/safe/service.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9059c5bd4e346b8d6ce92a56cc3123eb2585138bb63db1c98f4140cc72029f81"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"30068062c6025ff622e83da5a5d077d386bd7a0e79259dd320b0072d0f0771d5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/exploit.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec0c3df7c7646f3db8577c4aded9d754b000c01b850ce1593a5e4997e38224d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060setup_fork_db_config_with_replay\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/config.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd6c52da7f25451965a218ea1f79a2a09045849b606425542393af521c27c5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!build.compiler.extra_output.is_empty() || !build.compiler.extra_output_files.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/forge/src/cmd/inspect.rs, crates/forge/src/cmd/selectors.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/inspect.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b1bc1c92dae19d9f7e8391c5018c8b60597bd0a95ce6ee1f803cc2d5571f9d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!matches!(outcome.status, CallStatus::Success) \u0026\u0026 state.expected_revert.as_ref().is_some_and(ExpectedRevert::repeats_with_reverter)\u0060 appears character-identically in 2 files \u2014 crates/evm/symbolic/src/executor/cheatcodes.rs, crates/evm/symbolic/src/executor/create.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fff57d9bd5a7df4792280af768d333aed1ca9d59ab600fd120f0c4cd23d140d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!output.status.success() \u0026\u0026 output.stdout.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/forge/src/cmd/exploit.rs, crates/forge/src/cmd/properties.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/exploit.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e37876beaa4f6498f65e1109fc30a738bcbdb50c52e5c8e178640f2cd82725"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.symbolic_gas() \u0026\u0026 expr.contains_gasleft()\u0060 appears character-identically in 2 files \u2014 crates/evm/symbolic/src/executor/calls.rs, crates/evm/symbolic/src/executor/constraints.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/calls.rs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e97e168921964658d7d3af0a0b004a0a91f468350ceca6efba52ceb6de4d026"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!var.kind.is_state() || var.is_immutable() || var.is_constant()\u0060 appears character-identically in 2 files \u2014 crates/lint/src/sol/high/arbitrary_send_erc20.rs, crates/lint/src/sol/high/arbitrary_send_eth.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f88e38c4aa5e5ce426a1c88ce54d95b92912c1cecba69979b8b05d83af1a68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060change.created || change.current.is_none()\u0060 appears character-identically in 2 files \u2014 crates/evm/core/src/evm/lifecycle.rs, crates/forge/src/result.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa1b6a346e4c249ed80a1a364fca8a47bc75a57026cbe87caac93554171b1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060contract.kind != ContractKind::Contract || contract.linearization_failed()\u0060 appears character-identically in 2 files \u2014 crates/lint/src/sol/high/unprotected_initializer.rs, crates/lint/src/sol/low/missing_events_arithmetic.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/unprotected_initializer.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1dec45069e9254813c23a6a6794420e978aa7b8299ddb66318a586a56b3736"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060delta.original.is_none() || delta.current.is_none()\u0060 appears character-identically in 2 files \u2014 crates/anvil/src/eth/backend/mem/in_memory_db.rs, crates/anvil/src/eth/backend/mem/state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2578b4d103c6e65fefc0daf4f07622cf8463802c9201347c8fb6a9aafaf4e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060evm.state_mut().account(address) \u0026\u0026 account.exists()\u0060 appears character-identically in 2 files \u2014 crates/evm/core/src/evm/lifecycle.rs, crates/evm/evm/src/inspectors/stack.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/evm/lifecycle.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"439018c67487f7d867aa8f7c2b209aa6b04cecc9269e7d9845e426b6052fb027"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.error.is_none() \u0026\u0026 frame.revert_reason.is_none()\u0060 appears character-identically in 2 files \u2014 crates/cast/src/cmd/call.rs, crates/cast/src/rpc_trace.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/call.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba3ff110658841add5c68468be26189e3f9696fd00d92860808f07e76692c2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent.header.hash == parent_hash \u0026\u0026 Some(parent.header.number()) == block.header.number().checked_sub(1)\u0060 appears character-identically in 2 files \u2014 crates/evm/core/src/backend/mod.rs, crates/evm/core/src/evm/tx.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eba1be4962dbe5ab8afd61242ecaaeab716c74d6d28b0e81bc1643a029e3de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.get_fork() \u0026\u0026 fork.predates_fork_inclusive(number)\u0060 appears character-identically in 2 files \u2014 crates/anvil/src/eth/api.rs, crates/anvil/src/eth/backend/mem/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2293bb34b6d836c723e052ee1b2d3a69f8d20c96971815fe4a43c3e4f755635"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.tx.tempo.is_tempo() || self.tx.tempo.session_id()?.is_some()\u0060 appears character-identically in 2 files \u2014 crates/cast/src/cmd/access_list.rs, crates/cast/src/cmd/estimate.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/access_list.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"14798cc04bcf04dc8125438fd1daee61f0b91dc0927d0af96364bb1262b1dc34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060setup_fns.len() == 1 \u0026\u0026 setup_fns[0].name == \u0022setUp\u0022\u0060 appears character-identically in 2 files \u2014 crates/cli/src/utils/cmd.rs, crates/forge/src/runner.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/utils/cmd.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edce9a1817b2eef594f95f9226b074b18f5ce3846a473b26e64d30dce99ea7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060then_value == U256::ONE \u0026\u0026 else_value.is_zero()\u0060 appears character-identically in 2 files \u2014 crates/evm/symbolic/src/runtime/expr/bool.rs, crates/evm/symbolic/src/runtime/expr/expr.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed8fec899e4d3dbbd098d6c72d263ba2ee8adb21c29915db70dc61c77fa0532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060then_value.is_zero() \u0026\u0026 else_value == U256::ONE\u0060 appears character-identically in 2 files \u2014 crates/evm/symbolic/src/runtime/expr/bool.rs, crates/evm/symbolic/src/runtime/expr/expr.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/runtime/expr/bool.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cf9959ab20996e4d61d750e4db01abd744e68cd7ce733b25ddb41657cc975f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tx.tempo.sponsor_url.is_none() \u0026\u0026 !tx.tempo.print_sponsor_hash\u0060 appears character-identically in 2 files \u2014 crates/cast/src/cmd/configurable_key_auth.rs, crates/cast/src/cmd/wallet/configurable_account.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cast/src/cmd/configurable_key_auth.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2b8d1df98cf51641cf9195ca128827d4a802349bd1b877d25bfb15467c9421"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060underlying_var(self.gcx, b) \u0026\u0026 self.is_safe_target(v)\u0060 appears character-identically in 2 files \u2014 crates/lint/src/sol/high/arbitrary_send_erc20.rs, crates/lint/src/sol/high/arbitrary_send_eth.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lint/src/sol/high/arbitrary_send_erc20.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a7c6274ae21ada2484ab0cdf73dbc94cb32885942a957dc8db5c66711c7a1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 686 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/bytecode.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"314b54568fec388a63e2907459d6947d2535e305a846a5fdd9d530e70b15cb6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 991 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/bytecode.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc513f88de4840451a3f6f16afffd723ebf0ea87b3b8aeb28c6d821c380ae37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 845 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/verify.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b9b45d05509491e6d4314946d754892aa8ffed593a6660bfd2bb408a2f5784"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 231 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/verify/src/etherscan/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"080053efb7ea1c6ce041f8cedacd6c91a6ac1d5a44c10d163221332f438e3619"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 149 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7307e81fe8e8cf434d4a0196c5c5425887f3cb970fae1408f89a494231cebf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 332 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"da79d07b352478a868c338cdf643f78588de23f7961956105436936952eccbf0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 337 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/broadcast.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2d1af986c6160e81735542cacfc3e7a62256765f2675d3d4a0b085b0854912"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 244 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/progress.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cace56cf6ea811fb0994e3cfa1639f174b1d1f8a06e675d9db5fdb03dbebcc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 759 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/simulate.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7dad5574bdcaf4c90ac332b89d94f82edff045e2394d867177acd60373e16"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baddf1bd5273a2ce07d6e0766ebbbd2ad393adb4d84e475825bcace31cc37d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 432 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bb8502c39198dde6b7c24ec8e2dd296df89b9f41508bf8773383f773600ddc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 585 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/script/src/verify.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d5186b0f43dd7b18eccbdb688ff571038a57542574e3f381ca96ad49b7b0a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 235 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/multi_runner.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c3515848c7d63df2ef6e7acc79223a852f74abd2f52d5516824ea1e8946880"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 982 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44da73fb1e639b94b391bca302b389176726575a25f2e45ceb7e32cc1286768"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1002 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/runner.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4994f0f2bf96ec698de15e94e88b9d42b68431f3fc76bf07baaa3103c64bc51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 943 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5e1902e2966efc0702a1c69124c7c826989a054b1bff39d82a318459d12e42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 954 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce343336347ebe7099de483814cf195df1d319fb5314eeb4250fc8cdd7a3cb73"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1087 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/clone.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a210c6f8b812ebebe0b7bfcdab7ef46fe2c90a47878b5b22e04e1f64a6b30539"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 168 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/fmt.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc54f756544ec56dcdd91bc9a67dbdc8d4b0216f9990d93bfb39bbcdc617ab88"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 83 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/cmd/lint.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfeb8324f76e4d5cd907ec1508d43c65e45bf178c3ec081590fc6e2a1746406"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 430 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"80418a598f05150ad80e7306b1a086cb1e6449ee05429614d66f544001b4c556"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 459 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4089dd0e00e73b8dda26b33278443ae2c270e4cfa48dc005bcd21dad925c8ed1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 469 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7406eec87c43f1164e8e1dab3d02634c2efe7c9cb8fd10ad6c5f1013c7520225"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 774 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/external.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"022b5451b6a65eaa6e4a3f4bda4c5bcbc18d16c8fe4c55928e93f0fed1e1f108"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 182 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/identifier/local.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c653598fdad6c810f52a1a7555d1ac6fbdeaf4826a1a78c488e6c71ca50972"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 69 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/traces/src/debug/sources.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"55773935a48512821099cee8d8bb461c0ae6e349703a53c4c78d8375beb12ace"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 280 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32db092d4353e3961d4e365418099522d5b105bf29da9bab9e301800dba7aba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 286 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2da72d1d93efa5e4e8505c23c526d04aa936a25607ef84b41b5602350710ba2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290696791ceb5fa1221c3d5b8b877c4daa90119e485e73808006571d3194c0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 296 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72335b31c804627394eef52c75fbabd82723375569ce6eb007ff2a25c9075af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 537 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb591532331084f7e1ab4cf3d78776ea52cc6fef45d56a175086c29f7786e92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 775 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1eeaa2f6843ad3ba375afacb5df12d08016583061968d994f39209f562b067"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 805 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bd6312a898a408c228fb470e7360b16ff75759fa440f90cb2465db9659cf10"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1233 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd53ec401f406de67cdc7236bf942eb6df929e2a8f69056ea4b6197de13818da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1303 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84a241d46854ee437855132d1842b69b21f02a450e6165f6de84d2625348809"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1305 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e5905641578a78eaf5911b80f84e1970008ef327e0845f9882bb1874c69f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1564 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9b1bc9ad2302b4d7fbd001284931304c80d31a4a9a4d5c28cb62993266b071"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1571 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca43d0cad2f85f09e28cc98a9f9c19eedbd8fef5118d2a508d9aa32fc105f220"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1577 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a145ad74cc7345773827479aee8cdbaf9745b3e7851e90c201f4fc2eedbef092"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1582 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe3a816750d21a5017747ea49cc43bc591f8e456aed78bbd30919d414b882cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1590 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75cb2e8eee2d4d8b183ae0c765a93d6d48e16e1fb6a02e32ccc289e36f113bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1685 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"e247ffed5949e588e98a8b6f380780bb6463da445e4876baa1eefd2e4fe23c0a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1688 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d5e562453ba9f4bd507d028c7ae527678fcae6977ac71c4b3d54a162a175af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1730 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd070ef8878e57a5747eddd026d44e61a044314cc04bcade7a14077c91748be6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1742 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b1047badadb447b9c1ce279ca9a9bdfcb828d9ee65f1495f06154762c9d3f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1778 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b835700f90990db43fc26b3dec1bba4909ce8c72a2522f2b69020bded05e4a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2097 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f24397b2641c21a5f18c1e2b8539251757c7ba90ab7e7bcd186c8d1ae1eab6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/corpus.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1566d28531a3539dcaa5460993bfb414adedef80ed21f382063dc048fb252157"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1115 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/mod.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3b0a6acd9ae29b8083b981233b899c2b4fee29e14aa5584805160731642719"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 317 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f8831878ce6542fefc4d026016fd35b20a6df96215ad8677bc5a76937c0ede"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 936 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"66511344326427dc88bd53b56e8ce1ffa390b564a475843232d0c97917153e3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1347 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb5e0c986df35007e0ff30adba93e278203ecce23006b26a45eebc84cc8e889"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1739 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/mod.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd02a8e0ce9ef2996254a572d2243575c2d049e1e38894b57d04b25c685612d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 582 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e774b76c935cf4d9d751e21a75fddf27fb7b82d53ed385999dd7282ca7dcf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d639e4e1baac2548fa6892c3262f0bb66fa29b4a0eaa2500e6f1be14f1430d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1295 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/executors/invariant/shrink.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"087228775ca9efa79102d7889c1573d7129b19602cf822ab367bfb8ac5deb91a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"57476f5793d5f46527c734dd5a25696fbb4b64c752faad4da34876ae4c228398"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 461 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb69b1b6008e25cd7297c988631b9d1dbdf7896fc6e668c30b887ae83524e506"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 474 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8ed00d718ad7f724c2b4ef69822eebc10d26ff440aa63626e7bd3cd407a940"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 624 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/fork/multi.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f35dcc9986ecebaf2d813cbbcfa92b3267dd6a16003048ec472bd3b74e0467"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1254 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"006423e4f776445dee5ae0ee5bf9053f509c3201ea92b76d047b48f384d75c24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1272 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/core/src/backend/mod.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30fff2a8f7cea410f2f100a0e1169b11e63ea0406dcb32ee4eadce2f91af43b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 95 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1befdb71788d5b2afab2b78d67ee97f5cc0d6294ead8b13acb61895be3fbf685"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 148 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f9ffab88a9b84fab708908d38ed531bbad298ffbf6f8028d5c03fe3a66b469"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 154 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a492cb69e277408b743d016f96584fe764fc33672b344608146947ec8207070"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 196 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"285d52eeae86db7fd754633d62de9bd6cc11d43ad1911c7caf937092b344e0e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 199 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"478caa74ee8ab6dac9b9467df0a8528ad95a7c27fb2676f7335c3cc8e4bfc4b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 223 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9db9ce7714681ca1422b2f8fc45c01b9e98a970c2c4567518cf944b8f1acf7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 254 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c988f671c6b7411d0dae34f6003ee99371ea508a1cf1c5de3e986d5c899c64f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 262 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e43997d54b6f7009e7813f950c20e5b89fc7ce1e348b928b4ff0335fcdd93dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 295 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f223044340399f3c0be118b8db14ed64232102c49118518ab64dc18a186ddaeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/builder.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"885e17bf4e652c0d83a4948711a30f38f74d422c4b4bb7e84f144229fd0603b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 102 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/hir_ext.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beb2135219b1a227ed8a385356e72ceabc15e61bf0c85997f08ebe881700e1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 591 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e040ca08a084d724bd85050a0b89c4a606bba81b617f23eacd59f161ac0707f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 360 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/etherscan.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"87563afd4c2f9e7c8e641907eee81133e7ee8974cf6f70faa8b508dd30ba4403"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 918 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/lib.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b7c836a428784ceeb1a9bee38d46ad3a6cf9e4d2b66ee62ea3c10af06933a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 234 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/providers/remappings.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882b488c5aee8ba5da4ba9fae3ec9e80f77ee417ba116a643a06f0b2d4ae901"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 391 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/compile.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de3d2aafb903292bedf3c8fa70f851b4a9734b97809555fbcb9b9102babcf3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 672 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/external_compiler.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2081441af868c32f35a32516a674e3efd57892b1946486d64948a107403e44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/retry.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"be97a644db9cf35a47e5483d0ecc249d27c061502e0d80e695fbb6410a989f5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 763 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"7865a45c6398d4ec8f1a8b7469c367cfd2d9d4dfbeaed6c869fe0dbb3815b53f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 788 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/slot_identifier.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd975771dab74196a5b54cb818e2657d229b61daea4aaac9db32085815d732"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 120 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1655ed86e20b04681ff9e0ac6614c408e1c60162763b10407da7a90a15a45dae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 157 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"332ab695ec526a2338c0275f03e581afeecd7ca8d64e872250205252c8052e9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de30c1e795ff6b0a19b2fcb3a9f1de1ae2b135bef14edb39a0bc77349dd909b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 540 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e27f60bdacb010ca1e78ab15215ae7c77fc97c5cc56fd2520024d62e876bbae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/handler.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6642a0390e2d6013793b989eee33532d9955ee8b76d74fd77da22a8719c292c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 210 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/args.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf33f111c31c46a26959134cf8a6bab224ca945b704a38db2bc9309fb0db4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 627 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chisel/src/source.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a05cba322bbb3d6913ff8005cf345bbb49972852d6a87800276c217abe90fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2724 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cheatcodes/src/inspector.rs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ada5388e43f7a4989ff5fd7b0568cb7b7af062a256ac9c164ed61a37410a2fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 58 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/filter.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9661b6b7e6f87cbe8903b65472f35d1d0af945fb702a5101bfcb1478860247b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 76 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/filter.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dfcf3896c0fdc34042c7d17af928f4a27a5c2b754ce4501e218421dd68c691"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/filter.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c00bb7046662072e33f6e1f167f5e2b6207f42029f0f5afb6ce5883dda3ab2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 90 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/service.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f58c80f6273eb493fe52d5ee0c212d048714adb3aa197d458c281e73f66850"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 218 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/service.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"db29c2220ba6d95066537187abe9febfb222b8d5e2b53d7da0fe4c7f9c70ae77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 67 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a3f3588e342d99b34448d2db1e03c42f3669944a1b5a195e8d7bce892bb06"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 70 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ce48ceb96ebb56753cdba4aeda8ad15c18fc4f436b691229826898f268275f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"290beb63909ca7cd6951aee31fdffd4de189cd4c15a350bdd4556b3900fa4b8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 157 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/server/rpc_handlers.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6065450e314b315b748ab1ae39a8fcacfcb8704dbc7c223e822c3e09354eae23"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 768 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"8367481b1a058ce10fb63dbfbd4ded7d6c34fa141c099c3aeee57ef9a371d4e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2224 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffded86f51c0e709d59b3d83f5f45699b82096ef757682b1606c81772765fd5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2281 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"661bd86e38eca62112aaf119f2a83454a576b966a69a74c2be84d34f4a4a5ba4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2870 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1c52a1afec17ceeb0bfddd3500a20c415ce6941b3e3d67e407bbb304b6cff3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 3641 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fd9abe588f17a65885b0ccb1638094ac8c8ab4c187ec51b0d1133bf89f1362"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 3807 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":3807}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b5ebeee38fa9803e1e7a8681fcb442ea756a4a06d4d48e0b553ab4ed6b33d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 5470 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/api.rs"},"region":{"startLine":5470}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b5466672dd05cfed8932bb2c016638f7bb6fc2b7f08bbcfa93ebc500928123"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 351 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/fees.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ea60b917fe8453389e01bca507cd18f98cbe8988e2d381830acfe75860db8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 357 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/fees.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"843978b3945c726f8e5a6cfa736230db720ac9ced4525471a5e87b486ec3167c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 553 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/fees.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4455279779ba29268b56b2d950c9ec1ce1a39054f3360385babcb15546ef75ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/miner.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8958bab2ee4490f0ebd2977ac38318b6afb98a29f2f93027da8666a04ce8a6fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 215 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39f5326ef1665ac8e1480e965d64134a0177475302f84f9cf735dc7aeff631"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 223 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b615eb6430e2e50891359db09c1386c913eace3a9541123e01a2eb445c0b51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 252 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee329046a195227a4ea3288db1e4b9fda4b6fd836c94ce79ecb1f6471a9a54d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52930a6ce69cf2cf8893157e3aa776a2348ca82f0b6a0fb81784e3dff2ba837"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 310 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74c205d2207d4dbef97200a18f7e6dc0b3cc04918d2c0ab9844afa0c7619061"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 424 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1c4c98288b76eab9dbee67ce6740118b9ec6d860396b956fe2fa2f62b2af75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 429 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd15597e1ffeb2bc5265e65a99953d9e6266f715390d8e210d8e4d7617f06a33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 443 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"c196060ae99c274b26656ed8431e9d690a012aaf38194cc43c6ecbf6e9fa4683"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 448 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5a67bc227e0ae33d1b374bf4ce31bdabaf890bcf7f89fa2c5444d7646e4cf9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 474 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7adccb3d4ddf1bc0a193afcbfa6815e6606356b8b1365a45d7652f414622e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 479 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0737a92d8a4081d46c815f14ce0441c2995f0ea5a588707b4a0d095ff1b5a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 496 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"935e865d69d9001a5c9f8fc50569ecb81bc692cb9d99437134d43a148b9710b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 523 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9544648a4c2535d5fba6c63a793b857e51077aa00e5839e6d5c6f85ee8523ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 566 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbc1f79d111173fb24cdd22e2e7681f6f46ad4f16da44f3e0f35ef84ebcc7a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 352 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/transactions.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aa47abcb594d7352bd7e9f9a76a02b46437f6634861357befe6dc4e1a4deeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 798 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/transactions.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a313baf7188a07816634d3d4e206edb386c4bf8a577edb8ba2e4d994e41a43ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 801 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/pool/transactions.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ee85b952b82b21628a8ac829090fb1a89ee503a19952d3dd4c75f0fdc3c0e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 54 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/cheats.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6758597d1c28d2cd05ffd25c72415c65ffb04215df83c8df543a822e301bff27"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 567 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ddcba2d4113b9d0f2b3b9154228c33599866cebfaf0b15af06d9ce51e079eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 575 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"703ce29bdb1518963e66781e8024d84a315d175e7c5f2eb61b6641b8be7b2594"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 589 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cfc072adc28b265592c3b3709d723a964501eca752ab439e01a5210b4ff8f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 604 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b326d7fa13c9694831ee29003b664c3c6e27271f123366d48c46f7f8244409"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 613 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c8bb065e3a2471eb508d344897e270a64aa7981ac6fcdbe1361e31df13303f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 648 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a085f21dbf6ba5718d319e9e4e6ce679953657e3c2bbae7b5a2e47717489c31e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 654 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2121ed1a97c92bc1f218bcedd399462d3f15d316cd38ea05f432a7ef4d37bcfc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 663 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f46855d1558a62b85ef45051b506ec6b3d9be5c443f08a104d338f51aa2b050"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 665 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5b72e1602acc88faeb9605fe630217e5407ae9e8e79c397d3271d1d6e9ad57"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 683 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"4643f95a61f64ca609e3a1ab0398ab0b46979a4dc19b6e9f45e8de932abe0a62"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 687 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/executor.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d734a93984b8ed6b63231591a711e97d9d13cc92896539302f8d4d91e2febee1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 301 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"76750327e605ace9032f65ecea33970083edbb830a1ea4dd830177e1d9e21fbd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 321 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051a563bfb292eea66a52faa749af925c38ef12aaf6e3080028b509acccecf5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 330 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3269c98023009e6673a96830f1fdc188405f292a7e99d6baeb1646049bf1b931"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 335 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fafdc7264ff40553dc9080fb889206695a8f594084932ebf4ead41492acec64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 344 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d397f8720ec7af5df6a7090f8541980fa50a900a298dac4790b8aa1aed8d1f83"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 672 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"11230bf05bd39d3a1652cde92e8b0cf2f0730c229e0f55ea79fbda21637ebb19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1013 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/fork.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"f054a28c6462bc72144f277d99e7af2d129f1b9cacb74d42aa223756e45b1528"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 156 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/time.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"81541c725c3ad6da42ccb0b857351cb598a9346ca4c4aa5ce24f9267eebaeafd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 189 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/time.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c5a362e382df8e446e2595ae7186d3726376c643013c7ade6f41afaad2d763"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 207 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/time.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99278200e0b3a48f913c4f6ceac492c18f88663f717cfd4b0bf3a828e0e55f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 138 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/fork_db.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0b9226104dd248286f6fc26ce6f815206178d5ce4d93f1a7767e786dce0e63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 146 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/fork_db.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f57c695091ee5777a7a98d62301058805542157ec30830917fc5c962054d29"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 154 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/fork_db.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"725231304b9beeeb87add441b8dc8a21a382fa29741b494f4840895d12a39a8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 630 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d46936e09082c084cc5eb5de69a3722302d53cb8c42f54744cb0746d70196a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 640 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ccd79cb0a6ccd6e86f2c6e97bcabe7281dd05150b102a6d4444491ddf03294"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 643 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/in_memory_db.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad08f9bfe2e19a7c04f4b0e679bc1fa1f8d085659baf86df584f5f78b9b3ef1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 471 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/inspector.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb91f3b072e7d4abb9192ac75c60d72abc9a1401ce05da5fc300a4e18ee5aca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 478 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/src/eth/backend/mem/monad.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7587fc15f4c9aa9f78c1177b67ebe0526864a70e468d9fedbd30bbcc8ec15d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redact_url_credentials\u0060 turns every \u0060Err\u0060 into \u0060\u0022[REDACTED_URL]\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/anvil/server/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ae0298af5e390b5f1f6e24bae01ffee425c5bf10d8aebaa4d7495de2e12363"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060using_dependency_sources\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/preprocessor/deps.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc08c77460d8c157fa3f258581b336a1746c0eff209760a5b9856f9cd7dcc0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redact_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Credacted\u003E\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c38e764bda85cce98e1e1ebb0c966648916e4225f065ce69817a14c794ba56"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redacted_url\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cinvalid\u003E\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/provider/mpp/transport.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceb2b2d554a5aca79b237fb185cfe9c2ae9953559fa4d12c1db8ed569a57e35"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060code_regions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/markdown.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e6264711f90e6e0f7d2a41e0126bb5830fe323b6bd7bc2fdbc7a7c5f1dc17"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fenced_description_regions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/render.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e2a7e753386686536b48db189185767fa0cd5f9fef74c0fe6607ba0100c42"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_deployments\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/doc/src/utils.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f435ae29da3c271122290dd3cb61d25b6443f30efc885e634543dd0c0b38f66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060free_address_write_targets\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/cheatcodes.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2af16e749efad2fb9192b6610822e82477131ecc1f6f893954f56a24df21ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060guard_fixed_memory_access\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/symbolic/src/executor/opcodes.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"035a49a309888eaf2b0e0b96a961e9494e6c1b5f1c0f82fb1466e5738c12c409"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060generate_mutants\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/mutators/assignment_mutator.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1c882936d9fa80fe8f917fbce0f964224a1be2e119fc1aaa4255f4c2ab925d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_mutation_exclusions\u0060 turns every \u0060Err\u0060 into \u0060Ok(MutationExclusionsByPath::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/type_analysis.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb5c37591d0f21b7e9b8676518fc92c3221ebbcd1037a94234e054652ecc9b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060analyze_and_collect\u0060 turns every \u0060Err\u0060 into \u0060MutationExclusionsByPath::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/forge/src/mutation/type_analysis.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1659c4fef6ddb42ed87e9ea570f52ab7dfc7d4f9f381214ff50152e250a990"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"}]}],"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":33,"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."]}]}