{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","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-1059"],"owasp":"A02: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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"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":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_app::analyze_application (cyclomatic 158): craft_anything_analysis::js_app::analyze_application has cyclomatic complexity 158 (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/analysis/src/js_app.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"696322e46285a0f98e29994368c9ffac2137f6640458e3c8ae58dff7007fa116"}},{"ruleId":"D1","level":"warning","message":{"text":"D::operator (cyclomatic 115): D::operator has cyclomatic complexity 115 (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/formats/src/swift_demangle.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b67f1273cceb43e04542f0c6b565d316f8e0042a6da6e376368a7ceb0b55bcf"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::ai (cyclomatic 107): craft_anything_ui_egui::settings_ui::ai has cyclomatic complexity 107 (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/ui-egui/src/settings_ui.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28961bbe32ff185edf33ab849c65a85a92aa476e72fa42d7c5d4f23806fbf3a"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::decode::decode_a64 (cyclomatic 102): craft_anything_disasm::decode::decode_a64 has cyclomatic complexity 102 (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/disasm/src/decode.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"40095f5048ca1d3875e74c985d74c70f140051e03c5b214a99b5d1053f230a73"}},{"ruleId":"D1","level":"warning","message":{"text":"Lifter::block (cyclomatic 95): Lifter::block 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/disasm/src/pseudo.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe536a01d79a59a21b0bdf26a2465a265180274f2210fb14f3624c0b57b72c1"}},{"ruleId":"D1","level":"warning","message":{"text":"FactVisitor::on_call (cyclomatic 86): FactVisitor::on_call has cyclomatic complexity 86 (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/js/src/facts.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd068cd640d2c313bf15dda0ad2029cab84ea71944c6c770ed3cb8887f3aa679"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftApp::handle_done (cyclomatic 83): CraftApp::handle_done has cyclomatic complexity 83 (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/ui-egui/src/lib.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4297333b6c00ebe1a35c4a4f5a9e3c94aa541ff418b1a218fc1e26eb211a19"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::decode::decode_a32 (cyclomatic 78): craft_anything_disasm::decode::decode_a32 has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/decode.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd3bd0203c139193f682cc3fb3e52f25098bfc55c20e2e8138a283b67ce8024"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::wasm::inspect (cyclomatic 77): craft_anything_formats::wasm::inspect has cyclomatic complexity 77 (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/formats/src/wasm.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117237437c954ef848341c337da982333a6228643b485e7414d2f0d13a78b8e"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::macho::enrich (cyclomatic 74): craft_anything_formats::macho::enrich has cyclomatic complexity 74 (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/formats/src/macho.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c37ec3dccb5732a5baf989faaa3e9746be2a0b978e58108dc4ccdaa9f7e61"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::analyze (cyclomatic 72): Program::analyze has cyclomatic complexity 72 (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/disasm/src/program.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19017dc220c58ea108ef74eb48e72caa620c433da87959f2c2fbad7834d1ecd"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::run (cyclomatic 70): Worker::run has cyclomatic complexity 70 (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/ai/src/rebuild/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"592e515e58296d7f2f99eb16053e76f30e601d3d1cea332791683d9ca0f677b9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::dataflow::def_use (cyclomatic 68): craft_anything_disasm::dataflow::def_use has cyclomatic complexity 68 (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/disasm/src/dataflow.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ee63a501f949773292a57e3cd1ae35b1daf6acec968cc090d6b98b6271c66b"}},{"ruleId":"D1","level":"warning","message":{"text":"Sim::step (cyclomatic 67): Sim::step has cyclomatic complexity 67 (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/analysis/src/java_decompile.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f06c7549bcef7a28a71e1528f3362d2eb71610ac8cfc7bb249c8e190236b69"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::evm::analyze (cyclomatic 67): craft_anything_formats::evm::analyze has cyclomatic complexity 67 (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: craft_anything_formats::evm::mnemonic (cyclomatic 85) 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/formats/src/evm.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62aac455fb8436aad3a8cbd19e89253a6dd8ff56740dc3d04827a690283a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::firmware_tools::firmware_image_extract (cyclomatic 64): craft_anything_engine::tools::firmware_tools::firmware_image_extract 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/engine/src/tools/firmware_tools.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c67386ee38cfa1f3dddbc7bd1c37e19ba48b061050ac3aab6975abfc96d036"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::hints::detect (cyclomatic 64): craft_anything_formats::hints::detect has cyclomatic complexity 64 (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/formats/src/hints.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65e629fa6fd9fc5f3991534f7b24e418f6d21cbd68c28b68d89f16e9028cafd"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::arsc::config_qualifiers (cyclomatic 57): craft_anything_formats::arsc::config_qualifiers has cyclomatic complexity 57 (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/formats/src/arsc.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0557cd21043ffabf940ceca64783ff65ed423f50078b12a9f9ebfa2d53c69697"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::member (cyclomatic 54): Scanner::member has cyclomatic complexity 54 (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/formats/src/dotnet/csharp.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc598b8cfe2f95445f2b4de8db18deb9a44a5b6655fb49d659e574d19b1a0680"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::api_ops::read_document (cyclomatic 54): craft_anything_js::api_ops::read_document has cyclomatic complexity 54 (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/js/src/api_ops.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c2c4a5d3e331e69319d313e57dcd5c4b4e506860500ba1a712878a279b883c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::decode::decode_x86 (cyclomatic 52): craft_anything_disasm::decode::decode_x86 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/disasm/src/decode.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"99513f2adc9bf409521a59ec1f90c7b1787c4c9d59a1240676bfdaf5b60a49a1"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::csharp::tokenize (cyclomatic 51): craft_anything_formats::dotnet::csharp::tokenize has cyclomatic complexity 51 (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/formats/src/dotnet/csharp.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4732b4fe365e9a57bcbf6fc588c7ee92d208f7e7055802e30161edf6bedec35"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::ai_cmd::ai (cyclomatic 50): craft_anything_cli::ai_cmd::ai has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e3ae33359069a390b400c393577f84aa76c05f770089894accb8e0f277fdde"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::macho_deps::parse_thin (cyclomatic 50): craft_anything_formats::macho_deps::parse_thin 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/formats/src/macho_deps.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80914dd2f52c6527d34ca8a92601b9ed45cd0f193fb3a2246ef4a291ae96580"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_platform::capture::unix::capture (cyclomatic 49): craft_anything_platform::capture::unix::capture 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/platform/src/capture.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdf69cc7b7a5eaf8a6321ee64778ceeb831b2a8aacae93f3c1ff1919528b58e"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::cli_agents::run_cli (cyclomatic 48): craft_anything_ai::cli_agents::run_cli has cyclomatic complexity 48 (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/ai/src/cli_agents/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6ebfa8d010049c4f6d31a62e3f4394870f160e5d815607c2002e8f69d43b44"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::solana::inspect (cyclomatic 48): craft_anything_formats::solana::inspect has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/solana.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc7fb5d9f7dbb3b748eadf5a15d9c3f5f92c7c8a6f4070c4967f7e3ae4d64b8"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::pseudo::lift (cyclomatic 47): craft_anything_disasm::pseudo::lift 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/disasm/src/pseudo.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"07664fba943022e75568066043c61ae5b3c53d1b28b0902a55b41d418c70ad63"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::lex::scan (cyclomatic 47): craft_anything_js::lex::scan has cyclomatic complexity 47 (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/js/src/lex.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7442cb592e1bbd7c394acbdff15535c73567981e94e57eb3bf3cd37e32064702"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::program::scan_function (cyclomatic 46): craft_anything_disasm::program::scan_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/disasm/src/program.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6651114567b1efc1d1b4e3147eb0edb76e178182d29536451b108a297e0833ac"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::binary::parse_object (cyclomatic 46): craft_anything_formats::binary::parse_object 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/formats/src/binary.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b96d1fa4827a9b2a4c5d09f2ba2657cfeb0d27415c8fbf88ae2abaad9e4d46"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::elf::parse_core (cyclomatic 46): craft_anything_formats::elf::parse_core 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/formats/src/elf.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61f6206b5a0995a320b9fae0fbfe845c28d5cade4c35f79056c2687fe6c05e7"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_inventory::sniff_kind (cyclomatic 45): craft_anything_analysis::js_inventory::sniff_kind has cyclomatic complexity 45 (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/analysis/src/js_inventory.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92ebbdedf5b19632ef6a0950cc84db758cc71369c3ba947a97a12ae4ba39469"}},{"ruleId":"D1","level":"warning","message":{"text":"Names::ty (cyclomatic 45): Names::ty has cyclomatic complexity 45 (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/formats/src/dotnet/sig.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb41071c78fea9714358e71c16097ec0a549c33c7178a3e4fbb4f9cca6f86a1"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::js_tools::load_app_input (cyclomatic 44): craft_anything_engine::tools::js_tools::load_app_input 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/engine/src/tools/js_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b573847cfb47c3c68cee29e22c9cde72a0c0b15ce41e34b7cc12a77e4358241"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::run (cyclomatic 44): Scanner::run 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92b630e2654bbd97be3668dfcd73943513621362b3c74b56200eed4a81676db"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::sbpf::analyze (cyclomatic 43): craft_anything_disasm::sbpf::analyze has cyclomatic complexity 43 (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/disasm/src/sbpf.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89bff4f7b177dcbf2dd31202ba972e4ffe6ff695f137b3ecd88bb6a82d2a34c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pcap::tls (cyclomatic 42): craft_anything_formats::pcap::tls 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/formats/src/pcap.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"f844511c27f27a70be18893f9a3018c140fd2062dca653fbb2762b9874374b15"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::axml::manifest (cyclomatic 38): craft_anything_formats::axml::manifest 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/formats/src/axml.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e22c542a03d4b520898718f51c7ab6aa5c3cdd7fb31c72be13236beb2d33564"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::rust_bin::inspect (cyclomatic 38): craft_anything_formats::rust_bin::inspect 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/formats/src/rust_bin.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b0e8d4ae02c7821a8962c4cf998fa89372fd508f5ec9734385be07559e7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::engine_ui::modal (cyclomatic 38): craft_anything_ui_egui::engine_ui::modal 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/ui-egui/src/engine_ui.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d61848aaea4afa6bc653e445bd3d63c53aa1997be1f1f8c5d459fcdd0bd139"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::native::triage (cyclomatic 36): craft_anything_analysis::native::triage has cyclomatic complexity 36 (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/analysis/src/native.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"384597c3d4c4d99549c43ef8d2637936ba8530eb8919ebd2cf22078dc27f784b"}},{"ruleId":"D1","level":"warning","message":{"text":"Capture::next_ng (cyclomatic 36): Capture::next_ng 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/formats/src/pcap.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2f58683321b1fb019c228d5878dcd0d20e29f9efe2774502444f0bcfd95eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::zip::parse (cyclomatic 36): craft_anything_formats::zip::parse 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/formats/src/zip.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b7c05907f86e142f66dc85d10ec90755df8eac2ef7e5e4ef263d788bf9ffeb"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::swift_demangle::render (cyclomatic 35): craft_anything_formats::swift_demangle::render has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: D::standard (cyclomatic 55) 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/formats/src/swift_demangle.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"845f6d7745b4d222f79808ff84b4830140f62eac0e9555c225455bc2a5b4266d"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::tool_args::parse (cyclomatic 34): craft_anything_cli::tool_args::parse 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":"apps/craft-anything-cli/src/tool_args.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4eadaf8fb0bf8b979b2c7ba0453063fc3f4d9455b2710e267c9a961a99dba7"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::rebuild::feed::apply (cyclomatic 34): craft_anything_ai::rebuild::feed::apply has cyclomatic complexity 34 (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/ai/src/rebuild/feed.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2550b27bc55257b6f82249c7bdeff03bb8298f1df4984efaa3b6bb2f555fe640"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::standin::build (cyclomatic 34): craft_anything_analysis::standin::build 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/analysis/src/standin.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"88df205d62c357a7baf944ebe03444178266ce0527cde77c2277170dc698b1cc"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dex_ops::decode_one (cyclomatic 34): craft_anything_formats::dex_ops::decode_one has cyclomatic complexity 34 (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: craft_anything_formats::dex_ops::opcode (cyclomatic 65) 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/formats/src/dex_ops.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf76031d761c5b7e69f59c4d038898ae797eb109959d413b26423d48f65dfaa"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::tarcpio::tar (cyclomatic 34): craft_anything_formats::tarcpio::tar 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/formats/src/tarcpio.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2877af15eab12afc1ededb10181fa8014f4c5f81934f699440b832cc363fcb3"}},{"ruleId":"D1","level":"warning","message":{"text":"DexBuilder::build (cyclomatic 34): DexBuilder::build has cyclomatic complexity 34 (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/testkit/src/android.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"74470afdea812f9f0692fe41b3ec3d532865e623d3b4043610723dc0e5b63758"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter::body (cyclomatic 33): Emitter::body 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/disasm/src/pseudo.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72830a1aaef6f932de39eebe49f80d883c26b7a84a42d7fc55728872fb97f70"}},{"ruleId":"D1","level":"warning","message":{"text":"Metadata::parse_tables (cyclomatic 33): Metadata::parse_tables 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::dotnet::meta::schema (cyclomatic 46) 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/formats/src/dotnet/meta.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dee3dca7dda2ae06e0ddf11571a84e2c830aee2321cb25748e6b43f32f6f90"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::cil::decode (cyclomatic 33): craft_anything_formats::dotnet::cil::decode has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/dotnet/cil.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4446e08f0913ddc28620af67c362028cf2bff8b6aed2726d5cabcab951ad84"}},{"ruleId":"D1","level":"warning","message":{"text":"ArmConsts::apply (cyclomatic 32): ArmConsts::apply 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/disasm/src/decode.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08af57c9e03bdc444e4d94b314b6046869771abf930b93f5cee29d42c8c80e6"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::report_tools::render_markdown (cyclomatic 32): craft_anything_engine::tools::report_tools::render_markdown 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/engine/src/tools/report_tools.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce6df7490a428b74cbfb36535c56f03cc17923539b0ff59ea0a1555e19df34b"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::prompt_box::show (cyclomatic 32): craft_anything_ui_egui::prompt_box::show 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/ui-egui/src/prompt_box.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac67cdfd8146ecdbcbc9b450d76f0adda695775102eb60f45072c2ec8d5159cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::study (cyclomatic 31): Worker::study 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/ai/src/rebuild/study.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a05d33925cb7fdcd7f3c7aeb729708596de194fd7d7a9bab85cf9ad6b8e536c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::artifact_tools::core_archive_extract (cyclomatic 31): craft_anything_engine::tools::artifact_tools::core_archive_extract has cyclomatic complexity 31 (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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cf6d9d63041baeb1a4d1f17c1d589195ce5bf7fbca65f88c990ed8fc6b7b79"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::elf::enrich (cyclomatic 31): craft_anything_formats::elf::enrich 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::elf::dyn_name (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/elf.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69cf807d7f4b11adf261127206a49fc306fbee47887123714ec3621da39cf92"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::jsonc::tokenize (cyclomatic 31): craft_anything_formats::jsonc::tokenize has cyclomatic complexity 31 (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/formats/src/jsonc.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"af69e1f73952035d341984b28cd2befbd06caf9569a291de2903d52b4b017c69"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::home::modals (cyclomatic 31): craft_anything_ui_egui::home::modals 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/ui-egui/src/home.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f8affb869b6fbdc00d26ebc39381eb07a5d7e80e5ae8335f6c505ddbe476c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::trace (cyclomatic 30): Resolver::trace 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/engine/src/tools/apple_tools.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1366109fb54c2c1ab6d536888ba118b9d5d1f836e9c3d0b77aff6e24e7215e03"}},{"ruleId":"D1","level":"warning","message":{"text":"Xml::value (cyclomatic 30): Xml::value has cyclomatic complexity 30 (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/formats/src/plist.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17ad50fe65737ba3c99666d444782d8eb9afdd41b0db308f5fc855ded52c3a6"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::native_boundaries (cyclomatic 30): craft_anything_formats::dotnet::model::native_boundaries has cyclomatic complexity 30 (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/formats/src/dotnet/model.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8832d3343e78ccf8087c17ad08847e98d05b2668f6aa830eb09559a396fcdf4"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::titlebar::show (cyclomatic 30): craft_anything_ui_egui::titlebar::show has cyclomatic complexity 30 (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/ui-egui/src/titlebar.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2157b0cde183cd1f06f2801e16905d04cf6a390ab5749b30924004fbee3cd7ab"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::ai_cmd::chat (cyclomatic 29): craft_anything_cli::ai_cmd::chat 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":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbeff85aa6b420bab35d02025875bd954ee435d8d45e6c25d678d76e8ac629b"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::rebuild_cmd::run (cyclomatic 29): craft_anything_cli::rebuild_cmd::run 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":"apps/craft-anything-cli/src/rebuild_cmd.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e39ce981e286c836e91a7ffd17ef5bd61b01609f076c3a206f4cc9f5dea84f3"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_ledger::build_ledger (cyclomatic 29): craft_anything_analysis::js_ledger::build_ledger 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/analysis/src/js_ledger.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fab617ecc56094bcd0c55b82ebdd4b82808f3e5768a91e5a3508edbbd91ccae"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::sbpf::decode_one (cyclomatic 29): craft_anything_disasm::sbpf::decode_one 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/disasm/src/sbpf.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bffc666df3ecf4a27a3e3856d341ab3f08816fc18fdb08bd9aaae0d9f091c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Bin::object (cyclomatic 29): Bin::object has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/plist.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"15754daed83b1c038399ec0f450a46eb6a8c8a221b5f6f2326c21488dab9d8db"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pcap::summarize (cyclomatic 29): craft_anything_formats::pcap::summarize 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/formats/src/pcap.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"03638e0ff9574aa92d598b47d477e803962832afba5d191921a731f4ac17eaff"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::project::steps (cyclomatic 29): craft_anything_ui_egui::project::steps 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/ui-egui/src/project.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a10ffa4623a491e02b05b87158621a17b705a96ad70b22cc776e01afa65b79"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamState::apply (cyclomatic 28): StreamState::apply has cyclomatic complexity 28 (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/ai/src/anthropic.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d65147805f7a311c8a803d404ebe53d43cd5d260bde3f719a607ccd60f0d17d"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_inventory::path_role (cyclomatic 28): craft_anything_analysis::js_inventory::path_role 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/analysis/src/js_inventory.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1ff9f730c38644ade57709f5b05fc5c08367a1473a53f4a0d435a205abcdc3"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::target::sniff (cyclomatic 28): craft_anything_engine::target::sniff 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/engine/src/target.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c9b7d322c9498f025149de3c3830ee16350802dc46f93ec29c61b44c2efab"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::collect_network (cyclomatic 28): craft_anything_engine::tools::browser_tools::collect_network 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a1ac0e462af2ce2a7c50ad519af46d626beb730f67fbcdc5fee0d3b3faeae7"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::expr (cyclomatic 28): Expr::expr has cyclomatic complexity 28 (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/formats/src/codesign.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6d169a4b2764982e40dea66045f6ce681ac9c4f13fedcaec792699abd1043"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::elf (cyclomatic 28): Scanner::elf 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. This is NOT this file\u0027s highest cyclomatic complexity: Scanner::try_at (cyclomatic 30) 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/formats/src/firmware.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"472a2e452d6422fd86cf51834ed3dfd7be5ff9988c9bf84957bf180e3e7ac256"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pe::enrich (cyclomatic 28): craft_anything_formats::pe::enrich 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/formats/src/pe.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a59a2fb4be3cdd655dc9047d9771425ee195a0151e5163bc464acd705d3a06"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_source::diff_source_and_bundle (cyclomatic 27): craft_anything_analysis::js_source::diff_source_and_bundle 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/analysis/src/js_source.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aafe673ca5c77612d2e94bcbe03793c37073d6174e0026328dc17e5fc5ff5db"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::managed_tools::managed_app_graph_build (cyclomatic 27): craft_anything_engine::tools::managed_tools::managed_app_graph_build 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/engine/src/tools/managed_tools.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ec0288f79078c046c05d6e76bfbee2c2c66b8e5382529ef4fb5735838c9901"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::axml::parse (cyclomatic 27): craft_anything_formats::axml::parse 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/formats/src/axml.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd714fd4ca5ebc67f90a6615bc7603cdc6ca53c572a701578d83a8911dd76d0"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pcap::dns (cyclomatic 27): craft_anything_formats::pcap::dns 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/formats/src/pcap.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b1ca7d08f2c960f5d9311ef6e97a337899bcd638b4ad4feb3cfb8c713128a7"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pe::parse_resources (cyclomatic 27): craft_anything_formats::pe::parse_resources 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/formats/src/pe.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f440304c75078ac3b8e7594308d71dfade689e653a4eceb35486a380bbf494f6"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::fallback::facts_from_tokens (cyclomatic 27): craft_anything_js::fallback::facts_from_tokens 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/js/src/fallback.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"708d9798ce109ad245c63c1f1aeadf361b096ee66a165d21ad40b04405356fce"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::project::composer (cyclomatic 27): craft_anything_ui_egui::project::composer 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/ui-egui/src/project.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c800c21479d7bfb4bfe136da3e77988bcdfb305ebc3c74f624edb6e3143c55e"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::web_walkthrough_record (cyclomatic 26): craft_anything_engine::tools::browser_tools::web_walkthrough_record 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf4bbff9d89a9209c7873a6b35074843a41b21f649da5e4bd41977e91629629"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::native_function::native_data_show (cyclomatic 26): craft_anything_engine::tools::native_function::native_data_show has cyclomatic complexity 26 (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/engine/src/tools/native_function.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0637c2d6e3c3c1de65c153ae4ced26441f703865e7b4e9509ba38933fa0413f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Dex::format_insn (cyclomatic 26): Dex::format_insn has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/dex.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5483b45d71d402206e8d008e932617f0a2c1891de65f5a9cd4d9483f167b93"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::nib::graph (cyclomatic 26): craft_anything_formats::nib::graph 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/formats/src/nib.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965532174ca563d99222ed49b43f7346f7a7164137b0fa85c284295d05f7672"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::sqlite::decode_serial (cyclomatic 26): craft_anything_formats::sqlite::decode_serial has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/sqlite.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"25635fa33e222cb1058b279b42429bc91467aae62ce5e99ddf4790196d90cd9c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::tarcpio::cpio_with_checksum (cyclomatic 26): craft_anything_formats::tarcpio::cpio_with_checksum 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/formats/src/tarcpio.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcbba81cd14f717296f449a12e71104b4cf7d33ad0d2e5a50a7c2f1b1be8d70"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_setup::doctor::doctor (cyclomatic 26): craft_anything_setup::doctor::doctor 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/setup/src/doctor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1576ed41979bbf14a927be0d384fc46313647ef3474feffda3b24c7904de9c33"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::chat::item_ui (cyclomatic 26): craft_anything_ui_egui::chat::item_ui 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/ui-egui/src/chat.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"599b2aeb40652e5dfbfa8ec3df738ac6b42ea3c8106073abf6aa1a167b8cdb25"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::palette::show (cyclomatic 26): craft_anything_ui_egui::palette::show 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/ui-egui/src/palette.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0cb669c12cfa79d62013d428215ed55180dd101e42c4ddf2368be2920c4438"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_trace::trace_semantics (cyclomatic 25): craft_anything_analysis::js_trace::trace_semantics 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/analysis/src/js_trace.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1b966482846a06244080f095504a378c1076387130a9ff91d1b6567b79dcb5"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::native::ui_action (cyclomatic 25): craft_anything_analysis::native::ui_action 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/analysis/src/native.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a118a27f019a6fb8986152212ce985ae7873ead0c70dbd4cc62fe24056108d04"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::program::prologue_scan (cyclomatic 25): craft_anything_disasm::program::prologue_scan 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/disasm/src/program.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ecc71256192d01596022fee4f834f85c1b2eaec696c9a3caaaf17cafd04ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::script_check::selector_problem (cyclomatic 25): craft_anything_engine::tools::browser_tools::script_check::selector_problem 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/engine/src/tools/browser_tools/script_check.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df32975db8b7839ea146ca68965eadb88aabfff297a6dee85cd5cde5ddb87ea"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::install_tools::app_folder_explain (cyclomatic 25): craft_anything_engine::tools::install_tools::app_folder_explain 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/engine/src/tools/install_tools.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0009a5d38bcf8a0135cfdfbeaa9f0605865461f6ff968c459d418ba71ff3832"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::process_tools::runtime_walkthrough_record (cyclomatic 25): craft_anything_engine::tools::process_tools::runtime_walkthrough_record 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/engine/src/tools/process_tools.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fb36fc8b16ee3dd83d74381ad82d0ca9d4b40418bb38b6656d6244bd6d5eef"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::report_tools::render_html (cyclomatic 25): craft_anything_engine::tools::report_tools::render_html 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/engine/src/tools/report_tools.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9206a0186d221aac7f3b8164fb2989385513d9b307c544e460e94fdb0a9d89"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dart::string_pool (cyclomatic 25): craft_anything_formats::dart::string_pool 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/formats/src/dart.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3b76f95a726935f7b40deaeb3b0c393f29e4d84f8ed3a0bb9754ffe782b997"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::swift::classify (cyclomatic 25): craft_anything_formats::swift::classify 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/formats/src/swift.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84ebdf359f0b7b35ae589ff814ff1224c403915e5283364226ee38807cbe366"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftApp::acted (cyclomatic 25): CraftApp::acted has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ui-egui/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a28f6e2c7339348585ff6b6a01ae00cf78c5e7e596bf082b8f98cfe02bb5987"}},{"ruleId":"D1","level":"warning","message":{"text":"Activity::lines_for (cyclomatic 24): Activity::lines_for 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/ai/src/rebuild/activity.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ea84561ca0c19e1fb1b057dbe68dcac99a8d60bb432c9d1d35f9ab419e9c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteDb::collect_table_rows (cyclomatic 24): SqliteDb::collect_table_rows 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/formats/src/sqlite.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"646fe5730d2d9981b8c67c924e04c40a0f38c68b04515823af5c450b467b4c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::sqlite::rowid_alias_index (cyclomatic 24): craft_anything_formats::sqlite::rowid_alias_index 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/formats/src/sqlite.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dc2f7cf67280df952d0496c183e1c8465b39b9e55002030d59fdb423be496a"}},{"ruleId":"D1","level":"warning","message":{"text":"FactVisitor::visit_assignment_expression (cyclomatic 24): FactVisitor::visit_assignment_expression has cyclomatic complexity 24 (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/js/src/facts.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2e3e436795d0c90b367441c87ead31d4c512bcdc12135961921c60d0414096"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::html::scan_html (cyclomatic 24): craft_anything_js::html::scan_html has cyclomatic complexity 24 (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/js/src/html.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30a4721fa113f51c1797db915b8214801ca8f82fc752de15a778a67b3c9fcb8"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::engine_ui::ghidra_modal (cyclomatic 24): craft_anything_ui_egui::engine_ui::ghidra_modal 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/ui-egui/src/engine_ui.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cf737ae3e5e3d71d22c665b12c6c6a253fc06393a4ba2aeab59133e6e0fc61"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::tool (cyclomatic 23): craft_anything_cli::tool has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-cli/src/main.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a0903a83ac2cb16bed27720b6eb1eb647ab574b2b5df1cad3d1ecf92d81f2c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::standin::answer (cyclomatic 23): craft_anything_analysis::standin::answer 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/analysis/src/standin.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c50dfbc98a3175c6d8720edbab231137ea6e436eb9989d8f4f31f54746d52"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::ai_model::parse_gguf (cyclomatic 23): craft_anything_formats::ai_model::parse_gguf 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::ai_model::ggml_type_name (cyclomatic 30) 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/formats/src/ai_model.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f81de801d8cb900ec619799f220d3f0d4e3197d78385d753d551257877d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::arsc::parse_type (cyclomatic 23): craft_anything_formats::arsc::parse_type 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/formats/src/arsc.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05c68eb29be01fe8b6d24f72f630429ec29abf72ad27fc87901b5196a019280"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::binary::collect_symbols (cyclomatic 23): craft_anything_formats::binary::collect_symbols 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/formats/src/binary.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbe3b7d97fd1571be0330ec67a7647b36e9fcb0bf9a8f8f478b6fe08b308912"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::csharp::reconcile (cyclomatic 23): craft_anything_formats::dotnet::csharp::reconcile 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::dotnet::csharp::operator_name (cyclomatic 27) 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5833d63125c55949af10f001717c31b300394720255edffca61ceeed5bae9fe"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::members (cyclomatic 23): craft_anything_formats::dotnet::model::members 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/formats/src/dotnet/model.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"a707bb04794119c4698407d048c24fb1d34d62f461410e3787d59f33ef1cbbc7"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::macho::objc_metadata (cyclomatic 23): craft_anything_formats::macho::objc_metadata 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::macho::load_command_name (cyclomatic 29) 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/formats/src/macho.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"3666d9c97026798960ff3cf33525ad18b073437a80b904e32b674f9539fc5b67"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pcap::transport (cyclomatic 23): craft_anything_formats::pcap::transport 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/formats/src/pcap.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"76df375d6c59f830440e8ea72495114e9bf97b6c9994567cd065ef3f44cad79a"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_platform::standin_server::handle (cyclomatic 23): craft_anything_platform::standin_server::handle 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/platform/src/standin_server.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6661351aa8caa15644ba7d85b10e2f3fa43a0360880b94f9745e1f5b65bec4dc"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_testkit::sectionless::sectionless_elf (cyclomatic 23): craft_anything_testkit::sectionless::sectionless_elf 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/testkit/src/sectionless.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"830fb935aca3052f64b176877033f9db786e9eaeb78305866ffff150e40ea17c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::make::hero (cyclomatic 23): craft_anything_ui_egui::make::hero 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/ui-egui/src/make.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70d9f208328d6991c89933b9cfdebe038a628278ce1a742ef29ba9286197952"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCode::parse (cyclomatic 22): ClaudeCode::parse 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/ai/src/cli_agents/adapters.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8eec8c6304332ced40bdb7730016028a581e3376d019cbf3d8d194ff2f6f28"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::rebuild::check::build_check (cyclomatic 22): craft_anything_ai::rebuild::check::build_check 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/ai/src/rebuild/check.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"91599acf00228b5a4c1dc3f4a1c079e5e429f8d7781bfc05b72f1a49aa6268aa"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::native::call_path (cyclomatic 22): craft_anything_analysis::native::call_path 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/analysis/src/native.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e345afff0ef326c6ede8f8dc3b947d05a5e45da0bbe88951130554d8e5c77f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::android_package_show (cyclomatic 22): craft_anything_engine::tools::android_tools::android_package_show 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/engine/src/tools/android_tools.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dda2efb19c4a9422325210ea3ea3b55ca4a18cbaef0dbf7889fc25f89c2e4f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::artifact_tools::walk_dir (cyclomatic 22): craft_anything_engine::tools::artifact_tools::walk_dir 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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc46cd4ed3d76804a9ca209e0aa60f765336fc0c5c90621179cf65f0fa65718"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::investigation_tools::render (cyclomatic 22): craft_anything_engine::tools::investigation_tools::render 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/engine/src/tools/investigation_tools.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"574907aaead9278de6d5943aa5131e1badda96a0256258401370b10982891ec1"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::type_decl (cyclomatic 22): Scanner::type_decl 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::dotnet::csharp::operator_name (cyclomatic 27) 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabef259b733b2068349c958e288da64c2b5f2f654c69096f1cc8b22134cb6e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Projector::uid (cyclomatic 22): Projector::uid 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/formats/src/keyed_archive.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c301395bd7472e75390399072c8fa1031c07fa1a6c84ecb50cf0b02edd800"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::nib::parse_nib_archive (cyclomatic 22): craft_anything_formats::nib::parse_nib_archive has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/nib.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4a476f446deaf1a77215e91cb6f6c9374110087818f73ad90cac294b745d71"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pe::export_table (cyclomatic 22): craft_anything_formats::pe::export_table 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/formats/src/pe.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"079e53369c13ecb92a5971b245693678704b10817ed0cb6536fca701b4ef1e60"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::recover::rename_params (cyclomatic 22): craft_anything_js::recover::rename_params 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/js/src/recover.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a792799a43bd1a156fc9bcdf75b0f3ecfb97373feee995fab634afab721130"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_platform::standin_server::parse_head (cyclomatic 22): craft_anything_platform::standin_server::parse_head 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/platform/src/standin_server.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc0ab46cc0437d5a2796dd2adff02bf0065e706c8f4e1aeeb08bddaa538ed24"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_testkit::managed::build (cyclomatic 22): craft_anything_testkit::managed::build 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/testkit/src/managed.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa88f294643ddfa025092379fc1a391629bf5568ae1584a0e94a25ed4c3cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::project::draw_items (cyclomatic 22): craft_anything_ui_egui::project::draw_items 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/ui-egui/src/project.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a358e691f6330806f4544bb5fc08384e1bd42a7d4125d19e16749f53ea69a9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_ledger::candidate_expectations (cyclomatic 21): craft_anything_analysis::js_ledger::candidate_expectations 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/analysis/src/js_ledger.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"279e5ea7fee5cf4d620444ea0bc1641305219d8bf52210c84e7b59bfa8797beb"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_trace::find_seeds (cyclomatic 21): craft_anything_analysis::js_trace::find_seeds 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/analysis/src/js_trace.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"701667e5603e0b92eb90c9b6fac8299195dd24100ef0096e483cbf714e56b1ad"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::android_resources_read (cyclomatic 21): craft_anything_engine::tools::android_tools::android_resources_read 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/engine/src/tools/android_tools.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdfb524aef3fa3a3cf13db3ebb872fdaaeb446a8ff53b4f622e68c8ac9a635d"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::managed_tools::managed_native_calls_verify (cyclomatic 21): craft_anything_engine::tools::managed_tools::managed_native_calls_verify 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/engine/src/tools/managed_tools.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b13ccfa650ccbc63304714ff687c05baf842e958a16a1df2b9da09ff995a62"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engines::game::detect_in (cyclomatic 21): craft_anything_engines::game::detect_in has cyclomatic complexity 21 (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/engines/src/game.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1c85fa4dacfc7ca8f56dfbe17bc5e3553b712c0f4600925d93941599ee9f46"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::value (cyclomatic 21): Parser::value 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/formats/src/jsonc.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b076a4b927934fc6a8d3fe0df90fa339b970931c80b299d6b039ba30db0553e"}},{"ruleId":"D1","level":"warning","message":{"text":"D::identifier (cyclomatic 21): D::identifier has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: D::standard (cyclomatic 55) 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/formats/src/swift_demangle.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7bf04b057534c723ade2b22aaaa97cdf3c92676764d792d8c7175d7b9680d"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::cil::parse_body (cyclomatic 21): craft_anything_formats::dotnet::cil::parse_body 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/formats/src/dotnet/cil.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac42289b9abe8fd3c29711a96d8265f6ee0ceb7a15889a72cc1ed323c505e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::fsread::romfs::walk (cyclomatic 21): craft_anything_formats::fsread::romfs::walk 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/formats/src/fsread/romfs.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"68377b43338e8db015e7691232421f350ef0c64675c65a7f5ac9ba43f6e294ec"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::go::unquote_prefix (cyclomatic 21): craft_anything_formats::go::unquote_prefix 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/formats/src/go.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11217ea894fa848693b307f236a33d252bd14946e1ec321ddc8bbc81f0f67aa"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::go::find_pclntab (cyclomatic 21): craft_anything_formats::go::find_pclntab 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/formats/src/go.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bba4cb13f0c6db36983a7ffd1c792c025cf9d1d280a7c00ea1d26631534784f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::go::read_pclntab (cyclomatic 21): craft_anything_formats::go::read_pclntab 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/formats/src/go.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c99a92a56173b264d3903646565b566bd3d70b6c4c9e7422cf596168875736"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatStream::apply (cyclomatic 20): ChatStream::apply 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/ai/src/openai.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"356c8837429984d46310811cb7646063bf130ab579f1b2103aefd83302fcf4f6"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::java_decompile::decompile_class (cyclomatic 20): craft_anything_analysis::java_decompile::decompile_class 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/analysis/src/java_decompile.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"676f75ed01ba5a0fda39b5beb141de8e1432ccb4c58ab8b100d4599650af6a00"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_source::glob_match (cyclomatic 20): craft_anything_analysis::js_source::glob_match has cyclomatic complexity 20 (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/analysis/src/js_source.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c3123f205c61378479c7292296ad5322982d01ae3a153e096badf8e3ce9952"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::flutter::android_flutter_identify (cyclomatic 20): craft_anything_engine::tools::android_tools::flutter::android_flutter_identify 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/engine/src/tools/android_tools/flutter.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3935c00d74dbdf9bbc35a17dd3fdb799a3f8c07ccbc4a0e2e7fa508e37741ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Elf::parse (cyclomatic 20): Elf::parse 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/formats/src/dart.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae427a450a59b061ca3613fafc7cf0d20c53e4ce262f04c5b847ef2d6fa53f7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::macho (cyclomatic 20): Scanner::macho 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: Scanner::try_at (cyclomatic 30) 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/formats/src/firmware.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99bd8a549b1c1726ff85c857895bd4adbd0425b3232794cc354008b6503ec9e"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::evm::cbor_item (cyclomatic 20): craft_anything_formats::evm::cbor_item 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::evm::mnemonic (cyclomatic 85) 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/formats/src/evm.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f798ad15409d2cd7007f7daefd3533586915c3129bae32713b717d4c3f2f3c56"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::strings::extract (cyclomatic 20): craft_anything_formats::strings::extract 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/formats/src/strings.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bd4e273e6420c2d0f8667c50741bbd3c4f94212507a17d372af693a082e116"}},{"ruleId":"D1","level":"warning","message":{"text":"FactVisitor::api_object (cyclomatic 20): FactVisitor::api_object 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/js/src/facts/api.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fd61a6fe8c3bd9e2d060dfe46d3d979b2a4e8116afd9e5a40fda5e9b218f83"}},{"ruleId":"D1","level":"warning","message":{"text":"FactVisitor::expr_ref (cyclomatic 20): FactVisitor::expr_ref 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/js/src/facts.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feae38fb93c01e2fa0940819c046a20dc274250f1b971cf030f7cfb3704a76f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_setup::plan::apply_with (cyclomatic 20): craft_anything_setup::plan::apply_with 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/setup/src/plan.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96d45d9e6971274c2c12fda042c6724b29a26b73dbef39b4cfbc7043cb73c7c"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftApp::tick (cyclomatic 20): CraftApp::tick 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/ui-egui/src/lib.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd4edf0fed0683c06cad6a8d8623b5c4f3869c341157302fc5bec8209966258"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftApp::poll_run (cyclomatic 20): CraftApp::poll_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/ui-egui/src/project.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc93cf433bcc42b337f2077867146d3a65c0483a60628cfe41a49872b7804e53"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::chat::paragraph (cyclomatic 20): craft_anything_ui_egui::chat::paragraph 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/ui-egui/src/chat.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"f482b1e1e6ad62d6f01f280c429fb54122ddc97ee61103a42345e3baecd3e499"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::show (cyclomatic 20): craft_anything_ui_egui::settings_ui::show 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"90da62a398a971f9e38fb93429b6a41261838781ba5ce2b795c08d6538130093"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::layers (cyclomatic 20): xtask::layers 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":"xtask/src/main.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd791673dc806f08e2b179163fe65a658155c0e9874ef82f23f2766202da011"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::run (cyclomatic 19): craft_anything_cli::run 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":"apps/craft-anything-cli/src/main.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3a70dfa944ed2559bbd0a8b1716a9843ee820d6826d9441268de65b932e002"}},{"ruleId":"D1","level":"warning","message":{"text":"Antigravity::parse (cyclomatic 19): Antigravity::parse 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/ai/src/cli_agents/adapters/antigravity.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca3031a40003b2ed67e7d7f793b120c11277f5b480e6acad372f370cb276f26"}},{"ruleId":"D1","level":"warning","message":{"text":"WebVisualCheck::run (cyclomatic 19): WebVisualCheck::run 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/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70f3d00c6c14954f6c870ec9d6f7113ac3da05f635d80ddde24315de1f51e79"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::mechanics::literals (cyclomatic 19): craft_anything_ai::rebuild::kinds::mechanics::literals 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/ai/src/rebuild/kinds/mechanics.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee488e71ff66ce0aa6838405936f55364c5a91480aa37e5666994c87e53d2b5"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_projection::project_apple (cyclomatic 19): craft_anything_analysis::js_projection::project_apple 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/analysis/src/js_projection.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e2c64b1318f600c4b05cdba585cb65b745ca963fc90b265ce1e61fdc7f8b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::read_response (cyclomatic 19): Client::read_response 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/engine/src/tools/android_tools/jeb.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54007f2e23656ef1b363efcd8356864823466d1952b90b7aa3f5ca82c01dcf7"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::apple_tools::check_hashes (cyclomatic 19): craft_anything_engine::tools::apple_tools::check_hashes 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/engine/src/tools/apple_tools.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bb601fb9ae4e08ed4a40671edffd1b5687f98d8cba261695e732bb3293a5c9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::game_archive_tools::game_archives_list (cyclomatic 19): craft_anything_engine::tools::game_archive_tools::game_archives_list 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad942403ebe25b21ce0027cda803dc91e70e06fd6d9cb0a31ccf5c428bbaecad"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::program_facts_tools::app_builds_line_up (cyclomatic 19): craft_anything_engine::tools::program_facts_tools::app_builds_line_up 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba131b91de6a36d8d25ae7cf17cddf7c2b83c568743c0bf56360a3e2329aa5b"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::web_tools::js_sources_restore (cyclomatic 19): craft_anything_engine::tools::web_tools::js_sources_restore 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/engine/src/tools/web_tools.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c51188469c2ada39c5c38af4768408f3183f123f46244e1d7a00108d8398cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Bom::tree (cyclomatic 19): Bom::tree has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::car::attribute_name (cyclomatic 27) 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/formats/src/car.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e85dd63cfd87fd9c812de962c9cf9ad8a987db8be639386fdac0043b593326"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::codesign::parse (cyclomatic 19): craft_anything_formats::codesign::parse 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/formats/src/codesign.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e387347e987009f3dd9c6e9a176ad67f1cc5bae26c14fe7a275416c14fc24fa"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::fsread::jffs2::read (cyclomatic 19): craft_anything_formats::fsread::jffs2::read 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/formats/src/fsread/jffs2.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b961c5dcde141386ab7346b6147f75cbe0a4b3568967406864fc8198aebe87"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::go::inspect (cyclomatic 19): craft_anything_formats::go::inspect 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/formats/src/go.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7994fc29de321f8546ec1d5d0cc575164c4cadd0bb50a442f3e1f7ca8235d9a4"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::unity_serialized::metadata (cyclomatic 19): craft_anything_formats::unity_serialized::metadata 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/formats/src/unity_serialized.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3fd584ffb5f5a55404a78594144e25f05b42edbd095a75002aa78d42f908d8"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::chat::apply_event (cyclomatic 19): craft_anything_ui_egui::chat::apply_event 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/ui-egui/src/chat.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cdac939d5ec864d764fdc2db62c0a759c80247465c806926f601dda155ce3c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::report::markdown (cyclomatic 19): craft_anything_ui_egui::report::markdown 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/ui-egui/src/report.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76a8e35d87b6b46e91df50dbc879429fba0ee3759e2f3f6a7f53968703e0d73"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::rail_list (cyclomatic 19): craft_anything_ui_egui::workbench::rail_list 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/ui-egui/src/workbench.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d75fa9b586947d6cf85238f68373712d0b87f33ed74837c98688c04f9579eac"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::secrets::secrets (cyclomatic 19): xtask::secrets::secrets 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":"xtask/src/secrets.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9702dbf4297840c83cd4c815b59c3a91b848ee9e6b5443e4f7ab06dc91b711d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::converse_turn (cyclomatic 18): Worker::converse_turn 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/ai/src/rebuild/mod.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c27da846c8b9b7c4ba424f04868820c2833200664e96da7d56c05e8d6df0a9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::standin::merge_siblings (cyclomatic 18): craft_anything_analysis::standin::merge_siblings 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/analysis/src/standin.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5058366137c0592ef6259c8775c7c446f2f55914e15008fa19f38b4ec8878ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::standin::make_sample (cyclomatic 18): craft_anything_analysis::standin::make_sample 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/analysis/src/standin.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd91e68275fe8be5a78a82879b2d65aa46b4e2bfdd1cd59ab3af201f3d52f80"}},{"ruleId":"D1","level":"warning","message":{"text":"Lifter::condition (cyclomatic 18): Lifter::condition 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/disasm/src/pseudo.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d784ee7c518d3c2d6bd744cef1ffc3fe41c40ac4b6248ac6cc099fa9d5bd6cc"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::apple_tools::apple_nib_decode (cyclomatic 18): craft_anything_engine::tools::apple_tools::apple_nib_decode 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/engine/src/tools/apple_tools.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24c089aff3d93e21f1cad55de20fd8f2059eb849aafb9341b4bed022ae261be"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::apple_tools::apple_dylibs_resolve (cyclomatic 18): craft_anything_engine::tools::apple_tools::apple_dylibs_resolve 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/engine/src/tools/apple_tools.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4171cfa378b7c5f01e1f8d840fc8271e9742e1529f645b84d08a916683841458"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::database_tools::db_sqlite_show (cyclomatic 18): craft_anything_engine::tools::database_tools::db_sqlite_show 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/engine/src/tools/database_tools.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1878b59b1d31002eb42bdbd9695cdaa8b3827e8ac4c500bece5f84b8cf5cd29f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::deep::c_pieces (cyclomatic 18): craft_anything_engine::tools::deep::c_pieces has cyclomatic complexity 18 (threshold 15). Of this number, 16 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/engine/src/tools/deep.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b35f13ebb290d991bdaa07661539eaf61b87524bb869ac855e9638028b4a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::java_decompile_tools::read_sources (cyclomatic 18): craft_anything_engine::tools::java_decompile_tools::read_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/engine/src/tools/java_decompile_tools.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7473c3d3a6f216cee9744919b42f35598d20daef1cb449b07629f0c288601751"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::program_facts_tools::native_source_folder_write (cyclomatic 18): craft_anything_engine::tools::program_facts_tools::native_source_folder_write 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9730d8ea014f836ac5a36a90a3eef7122125883b952836ff20fb8fdf75ed85"}},{"ruleId":"D1","level":"warning","message":{"text":"Names::method_sig_inner (cyclomatic 18): Names::method_sig_inner has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::dotnet::sig::alias (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/formats/src/dotnet/sig.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1628695106f4a207ff14625050b4bcce157055ea12a41d3dc0f618dd4c7f03fa"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::bptc::bc7 (cyclomatic 18): craft_anything_formats::bptc::bc7 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/formats/src/bptc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed7641482e866c1678b0a364411c9fa12fe9c7129749b61a5d257ddc3fa96b2"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::elf::read_dynsyms (cyclomatic 18): craft_anything_formats::elf::read_dynsyms 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: craft_anything_formats::elf::dyn_name (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/elf.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"db925243c5cc6c41269160be5b28f3442cc279f7a88eca5e21056b427866a187"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::go::decode_buildinfo (cyclomatic 18): craft_anything_formats::go::decode_buildinfo 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/formats/src/go.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1822acfb79db1418c178ac0a68109b115b74103abf389a80fe90d11b5c70e0"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pcap::decode (cyclomatic 18): craft_anything_formats::pcap::decode 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/formats/src/pcap.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"be57c5527ed14e12e59c2277bff7168f2bb1a0bfbf0133261cf8ecbf6d505e61"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pe::normal_imports (cyclomatic 18): craft_anything_formats::pe::normal_imports 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: craft_anything_formats::pe::resource_type_name (cyclomatic 22) 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/formats/src/pe.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d69416736411885e004b0873b83c3c73aed375b163df806b1895d4c250fc09c"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pe::walk_version (cyclomatic 18): craft_anything_formats::pe::walk_version 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: craft_anything_formats::pe::resource_type_name (cyclomatic 22) 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/formats/src/pe.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3d44c12bec911df4feceec80ebf78fd24a98ae9ed5ad86967694bb54b57e60"}},{"ruleId":"D1","level":"warning","message":{"text":"FactVisitor::on_new (cyclomatic 18): FactVisitor::on_new 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/js/src/facts.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd3c61ea530005aeb7238cbbcee4f287b0276badbe5104c25f4d1ec9d29e1f2"}},{"ruleId":"D1","level":"warning","message":{"text":"FactVisitor::visit_variable_declarator (cyclomatic 18): FactVisitor::visit_variable_declarator 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/js/src/facts.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f08c3993a89203db83c442947640bbdd6973a2d1f40bbc10233fc11766945e"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::builders::agent_model_picker (cyclomatic 18): craft_anything_ui_egui::builders::agent_model_picker 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/ui-egui/src/builders.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2563c23321940acbe1df26a2737c5e5269a528d77a6d9b38e88a9aa3354c00a5"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::make::choose_target (cyclomatic 18): craft_anything_ui_egui::make::choose_target 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/ui-egui/src/make.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8306329ca23af1cf0ba594e051e04c47df0471d72dcd996fe89289bee07c1a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::menu::update (cyclomatic 18): craft_anything_ui_egui::menu::update 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/ui-egui/src/menu.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3cbce409b97610bb70e7ab8d912fcd25246ba4a12ead34511c2246f2825984"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::project::ask_card (cyclomatic 18): craft_anything_ui_egui::project::ask_card 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/ui-egui/src/project.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc87bc2418387a21a04b0bf46748153f71285d7b67e6a222045c258d59344c3"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::plugins (cyclomatic 18): craft_anything_ui_egui::settings_ui::plugins 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae79ccc2ef4abe260667bccba2fbfeea669b712f084072377e7a0ff95fb2b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_cli::setup_cmd::setup (cyclomatic 17): craft_anything_cli::setup_cmd::setup 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":"apps/craft-anything-cli/src/setup_cmd.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadec97336bd9841e7fc9b9b2f85bc0d64d450ab64cb947372355392d8d36bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentLoop::handle_turn (cyclomatic 17): AgentLoop::handle_turn 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/ai/src/agent.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1bdc06e6e4a9534936ac0b74e4db5d1448a02118b5bb86a7b498a3ea0c0f20"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedConversation::new (cyclomatic 17): SharedConversation::new 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/ai/src/cli_agents/shared.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"359e1b78662b78be6fada61fc2ea325bfef7519992435554ef2d5432d6c02eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::website::block_diffs (cyclomatic 17): craft_anything_ai::rebuild::kinds::website::block_diffs 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/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa677eed48c63adb53d4a7f3b8f4c4916713ac305c823db843703060722773bb"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::function_match::print_function (cyclomatic 17): craft_anything_analysis::function_match::print_function 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/analysis/src/function_match.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c3c1860877d6eedc1d38fb436a415dd76fcd4035afab092f9c38b940dfb81"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::program::build_function (cyclomatic 17): craft_anything_disasm::program::build_function 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/disasm/src/program.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"354c0e23ba62bc7568af5d5c41733e6d08759cde93621fe154868be200171c69"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::script_check::check_step (cyclomatic 17): craft_anything_engine::tools::browser_tools::script_check::check_step 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/engine/src/tools/browser_tools/script_check.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcd00a41be8a239eca4b68f15ae449fa09c4333cf9751575591e37a18291cd3"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::game_archive_tools::game_iostore_list (cyclomatic 17): craft_anything_engine::tools::game_archive_tools::game_iostore_list 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"643e8cede9b633b72578b6cce1f4b8a360b6e82777afba1817adfc3b10533745"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::window_tools::native_window_capture (cyclomatic 17): craft_anything_engine::tools::window_tools::native_window_capture 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/engine/src/tools/window_tools.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba284130bdd8b35476d28ec1eb568c0f97ee734b056f7de0ed3bd0ed4b88b61a"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::squashfs (cyclomatic 17): Scanner::squashfs 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. This is NOT this file\u0027s highest cyclomatic complexity: Scanner::try_at (cyclomatic 30) 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/formats/src/firmware.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c98e3d029e07b5853c2d9b6dd48630f796a8b4160eb433b3a2e5b3c9f3df974"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::ai_model::parse_safetensors (cyclomatic 17): craft_anything_formats::ai_model::parse_safetensors 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. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::ai_model::ggml_type_name (cyclomatic 30) 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/formats/src/ai_model.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d178a31ae4e07b350b5b0aee3a34431cc600dc764bbca722187d28f03d2673"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::apk_sign::parse (cyclomatic 17): craft_anything_formats::apk_sign::parse 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/formats/src/apk_sign.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2959d5f969ca8a714dbe4eb496593fa5db2ea944de1f32ec89ad87323438ec31"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::arsc::parse_package (cyclomatic 17): craft_anything_formats::arsc::parse_package 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/formats/src/arsc.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0a466f83c0b75d8664e4c47ab946be27abae23d7272c3309e0935a0bb99f83"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::bytes::decode_base64 (cyclomatic 17): craft_anything_formats::bytes::decode_base64 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/formats/src/bytes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e23f2e886c2013306961ee2d645ef1c5a844761dd4f294eddd9b6d4b5881533"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::codesign::code_directory (cyclomatic 17): craft_anything_formats::codesign::code_directory 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/formats/src/codesign.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b2ccc7537202a0c9ab96f454f5742513751d0963087bbe29bbff1bb5cb8f9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dart::parse_elf (cyclomatic 17): craft_anything_formats::dart::parse_elf 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/formats/src/dart.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e56890f5f676d4f67be349fd9d3177a7ed111d79b8229844b01acf0a2f6bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::bundle::classify (cyclomatic 17): craft_anything_js::bundle::classify 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/js/src/bundle.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1b2aa4a2af6284ce5444a099d1a9423cf8d0c24d5fd5783635d0ee8c2e4f37"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::fallback::api_token (cyclomatic 17): craft_anything_js::fallback::api_token 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/js/src/fallback.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b48c96a16623f4bb2da1ec603bef60beba3a68ecfaebe74fe260e399a6620e"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::html::attributes (cyclomatic 17): craft_anything_js::html::attributes has cyclomatic complexity 17 (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/js/src/html.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a17c2338098e74bb04f9ca46cafb17792402136d3bd65b283238759a6647514"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_testkit::android::axml (cyclomatic 17): craft_anything_testkit::android::axml 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/testkit/src/android.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fce43e657ad0e6d9c0e9d4be02d82d517b5a3fbd2c7bb397dcfce4e98208c2"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftApp::pick (cyclomatic 17): CraftApp::pick 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/ui-egui/src/lib.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74078409ec4975fb6c3c543168e1ce9bd4c6c171c18710c3519b91c5cfca8fb"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::hex_view (cyclomatic 17): craft_anything_ui_egui::workbench::hex_view 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/ui-egui/src/workbench.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2181e05198f014e4b125cb1c30366226fb18d8bdfa3b597b9a99ffc382cf5f"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentLoop::run_one (cyclomatic 16): AgentLoop::run_one 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/ai/src/agent.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"069f9ccfe6dbfd702ea54ed36531672621902bf9e3334f9edb6ef39a036eb042"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::http::parse_sse (cyclomatic 16): craft_anything_ai::http::parse_sse 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/ai/src/http.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01a1f66ff4105aa176db19568bf5abf66b0f0602e71f3d88f97b9d445136527"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ai::openai::messages_json (cyclomatic 16): craft_anything_ai::openai::messages_json 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/ai/src/openai.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6695c443ea3403fb1c4296a3ee8e6ff424dcea733739ca304825fea724705bf"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_analysis::js_source::tokenize_glob (cyclomatic 16): craft_anything_analysis::js_source::tokenize_glob has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_analysis::js_source::language (cyclomatic 17) 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/analysis/src/js_source.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a9cf3b316d44e591d05f56b665189d2a606d8dc50bf155ebed030f89459968"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_disasm::program::pointer_scan (cyclomatic 16): craft_anything_disasm::program::pointer_scan 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/disasm/src/program.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7838959951cd6b18d189771e4d02d9778ad2fbb7be6fdb6bb711a13ed21a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::android_components_list (cyclomatic 16): craft_anything_engine::tools::android_tools::android_components_list 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/engine/src/tools/android_tools.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"082414ecaf7fc246d99ea55ffc664576080c5037a62cb95a30fee8981d29cf88"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::tools::sbpf_tools::formats_sbpf_show (cyclomatic 16): craft_anything_engine::tools::sbpf_tools::formats_sbpf_show 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/engine/src/tools/sbpf_tools.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"274df623b0d0c59dbe0ec4ea999f4d93625a0c52d74aa82e65f692ffa3cf1e07"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_engine::wasm_plugins::imp::install (cyclomatic 16): craft_anything_engine::wasm_plugins::imp::install 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/engine/src/wasm_plugins.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b3070835b06de4b2958a8fcc5d8dae5e3738828783886b59231344533c0b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassFile::format_insn (cyclomatic 16): ClassFile::format_insn 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: craft_anything_formats::java_class::parse_pool (cyclomatic 21) 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/formats/src/java_class.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae79ec8dfccef11dedb030bd4e560032a6062180223a9569d055597ea4f797f"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::classify (cyclomatic 16): craft_anything_formats::dotnet::model::classify 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: craft_anything_formats::dotnet::model::ca_value (cyclomatic 17) 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/formats/src/dotnet/model.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1a57fe49ada98ed32aa051b79ced165ede455dc6bee1d7270b739855e08586"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::pe::delay_imports (cyclomatic 16): craft_anything_formats::pe::delay_imports has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: craft_anything_formats::pe::resource_type_name (cyclomatic 22) 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/formats/src/pe.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5388d8a5870ee1907157261aa3c731b1bcf719c696350cdddf2a32b919998538"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_formats::unity_texture::parse (cyclomatic 16): craft_anything_formats::unity_texture::parse 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/formats/src/unity_texture.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c324291de99050a54fdcebbcffe7c1299268e0dcc22b10a874ba668b2e005ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_js::facts::api::procedure_kind (cyclomatic 16): craft_anything_js::facts::api::procedure_kind 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/js/src/facts/api.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eb01622234d9a27953536562601cffa89539b4572ab2b616495bed40bb0318"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_testkit::elf64 (cyclomatic 16): craft_anything_testkit::elf64 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/testkit/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"469e3fb3174123931a78dcd6c5445f56ed20f751d958edfad0b47d95b58010d9"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_testkit::apple::to_bplist (cyclomatic 16): craft_anything_testkit::apple::to_bplist has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (add). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/apple.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edf201440abad488aeedc6aa4c5ea990154489ca260c4782e412241ec7537b3"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftApp::tool_done (cyclomatic 16): CraftApp::tool_done 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/ui-egui/src/lib.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"179c469554d0a594078fe6955f52f1a756892c9adb98ceb4839ab9f6eb615ddb"}},{"ruleId":"D1","level":"warning","message":{"text":"craft_anything_ui_egui::sidebar::show (cyclomatic 16): craft_anything_ui_egui::sidebar::show 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/ui-egui/src/sidebar.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fe9299d5b8d426b050c8ff021695b513cc845030c9ea532b8ecde180c4a9cb"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::version (cyclomatic 16): xtask::version 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":"xtask/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fad38321aa91782adc9882f2d98ed2a02f49c33248081bfed1ff3ae0139c04b"}},{"ruleId":"D1","level":"warning","message":{"text":"CraftAnythingBridge.dispatch (cyclomatic 16): CraftAnythingBridge.dispatch 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/engines/src/ghidra/CraftAnythingBridge.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a433038eec6cd497868e37cecbd6c39ff4df97c33f54c2e7cf6de9d181f491f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_app::analyze_application (cognitive 331): craft_anything_analysis::js_app::analyze_application has cognitive complexity 331 (threshold 15). Drivers by points: if/else 76 (182 pts), loops 56 (111 pts), boolean chains 25, match/switch 4 (13 pts) (nesting depth added 170). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/js_app.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52f0e562c46510e15f47b18908ff82a6eea6602b4767cb5e4acc852548947bc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::ai (cognitive 220): craft_anything_ui_egui::settings_ui::ai has cognitive complexity 220 (threshold 15). Drivers by points: if/else 83 (179 pts), boolean chains 22, loops 6 (16 pts), match/switch 1 (3 pts) (nesting depth added 108). 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60513fd66f94e185fc9fe4ce6547c95098726bfc565c4f92a86d533ad4abb28"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::firmware_tools::firmware_image_extract (cognitive 172): craft_anything_engine::tools::firmware_tools::firmware_image_extract has cognitive complexity 172 (threshold 15). Drivers by points: if/else 30 (88 pts), match/switch 10 (47 pts), loops 9 (31 pts), boolean chains 6 (nesting depth added 117). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/firmware_tools.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11666b86fcdf57816f873631aec045ed48d974675c52250a1d4bf057afb3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::wasm::inspect (cognitive 172): craft_anything_formats::wasm::inspect has cognitive complexity 172 (threshold 15). Drivers by points: if/else 27 (88 pts), loops 16 (48 pts), match/switch 9 (33 pts), boolean chains 3 (nesting depth added 117). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/wasm.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a24c4979d48035e416934239568dece1944bb57395e9e2ecbda79446c2dee3"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifter::block (cognitive 170): Lifter::block has cognitive complexity 170 (threshold 15). Drivers by points: if/else 47 (110 pts), match/switch 11 (32 pts), boolean chains 17, loops 4 (11 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/pseudo.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"554f98b1aea68261c2786dba75422f2b33aee5eff465007df17d4ba5e95e015e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::dataflow::def_use (cognitive 143): craft_anything_disasm::dataflow::def_use has cognitive complexity 143 (threshold 15). Drivers by points: if/else 27 (85 pts), loops 20 (42 pts), boolean chains 9, match/switch 4 (7 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/disasm/src/dataflow.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec54da65f8c7992fe2d948514f994f631e5a9789d745b24fbfde2ec1a4f7c02c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::macho::enrich (cognitive 138): craft_anything_formats::macho::enrich has cognitive complexity 138 (threshold 15). Drivers by points: if/else 50 (110 pts), match/switch 5 (13 pts), loops 5 (11 pts), boolean chains 4 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/macho.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a459ab3b15352d22c99450029ae53af7f0ebcf5d4e9545ba26fa3e047d123ae"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::csharp::tokenize (cognitive 130): craft_anything_formats::dotnet::csharp::tokenize has cognitive complexity 130 (threshold 15). Drivers by points: if/else 26 (81 pts), loops 11 (34 pts), boolean chains 15 (nesting depth added 78). 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"13be0b8fc5704762302f1c985cc11f9097dcd1fe43292010eb712717a6aaf090"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::analyze (cognitive 128): Program::analyze has cognitive complexity 128 (threshold 15). Drivers by points: if/else 31 (68 pts), loops 27 (42 pts), boolean chains 13, match/switch 1 (5 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/program.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ca92e2f99548834bca3239cdc216009b52f2fb99c7a9b1215b93d141d49764"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::program::scan_function (cognitive 120): craft_anything_disasm::program::scan_function has cognitive complexity 120 (threshold 15). Drivers by points: if/else 30 (95 pts), boolean chains 11, loops 4 (11 pts), match/switch 1 (3 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/program.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0417d5baaa73c61be4ee948e69d391d7bcdff7e382990787043e0bb6510464"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::on_call (cognitive 116): FactVisitor::on_call has cognitive complexity 116 (threshold 15). Drivers by points: if/else 52 (73 pts), boolean chains 29, match/switch 5 (12 pts), loops 1 (2 pts) (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/js/src/facts.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea3f57f653bcd8a40fb2a747344e848859e298d1373410589d259c7d92cf18f"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::run (cognitive 114): Worker::run has cognitive complexity 114 (threshold 15). Drivers by points: if/else 45 (82 pts), boolean chains 20, match/switch 5 (9 pts), loops 2 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/rebuild/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d2ef5a4937e6e24bf6b92f5bba369d8dfabf29488b0a9806f9bc61efd63118"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::evm::analyze (cognitive 109): craft_anything_formats::evm::analyze has cognitive complexity 109 (threshold 15). Drivers by points: if/else 40 (75 pts), boolean chains 19, loops 5 (8 pts), match/switch 3 (7 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/evm.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a61843423e83bc6b1a70a18535c3a8d4cb2ab09502cd9b83d7416e3e035db0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::decode::decode_a64 (cognitive 107): craft_anything_disasm::decode::decode_a64 has cognitive complexity 107 (threshold 15). Drivers by points: if/else 42 (77 pts), loops 6 (13 pts), boolean chains 10, match/switch 5 (7 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/decode.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada074e729d4b6d6d1948ce088f53931c02c0cd1fbdd168cbc6445119ff2923b"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftApp::handle_done (cognitive 107): CraftApp::handle_done has cognitive complexity 107 (threshold 15). Drivers by points: if/else 32 (84 pts), match/switch 8 (17 pts), boolean chains 6 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ui-egui/src/lib.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7920d2e5826d9a04a131afa88a0c856a6b3fde7e23e0222325125f5c2a42cdad"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::run (cognitive 103): Scanner::run has cognitive complexity 103 (threshold 15). Drivers by points: if/else 30 (81 pts), loops 4 (13 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/dotnet/csharp.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"717eeb1ece15e54379eb10394ecf165fb2998556cf5c5438168c8d729b3eec84"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::api_ops::read_document (cognitive 103): craft_anything_js::api_ops::read_document has cognitive complexity 103 (threshold 15). Drivers by points: if/else 24 (62 pts), loops 8 (22 pts), boolean chains 10, match/switch 3 (9 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/js/src/api_ops.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d1089c00d720649c923bb9b155fbd43d934ad50aaf985d3b5bb10a371d69c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::sbpf::analyze (cognitive 101): craft_anything_disasm::sbpf::analyze has cognitive complexity 101 (threshold 15). Drivers by points: if/else 20 (73 pts), loops 8 (13 pts), match/switch 3 (9 pts), boolean chains 6 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/sbpf.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"be91fcfcc2cbf39f5ba0a42429fa8daf14b02e913a393c11438e59985be12216"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::elf::parse_core (cognitive 101): craft_anything_formats::elf::parse_core has cognitive complexity 101 (threshold 15). Drivers by points: if/else 23 (70 pts), loops 4 (14 pts), match/switch 4 (13 pts), boolean chains 4 (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/formats/src/elf.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb2eb6a3d6f79ae7fc5fce88863443158611f5523597daee15eaf8990c2f78d"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::trace (cognitive 99): Resolver::trace has cognitive complexity 99 (threshold 15). Drivers by points: if/else 20 (68 pts), loops 5 (16 pts), match/switch 3 (13 pts), boolean chains 2 (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apple_tools.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa4996f2d20f9621b9338379f49bd03795dc104aa8b5d72a0c13ee2d391589c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::tls (cognitive 95): craft_anything_formats::pcap::tls has cognitive complexity 95 (threshold 15). Drivers by points: if/else 27 (74 pts), loops 4 (13 pts), boolean chains 5, match/switch 2 (3 pts) (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/formats/src/pcap.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a3a040a6b2aaa1d5aab8ffb65da8e3876c84656b512fd49e50bfc40f43af36"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::member (cognitive 88): Scanner::member has cognitive complexity 88 (threshold 15). Drivers by points: if/else 42 (70 pts), loops 4 (7 pts), boolean chains 6, match/switch 2 (5 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"82064293e61fb3b56812f5e219f50ded5301ecedd123d1572e862a4effc32262"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_cli::ai_cmd::ai (cognitive 83): craft_anything_cli::ai_cmd::ai has cognitive complexity 83 (threshold 15). Drivers by points: match/switch 21 (42 pts), if/else 19 (37 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 40). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3839fcd7749ba943b04d2bd9fb0c3d12178c10038739d63c7bc705f0d8be8c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::js_tools::load_app_input (cognitive 83): craft_anything_engine::tools::js_tools::load_app_input has cognitive complexity 83 (threshold 15). Drivers by points: if/else 19 (48 pts), loops 6 (12 pts), match/switch 5 (12 pts), boolean chains 11 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/js_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edefeecbdc9c8223584489e7cb69caa7c2c6b7190cc46f19bf81ce768d7cd45"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::engine_ui::modal (cognitive 83): craft_anything_ui_egui::engine_ui::modal has cognitive complexity 83 (threshold 15). Drivers by points: if/else 34 (71 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ui-egui/src/engine_ui.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"0336a176c75369c65dfa325acab88e4af40e4c444604e98e2becb7f909b7e7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_ledger::build_ledger (cognitive 80): craft_anything_analysis::js_ledger::build_ledger has cognitive complexity 80 (threshold 15). Drivers by points: if/else 23 (66 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/js_ledger.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"15447c45819c7632ff1186b2eabdfd20cb58483a5550b60ecb27a2442ffbbc95"}},{"ruleId":"D2","level":"warning","message":{"text":"D::operator (cognitive 80): D::operator has cognitive complexity 80 (threshold 15). Drivers by points: match/switch 15 (36 pts), if/else 11 (33 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 49). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/formats/src/swift_demangle.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd32c52d918281f9462c4f5180b5e84c1e17283ed1499edd1558e27b6c3c3c45"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::solana::inspect (cognitive 79): craft_anything_formats::solana::inspect has cognitive complexity 79 (threshold 15). Drivers by points: if/else 28 (55 pts), loops 9 (11 pts), boolean chains 9, match/switch 2 (4 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/formats/src/solana.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ab505436a26d6c0e1f71be99da8f9307ceb13a7f658171d2270b03b4f0a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::pseudo::lift (cognitive 78): craft_anything_disasm::pseudo::lift has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (49 pts), loops 10 (19 pts), boolean chains 9, match/switch 1 (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/disasm/src/pseudo.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2056a887ba0c7b1044d6d61a3986e3c23391bca9c534c9431ad2ac3511ccde1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::lex::scan (cognitive 76): craft_anything_js::lex::scan has cognitive complexity 76 (threshold 15). Drivers by points: loops 10 (28 pts), if/else 15 (27 pts), boolean chains 13, match/switch 2 (8 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/lex.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f558aa43bb57f06f7e1bf528adc1b3b9fce52610a7c9e0d22f90848e5dac58"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::capture::unix::capture (cognitive 75): craft_anything_platform::capture::unix::capture has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (46 pts), loops 11 (14 pts), match/switch 6 (10 pts), boolean chains 5 (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/platform/src/capture.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c354eb9e492942caba5119af2317eebbf0e2e86cf1a2aa171e956b1d12da51f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::report_tools::render_markdown (cognitive 74): craft_anything_engine::tools::report_tools::render_markdown has cognitive complexity 74 (threshold 15). Drivers by points: if/else 26 (46 pts), loops 9 (21 pts), match/switch 1 (4 pts), boolean chains 3 (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/engine/src/tools/report_tools.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f037b80d9354252ef7f42b0fb842918f8e0bb5ad81c23e200a642ff96e54888"}},{"ruleId":"D2","level":"warning","message":{"text":"Capture::next_ng (cognitive 74): Capture::next_ng has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (60 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/pcap.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ce7e713183a396a909e107a1e6d0041ac24bc2198b12ba24916e5bb1cc908"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::decode::decode_a32 (cognitive 71): craft_anything_disasm::decode::decode_a32 has cognitive complexity 71 (threshold 15). Drivers by points: if/else 30 (46 pts), boolean chains 10, match/switch 6 (10 pts), loops 3 (5 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/disasm/src/decode.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28ed2c03b8b974233e55bf6afaad171816bce4cb39102fcc9ac62d900f834e7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::hints::detect (cognitive 71): craft_anything_formats::hints::detect has cognitive complexity 71 (threshold 15). Drivers by points: if/else 41 (46 pts), boolean chains 24, loops 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/formats/src/hints.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af6fcbf515c55c6560e11af02bcc0bbf5d882dddf9b11d66bd1236b4a228c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::macho_deps::parse_thin (cognitive 71): craft_anything_formats::macho_deps::parse_thin has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (48 pts), match/switch 6 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/macho_deps.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14a58115d90372b5f6938dba32459ac6eb51cccc734ddbf038b2eb336a55bda"}},{"ruleId":"D2","level":"warning","message":{"text":"DexBuilder::build (cognitive 71): DexBuilder::build has cognitive complexity 71 (threshold 15). Drivers by points: loops 22 (42 pts), if/else 15 (29 pts) (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/android.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a614470ad2abbf81f0b52903439807ea301746adb24738737956bca6b3e1da"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::collect_network (cognitive 70): craft_anything_engine::tools::browser_tools::collect_network has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (54 pts), match/switch 3 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/browser_tools.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec190161966a98c591d19b5913eb68d7a12444d19a706ae42d7c52644f280183"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::zip::parse (cognitive 70): craft_anything_formats::zip::parse has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (54 pts), boolean chains 13, loops 2 (3 pts) (nesting depth added 34). 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/formats/src/zip.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad7639c3b8c95d5cf7e14d799191a44e3fd6084de8a1de462ce363099369c52"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::summarize (cognitive 69): craft_anything_formats::pcap::summarize has cognitive complexity 69 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 7 (21 pts), boolean chains 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/pcap.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47b8707fad978b623ed3aabe912542194adef18cd7a33a1355603e938912bac"}},{"ruleId":"D2","level":"warning","message":{"text":"ArmConsts::apply (cognitive 68): ArmConsts::apply has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (57 pts), match/switch 3 (5 pts), boolean chains 3, 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/disasm/src/decode.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbd42f0edece1848eded3a9df5f146fe9671d5215dedb9ebb43110afa47dbd1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::decode::decode_x86 (cognitive 68): craft_anything_disasm::decode::decode_x86 has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (43 pts), match/switch 9 (17 pts), boolean chains 6, loops 2 (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/disasm/src/decode.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde6b91a08d24eb62355cb5392c2e759b8304e264a12c948f985de9fa47c7cc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::artifact_tools::core_archive_extract (cognitive 67): craft_anything_engine::tools::artifact_tools::core_archive_extract has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 10 (33 pts), if/else 11 (23 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 38). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/artifact_tools.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba227e3bc769b7e38dc6fdfa93c79a1c50edafd50dc414be6e41cf78abefafd"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::cil::parse_body (cognitive 66): craft_anything_formats::dotnet::cil::parse_body has cognitive complexity 66 (threshold 15). Drivers by points: if/else 14 (50 pts), loops 2 (8 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 47). 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/formats/src/dotnet/cil.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd17881382845bf836ddc784f736f51b4a151a9c45f9964f8520e6a88f7f2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::tarcpio::tar (cognitive 66): craft_anything_formats::tarcpio::tar has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (49 pts), match/switch 3 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/tarcpio.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3693b70430a8779a83b1737f48e2bbc6d6661643f1a83dbdfcccc75862e1da"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::standin::build (cognitive 65): craft_anything_analysis::standin::build has cognitive complexity 65 (threshold 15). Drivers by points: if/else 25 (50 pts), boolean chains 9, loops 4 (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/analysis/src/standin.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb63e00fd613c00ceaa041bd4bdb00ecd84da34d83353a110b34a7fc4fed39e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::axml::manifest (cognitive 64): craft_anything_formats::axml::manifest has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (47 pts), match/switch 3 (8 pts), boolean chains 7, loops 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/axml.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8416db9f5daec41cf5d799d2706a7c28cc952108342fffe54c1e313bf2940b"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::body (cognitive 63): Emitter::body has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 8 (18 pts), boolean chains 5, loops 2 (4 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/disasm/src/pseudo.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a560546c01a6ab3986ff5414175b9e0a370a0bdc80f6cd32862263afe9fd03e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::rust_bin::inspect (cognitive 62): craft_anything_formats::rust_bin::inspect has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 6 (8 pts), boolean chains 5, match/switch 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/rust_bin.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58800df9bf3fb96c03ad40820f56c8982cb950f79c06aff163334f81cbe96ad"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_source::diff_source_and_bundle (cognitive 61): craft_anything_analysis::js_source::diff_source_and_bundle has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 10 (17 pts), match/switch 2 (5 pts), boolean chains 1 (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/analysis/src/js_source.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"126502c8b770b0a9c439aeb4852b37223e195c2b58ba371d863cf9e956723c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::parse_resources (cognitive 60): craft_anything_formats::pe::parse_resources has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (48 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 1 (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/formats/src/pe.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"8932fde8203d4bf7bf50b28eeb0c7f44d38a11bd029ace6112af1d42853e1f93"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dart::string_pool (cognitive 59): craft_anything_formats::dart::string_pool has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 6 (14 pts), boolean chains 7 (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/formats/src/dart.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b0e18e77c52e0a2276f832e907fa3b16c6be1d6f156d5a5c40c67056edfaf7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::enrich (cognitive 59): craft_anything_formats::pe::enrich has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 4 (8 pts), match/switch 2 (5 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/formats/src/pe.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"298fbb13631b03ca81a5f87de0a7c23a393b7e4fefdb1ddf6c137202392d89f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::study (cognitive 58): Worker::study has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (37 pts), match/switch 4 (10 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 29). 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/ai/src/rebuild/study.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7600fcccb907327c5f5becc59f0e2812a266832b130231a10015c90033ad6c59"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::arsc::parse_type (cognitive 58): craft_anything_formats::arsc::parse_type has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (51 pts), loops 3 (6 pts), boolean chains 1 (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/formats/src/arsc.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0367f434cd7934ecd628d55cda00973b394fcdb1230bd228059fadaef498f7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::axml::parse (cognitive 58): craft_anything_formats::axml::parse has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (45 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (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/formats/src/axml.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b4f5b34c76fb530b77e336fa34b580ab54ac0194e36d46fb0a650db44e9f6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_cli::ai_cmd::chat (cognitive 57): craft_anything_cli::ai_cmd::chat has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (45 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 2 (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":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd01f910598fd203648f9e92aa4a91725e0e9f9f3b8d6902ab90d651f8b7f35"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::dns (cognitive 56): craft_anything_formats::pcap::dns has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 3 (7 pts), boolean chains 6, match/switch 1 (3 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/formats/src/pcap.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8616235d656471f6c2935674d131cfbb4132e40601382e33f6a0b09aec0e20"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::cli_agents::run_cli (cognitive 55): craft_anything_ai::cli_agents::run_cli has cognitive complexity 55 (threshold 15). Drivers by points: if/else 31 (36 pts), match/switch 7 (11 pts), boolean chains 6, loops 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/cli_agents/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3aae44d562574a175b92c2db17e73556a40663dac87f7ce671fcd5e797bdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::sbpf::decode_one (cognitive 55): craft_anything_disasm::sbpf::decode_one has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (42 pts), match/switch 6 (13 pts) (nesting depth added 27). 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/disasm/src/sbpf.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"03866c6b0df909510c4fbba301ee05bc1f4fcfada3ceea305eda9710890b6b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::tarcpio::cpio_with_checksum (cognitive 54): craft_anything_formats::tarcpio::cpio_with_checksum has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (43 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (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/formats/src/tarcpio.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef91cdd8e764f1466d58cb7c7988fd679dd93308b542bca8f5b19fd8a8205cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_cli::tool_args::parse (cognitive 52): craft_anything_cli::tool_args::parse has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 15, match/switch 3 (10 pts), loops 3 (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":"apps/craft-anything-cli/src/tool_args.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93faf837d980d78dbebac67b8649e0cd4e45255ac3f74d24c4a1c8c47769a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_trace::trace_semantics (cognitive 52): craft_anything_analysis::js_trace::trace_semantics has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 7 (16 pts), boolean chains 7, match/switch 1 (2 pts) (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/analysis/src/js_trace.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bcee4cc0e42828ac499ef7266e7dbd0d7b1b3cffa12c331994197bae58aa42"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata::parse_tables (cognitive 52): Metadata::parse_tables has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 4 (6 pts), match/switch 2 (4 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/formats/src/dotnet/meta.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78ce46b64ac070a0e9a53d3c871e4d300a2894912991803922058dca1af4a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::fallback::facts_from_tokens (cognitive 52): craft_anything_js::fallback::facts_from_tokens has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (41 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (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/js/src/fallback.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2965d4f85ea886483b2f038fa9246794b05909a3ab0ad0c9632bb507da07f0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::binary::parse_object (cognitive 51): craft_anything_formats::binary::parse_object has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 9 (12 pts), loops 7 (10 pts), boolean chains 6 (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/formats/src/binary.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be724b9d46fc2b92b218f34e1c359b759f7f2f509f881c17b7f54fb3b993b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::managed_tools::managed_app_graph_build (cognitive 50): craft_anything_engine::tools::managed_tools::managed_app_graph_build has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 10 (14 pts), match/switch 2 (5 pts), boolean chains 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/engine/src/tools/managed_tools.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"58de77ffe1242a0224e5c6d654c91f7772cb9d2e9ef6bfe6449d671451d96e60"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::web_tools::js_sources_restore (cognitive 49): craft_anything_engine::tools::web_tools::js_sources_restore has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 5 (15 pts), loops 3 (9 pts), boolean chains 1 (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/engine/src/tools/web_tools.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4df6a85944e799d41ec2ae27f5e303167ac1f4a86946eab4619ff2e217402f6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::cil::decode (cognitive 49): craft_anything_formats::dotnet::cil::decode has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 13 (26 pts), if/else 9 (22 pts), loops 1 (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/dotnet/cil.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"507d63d05689bd02f779ea76e873e008001a16fcf4f14f561898e96ea67d88cd"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::chat::paragraph (cognitive 49): craft_anything_ui_egui::chat::paragraph has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 7 (15 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/ui-egui/src/chat.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3810de27da91388219494cf6e77e7dc4ea7e57f4c65e1646814004c3e4fe1149"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::project::steps (cognitive 49): craft_anything_ui_egui::project::steps has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 6, match/switch 1 (2 pts), 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/ui-egui/src/project.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"a461ade20e667e803c3d412ae01aceaf509f6d9d958111ef576240778ec674eb"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::artifact_tools::walk_dir (cognitive 48): craft_anything_engine::tools::artifact_tools::walk_dir has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (38 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (2 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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2423a8c188dbb7ee555a47e3427ba2157e083a1f4a15b03f8439c27fb01b6bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::java_decompile_tools::read_sources (cognitive 47): craft_anything_engine::tools::java_decompile_tools::read_sources has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (34 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (3 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/engine/src/tools/java_decompile_tools.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"728117f3f26713a617e7e9830022e81a6e49d322c520396355ee60e9b352c283"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::jsonc::tokenize (cognitive 46): craft_anything_formats::jsonc::tokenize has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (13 pts), match/switch 4 (13 pts), boolean chains 2 (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/formats/src/jsonc.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1375bb3bb8cad081d78b965faf6ac05b11f804aa62e51abe3c29d9a29e80c8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::sqlite::rowid_alias_index (cognitive 46): craft_anything_formats::sqlite::rowid_alias_index has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 6, loops 2 (5 pts), match/switch 3 (5 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/formats/src/sqlite.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f8d83c5389fe5ff8e20e56e1ab025b3c60f3ea5e4a55f8ef4680d92a0c69c5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::titlebar::show (cognitive 46): craft_anything_ui_egui::titlebar::show has cognitive complexity 46 (threshold 15). Drivers by points: if/else 33 (41 pts), match/switch 1 (3 pts), boolean chains 2 (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/ui-egui/src/titlebar.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0566b20f5e78a40dac07c9a272840ce79fb38d5df6d222e4795443e81c2dff"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::feed::apply (cognitive 45): craft_anything_ai::rebuild::feed::apply has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 5 (11 pts), boolean chains 5, loops 2 (5 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/ai/src/rebuild/feed.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d185de940153a7bc0a369f7fd1cd187262b87042afe64bde56d488a5fc1f4750"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::ui_action (cognitive 45): craft_anything_analysis::native::ui_action has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 8 (11 pts), boolean chains 5 (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/analysis/src/native.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d744fedd8af549a50be1ea39f4a6d11d67afa9dc3fdd8af52853e0eff98d31"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::go::read_pclntab (cognitive 45): craft_anything_formats::go::read_pclntab has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 3 (7 pts), loops 2 (4 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/formats/src/go.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c51aa29926d40f8afc9327badd7849841fdb75709c943ca9de847b59020048b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::prompt_box::show (cognitive 45): craft_anything_ui_egui::prompt_box::show has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 12, match/switch 1 (3 pts), loops 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/ui-egui/src/prompt_box.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8de8fc3da5a0e3372c494d0656e5f4ef514b08601991f875ecf9bb6d53b72ea"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::standin::merge_siblings (cognitive 44): craft_anything_analysis::standin::merge_siblings has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 5 (12 pts), boolean chains 4 (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/analysis/src/standin.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af9c5bab782cbfaba653ca3f245941014298c7b98d680299b6f88199fda282"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::engine_ui::ghidra_modal (cognitive 44): craft_anything_ui_egui::engine_ui::ghidra_modal has cognitive complexity 44 (threshold 15). Drivers by points: if/else 29 (42 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/ui-egui/src/engine_ui.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7fba9d9fd16fa7fecf81db8eb35d7fda662711f8ace52029ce823dc33cdbe1"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::type_decl (cognitive 43): Scanner::type_decl has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 7, loops 2 (6 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee62d65ba3adcc796c1dfa7e0656d79d5d2527ba8a39bb490394e8bb335d57c3"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_setup::plan::apply_with (cognitive 43): craft_anything_setup::plan::apply_with has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 5 (15 pts), loops 4 (6 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/setup/src/plan.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"599a814d2480ecdaee9d3dd4d6f88caa8f24a25cdf54addcdbaba2cd1331ed6c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::function_match::print_function (cognitive 42): craft_anything_analysis::function_match::print_function has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 5 (9 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/analysis/src/function_match.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bd8fe970a591774fc93168567866a6b55a3b18b1c00682bdb1f05cfce014ce"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::report_tools::render_html (cognitive 42): craft_anything_engine::tools::report_tools::render_html has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 7 (14 pts), boolean chains 2 (nesting depth added 13). 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/engine/src/tools/report_tools.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac0c9d5e53249ddedaa885f765ae78fbe1f167c39cf4726130900464ab50bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::value (cognitive 42): Parser::value has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (33 pts), boolean chains 4, loops 2 (4 pts), 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/formats/src/jsonc.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"916b0804549439ee8379c85bd0fe17fbd65069124124ceedf36c7b9c0eed4e98"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::collect_table_rows (cognitive 42): SqliteDb::collect_table_rows has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 7, match/switch 3 (5 pts), loops 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/formats/src/sqlite.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7eab90328a08f62893909b4c92027dd296ed1be6491e04a655d0b05d4c5e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_cli::rebuild_cmd::run (cognitive 41): craft_anything_cli::rebuild_cmd::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (10 pts), boolean chains 3, 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":"apps/craft-anything-cli/src/rebuild_cmd.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"addfdc21acdd9f23d4797d15892d2c80c08691119f2f33609ab188c05e4a8649"}},{"ruleId":"D2","level":"warning","message":{"text":"D::identifier (cognitive 41): D::identifier has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 5, loops 3 (5 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/formats/src/swift_demangle.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ff57301c065712491c2216f72f06e69a347fafd34c6333a85e3a85d1217bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::managed::build (cognitive 41): craft_anything_testkit::managed::build has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 11 (15 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/testkit/src/managed.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1d7b1f19d737f70755ab0c44040d28b8900fe2d4052f24e09c15df414961b4"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::ai_model::parse_gguf (cognitive 40): craft_anything_formats::ai_model::parse_gguf has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3 (7 pts), loops 3 (6 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/formats/src/ai_model.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b361a3f149fda102e5c8e62476e7411ece667cee15a98c98909ef965c540ec9a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::arsc::config_qualifiers (cognitive 40): craft_anything_formats::arsc::config_qualifiers has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23, match/switch 10 (16 pts), boolean chains 1 (nesting depth added 6). 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/formats/src/arsc.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"95afaa660a11d944438fddd2e760f3865502b11d248ed7901c50f26a3d85f882"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::flutter::android_flutter_identify (cognitive 39): craft_anything_engine::tools::android_tools::flutter::android_flutter_identify has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 4 (7 pts), boolean chains 2, 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/engine/src/tools/android_tools/flutter.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96db18fea9243433d6d9377e91d19c79277e923ec7b0c59618bc0f99df13ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::web_walkthrough_record (cognitive 39): craft_anything_engine::tools::browser_tools::web_walkthrough_record has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 4, loops 2 (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/engine/src/tools/browser_tools.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e2644b270bdfa6566208bfe9eebe21a3992e6cadc1737c29e90cbecd10e78b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::members (cognitive 39): craft_anything_formats::dotnet::model::members has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 7 (10 pts), boolean chains 4, match/switch 1 (2 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/formats/src/dotnet/model.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3b0035a423f08fdf9cf29e38a55c82478aa6de97082bdbf7eb2d2e16f2f99d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::jffs2::read (cognitive 39): craft_anything_formats::fsread::jffs2::read has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 2 (4 pts), loops 2, 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/formats/src/fsread/jffs2.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebcfa0e432c868790bc9ee2e2a96ba51328e67a8d977537f4a6fff1203ce72f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::export_table (cognitive 39): craft_anything_formats::pe::export_table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (6 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/formats/src/pe.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c0cb4121b0695da53ff58ff5b4f9ac35045971d49fc8e4b53bacd79f34f2a0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::strings::extract (cognitive 39): craft_anything_formats::strings::extract has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (7 pts), loops 4 (6 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/formats/src/strings.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"509621fde3ed8227ab451a7ff2017ad121b238276f2d8274137cc538396cda56"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::secrets::secrets (cognitive 39): xtask::secrets::secrets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (16 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":"xtask/src/secrets.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bf408343990d0f254924e011a40e4ddfa68e95777c189c250d5b45974593e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::read_response (cognitive 38): Client::read_response has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/android_tools/jeb.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2969074fe90c8806eeb6e3c5880d1e541519aaef6fdb78488cc491bcf1e1c0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dart::parse_elf (cognitive 38): craft_anything_formats::dart::parse_elf has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 1 (2 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/formats/src/dart.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5915a305a63db7ee2c2d456c18e6aa446d94740e77ce4c302291c662c8f7230"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::call_path (cognitive 37): craft_anything_analysis::native::call_path has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (5 pts), match/switch 3, boolean chains 2 (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/analysis/src/native.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"493859e45df932687019ff161b9614432430ea022a2d3752a995385e6f4eb272"}},{"ruleId":"D2","level":"warning","message":{"text":"Elf::parse (cognitive 37): Elf::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 2 (4 pts), boolean chains 2, match/switch 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/formats/src/dart.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff8ddfad3c7b9ea85fbc6a25d53b1bdf7f523316fd83a0683d3149cbf9e1427"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::elf (cognitive 37): Scanner::elf has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (32 pts), boolean chains 2, loops 2, match/switch 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/formats/src/firmware.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc3198f8b945b36a5a189db5b6ab9634335e2d71d2c03fb87097d7055e08b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::binary::collect_symbols (cognitive 37): craft_anything_formats::binary::collect_symbols has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 5 (9 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/formats/src/binary.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"031ea64293bfa33b57fc28bbbb1db73ca303bd6b20d2cb31f04140a1fe150d02"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::elf::enrich (cognitive 37): craft_anything_formats::elf::enrich has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 4, match/switch 3 (4 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/formats/src/elf.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc708423e06a3206b2682c2bbc070bd1f69426620298b685c3367fff56414869"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::macho::objc_metadata (cognitive 37): craft_anything_formats::macho::objc_metadata has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 5 (6 pts), boolean chains 3 (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/formats/src/macho.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f079c912132d86c1a11d28e43564dc67a0ad19adb8bcead0ae3ee692a80afe"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::sqlite::sql_tokens (cognitive 37): craft_anything_formats::sqlite::sql_tokens has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 2 (4 pts), boolean chains 2 (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/formats/src/sqlite.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362b310656edfa32e2289aa33d4174095a4ef996688e7f2d745f9ccf2ae6791"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::visit_assignment_expression (cognitive 37): FactVisitor::visit_assignment_expression has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (13 pts), loops 1 (4 pts), boolean chains 3 (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/js/src/facts.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ce59e7d59f76ee58db22638c2227ad8b3f7445785e8034737010a9b834508b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::capture::snapshot (cognitive 37): craft_anything_platform::capture::snapshot has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (8 pts), match/switch 2 (7 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/platform/src/capture.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c612da13ff66af7915e0dfc8890f89ad8543936faaa9c9c1b3751f83e950fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::project::composer (cognitive 37): craft_anything_ui_egui::project::composer has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 4, 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/ui-egui/src/project.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca53adfa75cf3c265edb8eff5dfb1b9f7fa56243841d4375cd86c6f00af79b99"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::openai::messages_json (cognitive 36): craft_anything_ai::openai::messages_json has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 3 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). 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/ai/src/openai.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"226d6dafc0543472d5f4f157de15ae74406a45268f7d21d7c6786f6387101389"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_inventory::sniff_kind (cognitive 36): craft_anything_analysis::js_inventory::sniff_kind has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 3, match/switch 2 (3 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/analysis/src/js_inventory.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8861f386155405911260bf91a21a5f3fd4402435e803e6e07aac57b170273b"}},{"ruleId":"D2","level":"warning","message":{"text":"Bom::tree (cognitive 36): Bom::tree has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 2 (6 pts), loops 3 (4 pts), boolean chains 2 (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/formats/src/car.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"894f3be5b53dd96861dcb18b82db8f540a464cba12cf250e9cd1bfd63e8bd8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftApp::poll_run (cognitive 36): CraftApp::poll_run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 2, 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/ui-egui/src/project.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c517049616e00c507982103e453e52f3cde4ba0253b5da79649fd2b58d7e80fe"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::transport (cognitive 35): craft_anything_formats::pcap::transport has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 3 (6 pts), boolean chains 4 (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/formats/src/pcap.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae36500fb8605209976c936705e7eafca07553a58c1ef8a632ac11bb039e630"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::visit_variable_declarator (cognitive 35): FactVisitor::visit_variable_declarator has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (11 pts), boolean chains 2 (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/js/src/facts.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0893d1746c1e2158423d7350c8c57dcaf777f10a27b99ce9368d5544655e99e2"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::palette::show (cognitive 35): craft_anything_ui_egui::palette::show has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 5, match/switch 3 (4 pts), 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/ui-egui/src/palette.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69f7a5d859375996f6d0fdcb4fe6ff40d8618911a9916310c46347212f7461b"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedConversation::new (cognitive 34): SharedConversation::new has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 2 (5 pts), loops 2 (3 pts) (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/ai/src/cli_agents/shared.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"555bcfc10f6af46e14882bffcbfcb201a61e2def9056580f3e568642a08a65f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::converse_turn (cognitive 34): Worker::converse_turn has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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/ai/src/rebuild/mod.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe250c1df61da4bba83f10e4cb62fbada856248ea94d50e193bf9b320828c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::program::pointer_scan (cognitive 34): craft_anything_disasm::program::pointer_scan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 2 (3 pts), boolean chains 2 (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/disasm/src/program.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0336391bfc6a76d9adef75dbe9f9cd194baad7b85ecc4bb04cd4676cd4631d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::target::sniff (cognitive 34): craft_anything_engine::target::sniff has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 9 (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/engine/src/target.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5b60234cc8762395b5ab56c4fd3ccf35f8885590d1c658fa8852fafc2b0634"}},{"ruleId":"D2","level":"warning","message":{"text":"Dex::class_data (cognitive 34): Dex::class_data has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 pts), match/switch 1 (3 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/formats/src/dex.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2e2f64548b136619ff54ce4883e0ef9ab06aca0dda461b6eceddd9d290753f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::arsc::parse_package (cognitive 34): craft_anything_formats::arsc::parse_package has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (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/formats/src/arsc.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be048ff7b1a81afe759b39ff7a18f84553056b7c0dcd624f9de943aa515233b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::normal_imports (cognitive 34): craft_anything_formats::pe::normal_imports has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 2 (3 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/formats/src/pe.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d64b72291f1d8c2d0864cd18109c5b1de7863124c99958c94418291e1694b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_setup::doctor::doctor (cognitive 34): craft_anything_setup::doctor::doctor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 4 (7 pts), loops 2, 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/setup/src/doctor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"684341f81a816d8e76dfce2818ef2a46294ef49704d838bd8315f2167f90b2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::android::axml (cognitive 34): craft_anything_testkit::android::axml has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (9 pts), match/switch 2 (6 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/testkit/src/android.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72aac4eb3dabc1c97b227378ab0ef486b12d651f587f2a0c2877e2e1a042333"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_ledger::candidate_expectations (cognitive 33): craft_anything_analysis::js_ledger::candidate_expectations has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 9 (11 pts), boolean chains 3 (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/analysis/src/js_ledger.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3b4a607f460139165dff2f6327e5c0969947523d7c7a6e66824399418d78a9"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::triage (cognitive 33): craft_anything_analysis::native::triage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (25 pts), match/switch 4 (5 pts), boolean chains 3 (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/analysis/src/native.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac617880db35b0f0c4125ed4cc03363eec3a7d7af62f96b5346679fa360e051"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::call_graph_capped (cognitive 33): craft_anything_analysis::native::call_graph_capped has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts), match/switch 1 (3 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/analysis/src/native.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f79107e93728901670abfa97225d91435f0e6bf21bd311c352989afa23efa1c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::android_resources_read (cognitive 33): craft_anything_engine::tools::android_tools::android_resources_read has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 1 (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/engine/src/tools/android_tools.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222c8b12c3a5762211e3a8dd44fb3ba1655480d923bee49740bc054425a5ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::script_check::selector_problem (cognitive 33): craft_anything_engine::tools::browser_tools::script_check::selector_problem has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4, loops 2, 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/engine/src/tools/browser_tools/script_check.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d7194f83b48b09c9cd19d91213d113ec0691be28ee199e316e0b621c06e5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::read_rows (cognitive 33): SqliteDb::read_rows has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (13 pts), boolean chains 2 (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/formats/src/sqlite.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"407224a2e4bb39841cfd125aaf149e66bfb0ac8e5babf43ec3e7f56bd3b0ee01"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::csharp::reconcile (cognitive 33): craft_anything_formats::dotnet::csharp::reconcile has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 8 (12 pts), boolean chains 7 (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/formats/src/dotnet/csharp.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa3dd8301d7ee780032c4907fc7e781d9e0afe42baeebeaecc66c4324097d5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::native_boundaries (cognitive 33): craft_anything_formats::dotnet::model::native_boundaries has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 5 (10 pts), boolean chains 4, loops 3 (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/formats/src/dotnet/model.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161b771e8a95d91408bf1bc3caead8971cd86004cf6cb34e6457ab573f32ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::romfs::walk (cognitive 33): craft_anything_formats::fsread::romfs::walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, 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/formats/src/fsread/romfs.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5bcf1dfe48787ddd2a00743f2005b66197d529c88259602e2aae89720eab53"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::sectionless::sectionless_elf (cognitive 33): craft_anything_testkit::sectionless::sectionless_elf has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 11 (15 pts), 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/testkit/src/sectionless.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1632aed9225024ad0c38daaccacef6c9df08fccc188fb5ee9df08b6e1d9a71a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::mechanics::literals (cognitive 32): craft_anything_ai::rebuild::kinds::mechanics::literals has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 8, loops 3 (7 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/ai/src/rebuild/kinds/mechanics.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c4185c0eac0277fd3de2198fdacb9e25014bcca4e33acbaf659c85b0a6e01c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::program::prologue_scan (cognitive 32): craft_anything_disasm::program::prologue_scan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 11, match/switch 2 (5 pts), loops 2 (3 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/disasm/src/program.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"942ab9217ad45809b8febfd2120728827661385b3bcc24086fd04b93fe9b9d28"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::pseudo::build_graph (cognitive 32): craft_anything_disasm::pseudo::build_graph has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 4 (13 pts), boolean chains 1 (nesting depth added 19). 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/disasm/src/pseudo.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"541498f2d222aaf17499a8616ebcfd337dccb68f9151a0f7f45837069fef1643"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::process_tools::runtime_walkthrough_record (cognitive 32): craft_anything_engine::tools::process_tools::runtime_walkthrough_record has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 2 (5 pts), boolean chains 4, loops 3 (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/engine/src/tools/process_tools.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"904b59353079787f509544e71576b3d72b4aa1ee57b2e136b853ef226479ec0c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::wasm_plugins::imp::install (cognitive 32): craft_anything_engine::wasm_plugins::imp::install has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (5 pts), boolean chains 3, 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/engine/src/wasm_plugins.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a32fbe45556e8a6928ef586044a1ab36097f93740963ea741825d734ac161"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::ai_model::parse_safetensors (cognitive 32): craft_anything_formats::ai_model::parse_safetensors has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (6 pts), loops 2 (4 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/formats/src/ai_model.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a5631e44d5674488aa8358ffdf5b7f895fe25e85f7e432f9c613849d2384df"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::go::find_pclntab (cognitive 32): craft_anything_formats::go::find_pclntab has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, loops 3 (5 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/formats/src/go.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a539adf4dfabdc965f1d0cce238d73b8207406eed608cd908647b082c0e334"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::delay_imports (cognitive 32): craft_anything_formats::pe::delay_imports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (28 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/formats/src/pe.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d386f3421ce09377b780ac9015e2d3895daba8fcb3bda3cfb3e7d232772db"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::layers (cognitive 32): xtask::layers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, loops 3 (4 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":"xtask/src/main.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"896340df4d6e058c5dba47bc1aa33bb88a4f8a56687e49af0b8823c832ae3bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Inventorier::add_asar (cognitive 31): Inventorier::add_asar has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 3 (6 pts), loops 2, 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/analysis/src/js_inventory.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ae029b2ff8c8b96b23de2b2172780dfff9bf7d9002988162f29c14d66484a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_source::tokenize_glob (cognitive 31): craft_anything_analysis::js_source::tokenize_glob has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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/analysis/src/js_source.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"20125e9969d31cf88abed05985a9e48ab22c11731cb3647d419db603aece2d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::standin::answer (cognitive 31): craft_anything_analysis::standin::answer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 3 (5 pts), boolean chains 3, 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/analysis/src/standin.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d935612ac772a9a8fdfb6e5114bf85891aa1eaf1eec7d5e6f5519eed041cd7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::game_archive_tools::game_archives_list (cognitive 31): craft_anything_engine::tools::game_archive_tools::game_archives_list has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 2 (3 pts), match/switch 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef16f9c30f869a69ec013fb06fb4133fe727a74527b51eb913b4916c70ea7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::investigation_tools::render (cognitive 31): craft_anything_engine::tools::investigation_tools::render has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 6 (11 pts), match/switch 2 (3 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/engine/src/tools/investigation_tools.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"59028027151946f471f3db637e9c2155a33409735e7e8af85bc643c9e1b1b95f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::nib::graph (cognitive 31): craft_anything_formats::nib::graph has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (7 pts), boolean chains 4, loops 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/formats/src/nib.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffbc135a0bde15c3f8ba91330b10825c0336aa2cfb935ccc83c8aafaf81800f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::unity_serialized::metadata (cognitive 31): craft_anything_formats::unity_serialized::metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4, loops 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/unity_serialized.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"702203c51336603ef4bdc2a8edba4b3771dc36beb4f96930503ffe80c6efa2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::html::attributes (cognitive 31): craft_anything_js::html::attributes has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 3 (5 pts), match/switch 2 (5 pts), boolean chains 3 (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/js/src/html.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d442cd415768f501806eea419524dedd4f3f120184e8fe532b5220180b3589"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::chat::item_ui (cognitive 31): craft_anything_ui_egui::chat::item_ui has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 4 (8 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/ui-egui/src/chat.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a86489bb27508c2d4d367a2ae5e5933b21c68730e5ba4f523443177ce0caea"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::hex_view (cognitive 31): craft_anything_ui_egui::workbench::hex_view has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 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/ui-egui/src/workbench.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e2603dfc23bde19287ea252c4e6a6ccb3817cdcfa7bea9eb552350ce7a772e"}},{"ruleId":"D2","level":"warning","message":{"text":"Antigravity::parse (cognitive 30): Antigravity::parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/cli_agents/adapters/antigravity.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eda9131b39dd6867ee7e8d2f442f955e1c994757d8bf7883267dcc4120be8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCode::parse (cognitive 30): ClaudeCode::parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (7 pts), loops 2 (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/ai/src/cli_agents/adapters.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37329438aa0f2258dc98163a4de39273347d900f1d6e4a5c989e269c4c21b51"}},{"ruleId":"D2","level":"warning","message":{"text":"WebVisualCheck::run (cognitive 30): WebVisualCheck::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 4 (5 pts), match/switch 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"90035046e734b9194a4ee42651b28f2544eb10f1febc0391275fdf473b87de82"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::program::scan_plt (cognitive 30): craft_anything_disasm::program::scan_plt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 3, loops 2 (3 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/disasm/src/program.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3a31d7a2bd207bf598bf5728679a2b919c8f48ab096b20a44d70118bd7b059"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::pseudo::dominators (cognitive 30): craft_anything_disasm::pseudo::dominators has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (11 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/disasm/src/pseudo.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf57659ccf627f055e6bbaae2c9465f6ba0a831603a4809dd1a42a185e3a2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::web_common::resize (cognitive 30): craft_anything_engine::tools::web_common::resize has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (20 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 20). 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/engine/src/tools/web_common.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"78819d3a3d6f785a1f3c6285e2ec51d15eec9132e09ad7d0fd78cbd9c6f3303b"}},{"ruleId":"D2","level":"warning","message":{"text":"Names::ty (cognitive 30): Names::ty has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3 (6 pts), boolean chains 4, 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/formats/src/dotnet/sig.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49e95d98941847afe128c481baa832da27d8aeee5bfcdfac0749482853d0406"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::firmware::inflate (cognitive 30): craft_anything_formats::firmware::inflate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 1 (2 pts), boolean chains 1, 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/formats/src/firmware.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f415e79c4881a00dc095a348ee817ef932224e6b6dffa9b3bad1328c96eb86ae"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::chat::apply_event (cognitive 30): craft_anything_ui_egui::chat::apply_event has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ui-egui/src/chat.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b11e73822e13f2918891459b2521d0acfb47371f1cc1b79897891fd21967a8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::project::draw_items (cognitive 30): craft_anything_ui_egui::project::draw_items has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 3, loops 2, match/switch 1 (2 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/ui-egui/src/project.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7343c240bbed5b91cebfebdae99cb4f0d9f72fb1f9738cc6e13a170eabc2e2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::http::parse_sse (cognitive 29): craft_anything_ai::http::parse_sse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 2 (4 pts), boolean chains 2, 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/ai/src/http.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8903054b1f8cd84c0a1f13ed1273ac2bb9b47f71b7050611e1abbf7a592dadf7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::locate::inventory (cognitive 29): craft_anything_ai::rebuild::locate::inventory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (6 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/ai/src/rebuild/locate.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c26d95eee1f206553a35412f6f10df644980fc3a2c69a1576c185aedf80f04"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::web_har::inspect_har (cognitive 29): craft_anything_analysis::web_har::inspect_har has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), match/switch 2 (6 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/analysis/src/web_har.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"656b67662028e3268845d2314be8b88385e5ee49bdb8bdf14d842c54418b7041"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::android_tools::android_package_show (cognitive 29): craft_anything_engine::tools::android_tools::android_package_show has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (9 pts), boolean chains 6, loops 3 (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/engine/src/tools/android_tools.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64530fc67fbb882a3ab9d7db7e9b19c1bdb2bcfddea1ee846c52a99f1052435"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::apple_tools::apple_nib_decode (cognitive 29): craft_anything_engine::tools::apple_tools::apple_nib_decode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, match/switch 2 (4 pts), loops 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/engine/src/tools/apple_tools.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa347ddea659dc50b105a7929b0d0e438250973d7ab5ca2deb52df0960639d9"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::artifact_tools::inventory_path_unlisted (cognitive 29): craft_anything_engine::tools::artifact_tools::inventory_path_unlisted has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (10 pts), match/switch 2 (4 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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb167bebc99a307ff2edea624aaddd9ad4f670fe98a8d0b1cb61ca257e268a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Xml::value (cognitive 29): Xml::value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (9 pts), loops 2 (6 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/formats/src/plist.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b1944dda39ff546b9a30db4eb6a507f0a55bb7721eb9ac2e8b1b09105dbaee"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::apk_sign::parse (cognitive 29): craft_anything_formats::apk_sign::parse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (7 pts), loops 2 (5 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/formats/src/apk_sign.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b75e5cce236cd5fe6cb2ee487311bb3ab62ce994cc9f17b18d1a841a10029d0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_inventory::path_role (cognitive 28): craft_anything_analysis::js_inventory::path_role has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, boolean chains 9. 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/analysis/src/js_inventory.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9027a032ba919576a0fe33b0140f7df2a4001f5a6738d6f86d3c2a0792167d0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::managed_tools::managed_native_calls_verify (cognitive 28): craft_anything_engine::tools::managed_tools::managed_native_calls_verify has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (6 pts), boolean chains 3, loops 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/engine/src/tools/managed_tools.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"46baca14c0f41d6d185a55624e018cfa5ba3419001648dcb33c84d9f38b88531"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::program_facts_tools::native_source_folder_write (cognitive 28): craft_anything_engine::tools::program_facts_tools::native_source_folder_write has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 2, 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"30072ba0eabebb577cd146093b99fa9a7a8e4be6d1b020f7f2c4c37c98fca5ca"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::codesign::code_directory (cognitive 28): craft_anything_formats::codesign::code_directory has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, match/switch 2 (3 pts), loops 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, 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/formats/src/codesign.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6449d33961e17eecc36466ecfa2c54949c5f777ea65198949d638b36d457a53f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::elf::version_needs (cognitive 28): craft_anything_formats::elf::version_needs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (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/formats/src/elf.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0cf72261387e7c3dd5d8e282f684eacd14acfe8fc63ddf5ed0bd0680412703"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::read_router (cognitive 28): FactVisitor::read_router has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (12 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/js/src/facts/api.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad57b4d63b25568ac7329f527b54e73442236aa8d674add5338059bed1b3a95"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::home::modals (cognitive 28): craft_anything_ui_egui::home::modals has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, loops 1 (3 pts), match/switch 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/ui-egui/src/home.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"428cf37d1bc3d8da1207de7283d403a824d1138a0f6031481d4c15d332e2d94b"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftAnythingBridge.dispatch (cognitive 28): CraftAnythingBridge.dispatch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 4 (9 pts), loops 1 (2 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/engines/src/ghidra/CraftAnythingBridge.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1055a511b2e409c5e4c70464d1caae815dde02562ab34439475e6b516d6f962b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_cli::setup_cmd::setup (cognitive 27): craft_anything_cli::setup_cmd::setup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 1 (2 pts), match/switch 2, 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":"apps/craft-anything-cli/src/setup_cmd.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fee591447320d26ae8ddadfff2e43971e82afc12d094a47024a82c6a94f298"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::check::build_check (cognitive 27): craft_anything_ai::rebuild::check::build_check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, match/switch 2 (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/ai/src/rebuild/check.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70fb779ce15e919841aeba70fa1ed7eace9e55f24d40cf9a419bdec8d575418"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::plugin_check::build_json (cognitive 27): craft_anything_ai::rebuild::kinds::plugin_check::build_json has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 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/ai/src/rebuild/kinds/plugin_check.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6940ce86e0adf3c982ff0706419432d21797914da7994641dec2a8c95c27ea"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::java_decompile::decompile_class (cognitive 27): craft_anything_analysis::java_decompile::decompile_class has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 3 (4 pts), boolean chains 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/analysis/src/java_decompile.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1232f43fc178af1f6d45cb4bdd720b1d63d4e07c1a627645c7dd46990a48873"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::standin::make_sample (cognitive 27): craft_anything_analysis::standin::make_sample has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/standin.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b04920e1753e6fdcf0521ed0f18754f98438c8f2af59375ccdd91e1bb8533c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::deep::c_pieces (cognitive 27): craft_anything_engine::tools::deep::c_pieces has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 4 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/engine/src/tools/deep.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"93171f003670c56ad2c0a525bc6db99bf98fc9c9690f42651c5e9e72d1004717"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::install_tools::candidates (cognitive 27): craft_anything_engine::tools::install_tools::candidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (5 pts), loops 3 (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/engine/src/tools/install_tools.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2759387f29c40d72ee4f2a6ecd8d4ccef13f31a363264e36736cf7441be59e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::web_common::perceptual_similarity_masked (cognitive 27): craft_anything_engine::tools::web_common::perceptual_similarity_masked has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 14). 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/engine/src/tools/web_common.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f68d9347469bd65e26b416908ec756f7aea62b21b5ca9f521eebbbdd5af9416"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dex::references (cognitive 27): craft_anything_formats::dex::references has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (6 pts), match/switch 1 (4 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/formats/src/dex.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efebb43034460e04ca20788b2661eb70b036ec60c686f1b6b1e5d856f2c7830"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::firmware::layout (cognitive 27): craft_anything_formats::firmware::layout has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 2 (4 pts), loops 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/formats/src/firmware.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d64cbd95fc24b372a05042b97ab52c7b59cb9ad46bf933ab48480061a78100d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::extfs::extents (cognitive 27): craft_anything_formats::fsread::extfs::extents has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/fsread/extfs.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fad975d10b4fa35ebf82e6cb6b7da630a31bd56cc21652272f156c666855d41"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::go::decode_buildinfo (cognitive 27): craft_anything_formats::go::decode_buildinfo has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, 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/formats/src/go.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f63fc3b206ba7766f9c89a8463f56f412922f75803ed6124aeee2893dbab71f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::ipv6 (cognitive 27): craft_anything_formats::pcap::ipv6 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 1 (2 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/formats/src/pcap.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cae4c0e4ddfe563f98408466890f90f439aedef1fd7cefdcbd3593e23daef6c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::walk_version (cognitive 27): craft_anything_formats::pe::walk_version has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, loops 2 (3 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/formats/src/pe.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa302f3563686d2c30ae426c120a6a8d476b6dd6537340a4d4b9ffac5288f7a8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::fallback::api_token (cognitive 27): craft_anything_js::fallback::api_token has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (4 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/js/src/fallback.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7cc2352db11ae816fac89c53a1fea853ce15332a17e11b64d33d825de84d79"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::recover::rename_params (cognitive 27): craft_anything_js::recover::rename_params has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 3 (4 pts), match/switch 1 (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/js/src/recover.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fc9b46323006bc0d5872a8082ebe1ab888135be36c71ee9fe8fd8d238f76d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatStream::apply (cognitive 26): ChatStream::apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/openai.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"350b46da45591f5050dd282fb26aa691f360cbc6eb39e096926349ff8d6a2a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Activity::lines_for (cognitive 26): Activity::lines_for has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (3 pts), boolean chains 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/ai/src/rebuild/activity.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb914b02cf936c8330111ee68e3163c089082f40d55bc0f7753b3a1e00a19e7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::website::block_diffs (cognitive 26): craft_anything_ai::rebuild::kinds::website::block_diffs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, loops 2 (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/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe171fe37310f1f164fc720d6ed5d93595a4a2723676240f98160d768899377"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_projection::project_apple (cognitive 26): craft_anything_analysis::js_projection::project_apple has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, loops 4, 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/analysis/src/js_projection.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be5a69a7d98ca606ff2a1564d67431b9be2933d22db7cbe9d5a147ebc0ee93"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_trace::reconcile (cognitive 26): craft_anything_analysis::js_trace::reconcile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), 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/analysis/src/js_trace.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3478cb045e2d347f50de5ba66770ebf1c4db170582dc898b8b873d3856beb8ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::region (cognitive 26): Emitter::region has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts), boolean chains 4 (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/disasm/src/pseudo.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"328bd50e163a21a20a47dc65af521543ae1e898ebbb9efd2731b3127cf42f246"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::native_function::native_data_show (cognitive 26): craft_anything_engine::tools::native_function::native_data_show has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (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/engine/src/tools/native_function.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fbafed56145a342b364c19eb78fd41a5ac8a0caa2f96a653eec761298581d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::macho (cognitive 26): Scanner::macho has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (3 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/formats/src/firmware.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2035094fb218aa1d63f1e7a17b3f4c33000bb14aa1861ef607686c7809b736b"}},{"ruleId":"D2","level":"warning","message":{"text":"Doc::remove (cognitive 26): Doc::remove has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 3 (4 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/formats/src/jsonc.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2a10fa220f021f2f85313d58a84e7478d1ae2dc9353a92767767d69a43cb15"}},{"ruleId":"D2","level":"warning","message":{"text":"Projector::uid (cognitive 26): Projector::uid has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 pts), loops 2 (4 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/formats/src/keyed_archive.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf010d3b25d80a547752a49d19ac4e5fa1ff14931a3030935f506a9fb371297"}},{"ruleId":"D2","level":"warning","message":{"text":"Bin::object (cognitive 26): Bin::object has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (10 pts), loops 2 (4 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/formats/src/plist.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ddef0f4e6c17815aea1943f1a3690d2b7af5d53002005a5da537acc69b7941"}},{"ruleId":"D2","level":"warning","message":{"text":"D::shape_ok (cognitive 26): D::shape_ok has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (5 pts), match/switch 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/formats/src/swift_demangle.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24d21c126c9a1f9f8ccdcb26b3e846baa5602b387546afd718cbd62a8968c70"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::apk_sign::parse_signer (cognitive 26): craft_anything_formats::apk_sign::parse_signer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (7 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/formats/src/apk_sign.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c03f0903cf186c575be5e7f65a4c25e69daf656f38d65cb49db500456fdbd2d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::bptc::bc7 (cognitive 26): craft_anything_formats::bptc::bc7 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (17 pts), loops 4 (7 pts), boolean chains 1, match/switch 1 (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/formats/src/bptc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3664280adbbb17f3e8e4cb63c2e1335c755a5b42b39ccb685ebd8cbd78620bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::evm::cbor_item (cognitive 26): craft_anything_formats::evm::cbor_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (9 pts), loops 2 (4 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/formats/src/evm.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602191425e5744798a9a4efec86b1154a85f522dd142db8a1ee1dbd77161166"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_setup::yaml::find_table (cognitive 26): craft_anything_setup::yaml::find_table has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (4 pts), boolean chains 3 (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/setup/src/yaml.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c491597504f4635111eb12b01db2b2186150dbc399b09207e8e0623a7f6c94"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::ui_has_no_side_effects (cognitive 26): xtask::ui_has_no_side_effects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (7 pts), boolean chains 3 (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":"xtask/src/main.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a452f87e6578c9951946896de96c618d38843f6ed84d2206d1cbb9436038e09"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::feature_paths (cognitive 25): craft_anything_analysis::native::feature_paths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (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/analysis/src/native.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"077df56d27e744635e745dc3e0140567dc346b73fa955ecad83edbf127e0b486"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::pseudo::simplify (cognitive 25): craft_anything_disasm::pseudo::simplify has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (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/disasm/src/pseudo.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"e088d76838a8d456b1b19b7d4ce201fc79d4cbb8987d12731747de5fb2d2addc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::apple_tools::apple_dylibs_resolve (cognitive 25): craft_anything_engine::tools::apple_tools::apple_dylibs_resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, loops 3 (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/engine/src/tools/apple_tools.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"632a2910a4ba71d056f7a93c9a842bf5629f9a29e8172a9cada05b7d0bdccd11"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engines::cdp::read_http_response (cognitive 25): craft_anything_engines::cdp::read_http_response has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), boolean chains 2, 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/engines/src/cdp.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aa443fc6612a389f39ce6b5a1a35e881c93eafc6ab623c129d63f9df86824e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::macho::method_list (cognitive 25): craft_anything_formats::macho::method_list has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 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/formats/src/macho.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"019b35aee759fcfb40cd02011b7ebd179659ff7732f02feb698567af89374d76"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::dns_name (cognitive 25): craft_anything_formats::pcap::dns_name has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (5 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/formats/src/pcap.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3ade3b7f18b8daf6a9071dda3d50531a0ed58a4ca22aeddb11a88339c49dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::api_object (cognitive 25): FactVisitor::api_object has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 4 (5 pts), boolean chains 3, loops 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/js/src/facts/api.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d86bb7fec4c63958787362f6fd6fb0635705bc670a2b5c2ec6a45fd0188cc84"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::visit_jsx_opening_element (cognitive 25): FactVisitor::visit_jsx_opening_element has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 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/js/src/facts.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42007bff909ff9d5fb70b6343bf9f73fb5050537370d88e92aa04b80c9171a2"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::project::ask_card (cognitive 25): craft_anything_ui_egui::project::ask_card has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3, loops 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/ui-egui/src/project.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66defeed02c681921df63655a5d50077188871d7dcc44c24f871e603469a718"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::apple_tools::check_hashes (cognitive 24): craft_anything_engine::tools::apple_tools::check_hashes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (9 pts), loops 2, 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/engine/src/tools/apple_tools.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2c33d63fbb6802d0f5a339afe5c8132ebecdea64e93eb721516537cd82c46f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::database_tools::db_sqlite_show (cognitive 24): craft_anything_engine::tools::database_tools::db_sqlite_show has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, match/switch 1 (2 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/engine/src/tools/database_tools.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5351ef1ee03bd2ec90375eb6facbbf54e6e5053900af7bccebc38fe58db519b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::packet_tools::aggregate_tshark (cognitive 24): craft_anything_engine::tools::packet_tools::aggregate_tshark has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/packet_tools.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f23e3184bab73cb881d4d0fc62eb7c7b196b789490eb949153c1623a8424f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engines::gdb::fields (cognitive 24): craft_anything_engines::gdb::fields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (4 pts), loops 2 (3 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/engines/src/gdb.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac1b2fc3b599f574b4afc70207024b4010aa853430745c8b24ce8842696e73"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::assemble_payload (cognitive 24): SqliteDb::assemble_payload has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 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/formats/src/sqlite.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"368433a62f7a9d4889a62c217251b8bc1a1145251b671a986807c97bd7615625"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::bptc::bc6h_halves (cognitive 24): craft_anything_formats::bptc::bc6h_halves has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 pts), match/switch 2 (4 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/formats/src/bptc.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3e3ffcf72fdfc20151b23e08daf0000a143588b5a794809e48efbc391a89e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::codesign::parse (cognitive 24): craft_anything_formats::codesign::parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (8 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":"crates/formats/src/codesign.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"861c0d0d27fcae0316de52e71aa882ce490cc5e4616179f2bef6513c538f195e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::squashfs::file_bytes (cognitive 24): craft_anything_formats::fsread::squashfs::file_bytes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (6 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/formats/src/fsread/squashfs.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b890d1169b05f6c618caef855c1b3f8fd13af64770413e4d9e4a14af2e02cf"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::go::inspect (cognitive 24): craft_anything_formats::go::inspect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (5 pts), match/switch 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/formats/src/go.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"23147ca0a8a3620f2ce4e3cafff0414416202b7f5163f8e3d975fec7f4fcbf8c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::go::parse_module_text (cognitive 24): craft_anything_formats::go::parse_module_text has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 4 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/go.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad183ce9baf2d3fbd9ec91e6c1d50761571aba7d35511b4a0a538457f166340"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::java_class::access_flags (cognitive 24): craft_anything_formats::java_class::access_flags has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (7 pts), boolean chains 1, 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/formats/src/java_class.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc90632e0f02ce3518857b56a1c0835b9626304d5000a2de4a9b35a47071d7c9"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::java_class::references (cognitive 24): craft_anything_formats::java_class::references has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/java_class.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"03584501aa4fa36be6735ba2e1c5af6bf7daccc3d3c812f15af83256155bae3e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::swift::classify (cognitive 24): craft_anything_formats::swift::classify has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 6, 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/formats/src/swift.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa191e3de0e382c5458eb5639b21c71123910efb8ad060b9cc9158e157ee7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::on_new (cognitive 24): FactVisitor::on_new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, match/switch 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/js/src/facts.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63f67d4dd26b678b8b47d9ac808bbe66f546ee7ccece16e6f57efc0ba15f879"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::html::scan_html (cognitive 24): craft_anything_js::html::scan_html has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 10, match/switch 1 (2 pts), 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/js/src/html.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84a26abd1e7101efe48370b176bc24d66b4538591c6ec7ce98a28672e780653"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::capture::effects (cognitive 24): craft_anything_platform::capture::effects has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/capture.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7654ff615e2b96eb0c9c8b7766368509f3ba4584d532f298e243d2a6dc14b669"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::standin_server::handle (cognitive 24): craft_anything_platform::standin_server::handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, match/switch 3 (4 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/standin_server.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca83fff0c6e36b3fc2093a5650ba07ad9d54aabf7aad6cd4ae1cb0e65c2d6c76"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::schema_form::show (cognitive 24): craft_anything_ui_egui::schema_form::show has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ui-egui/src/schema_form.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9366627af91e00134887211096f393327acec7ec9d4ae67dccd06dc0e20259"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::show (cognitive 24): craft_anything_ui_egui::settings_ui::show has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"64418137a940f1d6c7bd77e39d482fb933322dae90d7cbee53b2ac3007458501"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::no_real_machine_sessions (cognitive 24): xtask::no_real_machine_sessions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (6 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":"xtask/src/main.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1ac321929df001dc5d27fc94a4e5e8e321ec0fb5e157390ab1a3c728220639"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamState::apply (cognitive 23): StreamState::apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), 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/ai/src/anthropic.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d336e7e28f1d8aae86e73e7e6abc24feb0bd04191f375886615c74b36bda8b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::compare_tools::core_evidence_exports_compare (cognitive 23): craft_anything_engine::tools::compare_tools::core_evidence_exports_compare has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (2 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/engine/src/tools/compare_tools.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f411313da4dde52af0ce8927adb2e022c841e3eeedcf310a670271cc75b87e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::install_tools::app_folder_explain (cognitive 23): craft_anything_engine::tools::install_tools::app_folder_explain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, match/switch 2 (3 pts), loops 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/engine/src/tools/install_tools.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d3392fb1846fd07bbab3c6f4058d09fd68c2707ddba8ad6e9dcb554528a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::managed_tools::read_sources (cognitive 23): craft_anything_engine::tools::managed_tools::read_sources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (4 pts), loops 1 (2 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/engine/src/tools/managed_tools.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09b4f05aa67f764f1b3dc6ee1c4b688d5b39d22b611a8b258c9f10c059b9a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Dex::code (cognitive 23): Dex::code has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 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/formats/src/dex.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf58a9d4fa7782d7a05dfe1ae5a92efbd445aac6c429e419443008a6f07f84bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Dex::format_insn (cognitive 23): Dex::format_insn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 3 (6 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/formats/src/dex.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb8c469290894d0a5f543cb5bc6ba84c8e772e5ed774776a2efe3c7928360c2"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::car::parse (cognitive 23): craft_anything_formats::car::parse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (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/formats/src/car.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"44258eddffc4ea86c90ca533779394592a3730b622c6d5eb6812c73364b84ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::firmware::scan (cognitive 23): craft_anything_formats::firmware::scan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, 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/formats/src/firmware.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb082207ad28d1fa96aa0b2452af9240283db7f930324f476a5e30e894e5de06"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::packed_carrier::elf_notes (cognitive 23): craft_anything_formats::packed_carrier::elf_notes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 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/formats/src/packed_carrier.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb606528c63dc0aeb1da2d9b0f7ae27b5d5da7e1db797a2ce46311c418e6bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::verify::verify_chain (cognitive 23): craft_anything_formats::verify::verify_chain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 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/formats/src/verify.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7643d533514b92f43828d5ce1da60f6b51c9f849cb494a3650f3efdb31c7b726"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::capture::console_text (cognitive 23): craft_anything_platform::capture::console_text has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), loops 3 (4 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/platform/src/capture.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f36060f724c27dd68a01e3ec741b564e156f4455439e198295c8eb72e82d60"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftApp::tick (cognitive 23): CraftApp::tick has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, 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/ui-egui/src/lib.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fd3acc1a0b699542b5834b356ea26477dc5a0667746eeb28cd59e44f2ba128"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::builders::agent_model_picker (cognitive 23): craft_anything_ui_egui::builders::agent_model_picker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, loops 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/ui-egui/src/builders.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c72969ffcea78426bef24bc5a1260aafb28a50eef58866dab64a84992ca9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::make::hero (cognitive 23): craft_anything_ui_egui::make::hero has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 8, 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/ui-egui/src/make.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f5383126676a2e04d6739c5173f19051304f09f1064a2d23141fa229be973f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::plugins (cognitive 23): craft_anything_ui_egui::settings_ui::plugins has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, loops 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6788ed0dffd72e84d67094789247b8b300ebdcf37033d6790a6331fa1a06eef5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::rail_list (cognitive 23): craft_anything_ui_egui::workbench::rail_list has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts), match/switch 2, 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/ui-egui/src/workbench.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"945cb0f7a28cd7fa131c7ad96eec874268e7f49dfe1f7334a9b31ec8c937fac5"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAi::body (cognitive 22): OpenAi::body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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/ai/src/openai.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9521a4e79a137c8129430ac4be973b5c468c00531e8476f3909acc7c44b8b54b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_compare::match_modules (cognitive 22): craft_anything_analysis::js_compare::match_modules has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, match/switch 1 (3 pts), loops 2 (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/analysis/src/js_compare.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"771968b76ad7729596c62b80c05c6c0f1c28e4f1e09fbd661a1185b7d83256e1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_trace::walk (cognitive 22): craft_anything_analysis::js_trace::walk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 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/analysis/src/js_trace.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"172ab75e22bc5a9f0577d4dcd2e50a0b5f297fc6ff2e49a290a24dcbeeaed68e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_disasm::program::build_function (cognitive 22): craft_anything_disasm::program::build_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, 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/disasm/src/program.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"484af311186062223a5dac1923c984d0a4e26aba77bd737723ed28c30ad1c58a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::outputs::cargo_programs (cognitive 22): craft_anything_engine::outputs::cargo_programs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, match/switch 1 (2 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/engine/src/outputs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"129b48780870197ad3c5f1ac1ff82ef45d77c6318ea8d32aebf5f25f4bbaa229"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::install_tools::walk (cognitive 22): craft_anything_engine::tools::install_tools::walk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 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/engine/src/tools/install_tools.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb62a0e174a7a648958f6a5b2f12c0e37e1edbc06d5f9185984e5d22549b26e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::install_tools::scan (cognitive 22): craft_anything_engine::tools::install_tools::scan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), match/switch 1 (4 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/engine/src/tools/install_tools.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2008c98e599d6c3620fb17178057880b1e9e3aac846a75ba92892080b3245c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::process_tools::normalize_capture (cognitive 22): craft_anything_engine::tools::process_tools::normalize_capture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (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/engine/src/tools/process_tools.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"043d2a439a62b764f7c5bcdd303dd4f170ce88ddc3ba2b3217ae40b52c70dd68"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engines::game::detect_in (cognitive 22): craft_anything_engines::game::detect_in has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (8 pts) (nesting depth added 1). 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/engines/src/game.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"85801ca61f07bdd91c7bace6731276485eadbe228edb61122c7497451d061e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::squashfs (cognitive 22): Scanner::squashfs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 2, 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/formats/src/firmware.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a811a374204c656ca9477ee9d20ec6b90cfb511e053ef490237a37706ae2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::elf::read_dynsyms (cognitive 22): craft_anything_formats::elf::read_dynsyms has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 pts), 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/formats/src/elf.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3358f46d1764b29ea757a38e5511ecb854b56828bd74d000f8e97898de0cf732"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::cramfs::walk (cognitive 22): craft_anything_formats::fsread::cramfs::walk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (5 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/formats/src/fsread/cramfs.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97cbbf28da6f8f17f81f3650b7d2ddea7a59527488c87897a92ec3f1a30affc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pkcs7::parse_signed_data (cognitive 22): craft_anything_formats::pkcs7::parse_signed_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 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/formats/src/pkcs7.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad754d32b363806204f7489d52da6f5cdb332428b3a5d511bf0f08bc9f891c4"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::plist::tokenize (cognitive 22): craft_anything_formats::plist::tokenize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 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":"crates/formats/src/plist.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8c4be89bfadcc7996f1e25e0a92be7bd515cf20c02d6d04db5d01312fb8a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::unreal_texture::texture (cognitive 22): craft_anything_formats::unreal_texture::texture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, loops 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/formats/src/unreal_texture.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b09cd5281efaf143c939edf14ffe88023dd93a62aca28d2275fbcf3efe1812"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::standin_server::parse_head (cognitive 22): craft_anything_platform::standin_server::parse_head has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/standin_server.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43934a7acec507670e61db0c4323c8cb563f102f2e031754d44a3d21f55a90f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_setup::plan::uninstall (cognitive 22): craft_anything_setup::plan::uninstall has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 6 (8 pts), loops 2, boolean chains 1 (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/setup/src/plan.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4d4e93b201d2fd659e1a5ff9ca252fac0543dff179375dc97016232e5f70c5"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftApp::toasts (cognitive 22): CraftApp::toasts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2, 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/ui-egui/src/lib.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9465454a39c7b0c3c2bc8405acd0022f89c1cdb87e6e4dec000b1f9a415a4ca"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::report::markdown (cognitive 22): craft_anything_ui_egui::report::markdown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (8 pts), loops 2 (3 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/ui-egui/src/report.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee37a9239ca5e9bb14051bdd6ef6c6f3d3af79fe5fe657251429081df21bf9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::sidebar::show (cognitive 22): craft_anything_ui_egui::sidebar::show has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, loops 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/ui-egui/src/sidebar.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"425da00769f901e75dcdeeff698ee0abe0a62b66a9d09630d9048d8ba146c63b"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::process_calls_only_in_platform (cognitive 22): xtask::process_calls_only_in_platform has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 9 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":"xtask/src/main.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8453ef59b3707eaa30481dcf986b1a0ccd2a68d9b5d9102e08b9df7570d495d6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_cli::tool (cognitive 21): craft_anything_cli::tool has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 7 (8 pts), boolean chains 3, loops 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":"apps/craft-anything-cli/src/main.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acab6f55f826302e7222bb33f11cf23fd714024fe4b48970711ffb4dc87c15e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::openai::fenced_calls (cognitive 21): craft_anything_ai::openai::fenced_calls has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, 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/ai/src/openai.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c489203a31b32d8e16151b611fe2775bab4240ae924c634549338b8133412ad0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::mechanics::walk (cognitive 21): craft_anything_ai::rebuild::kinds::mechanics::walk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, 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/ai/src/rebuild/kinds/mechanics.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff6cf0d5039370c9f35e2b76dcdd2f507af749d69b4debc341b6ba105ed32ed"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::website::design_notes (cognitive 21): craft_anything_ai::rebuild::kinds::website::design_notes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts), boolean chains 3 (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/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ca58bd5847027289b5a9dd06529489008ae39bd3da8a863fe492571af99720"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::refs (cognitive 21): craft_anything_analysis::native::refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (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/analysis/src/native.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"06db9c048b68d5e89f24abe96787df9312ebd87cfeac1265b384c7c13ad18bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::web_scripts::plan_layout (cognitive 21): craft_anything_analysis::web_scripts::plan_layout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 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/analysis/src/web_scripts.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1bcbcb8582fb1dfce0c5327cedc4b8cafa5ed12383664577f505c33f03be5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifter::mem (cognitive 21): Lifter::mem has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 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/disasm/src/pseudo.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee124bc61b2bd9449acc49b0003c5335f073e707695fd5c55278a7cd261f90e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::compare_tools::bfs (cognitive 21): craft_anything_engine::tools::compare_tools::bfs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (7 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/engine/src/tools/compare_tools.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ca8671671f46a5ccaa2ea347ab9ee5a09c670d024c9c3644f890007f291d1c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::format_tools::formats_wasm_module_show (cognitive 21): craft_anything_engine::tools::format_tools::formats_wasm_module_show has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (4 pts), loops 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/engine/src/tools/format_tools.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45ca76f46eb38995e7e7f509d08a0a87455db65e789c357905d1e9e8232cf21"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::program_facts_tools::app_builds_line_up (cognitive 21): craft_anything_engine::tools::program_facts_tools::app_builds_line_up has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"916830da89bee693a9d7a4be29a81902a0c104aad491d001740dc2ef37c18c35"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::window_tools::native_window_capture (cognitive 21): craft_anything_engine::tools::window_tools::native_window_capture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 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/engine/src/tools/window_tools.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"49753f2269fb0dad39269aaf3817071dbb8062f931128c7db2a9630c6879864f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::der::oid (cognitive 21): craft_anything_formats::der::oid has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, match/switch 1 (2 pts), 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/formats/src/der.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f146497981272dee94d136600701bddd974da37818a0a1d2835df91c5c3dd49"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::nib::from_keyed_archive (cognitive 21): craft_anything_formats::nib::from_keyed_archive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), match/switch 1 (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/formats/src/nib.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60a2a1455a111506d01fbf840b938831d91244f6ec507a84f974ea8d8c1c1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::unreal_pak::footer (cognitive 21): craft_anything_formats::unreal_pak::footer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 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/formats/src/unreal_pak.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54f18e0eb88ba6f50d29d445aad8906c5d3139c43c7120442e8c1299c69e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::watch (cognitive 21): Supervisor::watch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 1 (3 pts), 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/platform/src/process.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389d8240dc695811f6239572cd1076c69b471e666bae8c15e02e2a71f5ea4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::builders::need_builder_modal (cognitive 21): craft_anything_ui_egui::builders::need_builder_modal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 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/ui-egui/src/builders.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"970c7efe7c72b58c5430782515927ca1ad56f40aca01749d8a105da4bbab5177"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentLoop::handle_turn (cognitive 20): AgentLoop::handle_turn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (6 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/ai/src/agent.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b75ffa4bef3a2151095ebaf75399cdf6c2e4196e237208e47b6c081df6714b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::question::collect (cognitive 20): craft_anything_ai::rebuild::question::collect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (7 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/ai/src/rebuild/question.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"64feabffcc356eed01569661fb7dc7c2f7cba33f46b07ec9a263bf1a0bcd763f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::web_scripts::scripts_from_capture_within (cognitive 20): craft_anything_analysis::web_scripts::scripts_from_capture_within has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/web_scripts.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df0c655de1a0fbe82236be34725299bc9c82cf0f1311e82e4b911003baef2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::script_check::check_step (cognitive 20): craft_anything_engine::tools::browser_tools::script_check::check_step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/browser_tools/script_check.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a595d63bde1a8dd22fe6f32d614936d4fdee4ede0d245fcc58500e0b34f496ca"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::game_archive_tools::game_unreal_texture_export (cognitive 20): craft_anything_engine::tools::game_archive_tools::game_unreal_texture_export has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (5 pts), 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa638f0537705107bb27438beca5a1f3cd9f46cc77bd761feeddaefaa4a6be4"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::sbpf_tools::formats_sbpf_show (cognitive 20): craft_anything_engine::tools::sbpf_tools::formats_sbpf_show has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 3 (4 pts), match/switch 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/engine/src/tools/sbpf_tools.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2749ad765fa9b7c39779dd38c6449286944709ec160b61c9f56d266a2d454c70"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::web_runtime_tools::run_coverage (cognitive 20): craft_anything_engine::tools::web_runtime_tools::run_coverage 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/engine/src/tools/web_runtime_tools.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa55a92d765c3c7139e1c32ad224847a01def82d40e86f90fccb716f8e859c"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::workspace::progress::fingerprint_tree (cognitive 20): craft_anything_engine::workspace::progress::fingerprint_tree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 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/engine/src/workspace/progress.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"147c414a6e5e101c0fe2a531bb395fe709224018e0bc5d15f07f3e4a4bff168c"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata::fits (cognitive 20): Metadata::fits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4, 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/formats/src/il2cpp.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0572396ee4870b50782ab9013ae9b00e226550438c0fa1241b8fc54d61054"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dart::tagged_strings (cognitive 20): craft_anything_formats::dart::tagged_strings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 4 (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/formats/src/dart.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"65641b338624c5dc4db405e4ec62d1362c9a1f4434b6e2ee8c14e03e3283f997"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pcap::decode (cognitive 20): craft_anything_formats::pcap::decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/pcap.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fde8943d7d923244e56ba41db4fd581ebd2338e861afd3c7856c43c3caeea68"}},{"ruleId":"D2","level":"warning","message":{"text":"BundleVisitor::take_browserify (cognitive 20): BundleVisitor::take_browserify has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/bundle.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2fd97013aa7143a7860f2a00f1ddc88257e9f3efcc7242f20776d8d1103934"}},{"ruleId":"D2","level":"warning","message":{"text":"DepVisitor::visit_call_expression (cognitive 20): DepVisitor::visit_call_expression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 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/js/src/bundle.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4650eb9c180543e9bb453836d12c7f9aaa6c6a9a08188ca4eee46987ab388846"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::client_call (cognitive 20): FactVisitor::client_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (7 pts), boolean chains 2 (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/js/src/facts/api.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e76a96a1930d83427386c0ea76f04f55c299bda1ac62927e1fccfb0e576ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::facts::api::procedure_kind (cognitive 20): craft_anything_js::facts::api::procedure_kind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 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/js/src/facts/api.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb31dd1776123679d2b686182afede12af17435f1d8bfa59be17d23aea755fc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::process::spawn_reader (cognitive 20): craft_anything_platform::process::spawn_reader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/process.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaebc763ef14c416a5fc0ca4a318b070c213369e20349ce2f82ab810d23b46b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::tab_strip (cognitive 20): craft_anything_ui_egui::workbench::tab_strip has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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/ui-egui/src/workbench.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf1a930f4bd811234c160a0eed1dd31350a74f16044800d847d26c730258829"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::version (cognitive 20): xtask::version has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 1, match/switch 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":"xtask/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e16ed3d01813596f8d2571a2422c0ced12de9baaac3589873c93541f54a237"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::pending (cognitive 20): xtask::pending has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca10781a4597d8281609909a41f0c5278e7eae731bd674f3370ad42a8ee3222"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::question::recent_files (cognitive 19): craft_anything_ai::rebuild::question::recent_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 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/ai/src/rebuild/question.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c2610fa9bd86e017918188538aa06038b9d20cecb89096d54d9045f93f86de"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::ssh::hosts_from_file (cognitive 19): craft_anything_ai::ssh::hosts_from_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), 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/ai/src/ssh.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4539a7547c54f87cebb18f3ae98a3716f43aa18ffc57f72dc6b9c1dd5458788"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrub::query (cognitive 19): Scrub::query has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 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/analysis/src/standin.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"883d0dbd7c33482250f62f895eec4fd5487bfbbbf376bb8a8502fe5112c163f6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::web_scripts::scripts_from_har_within (cognitive 19): craft_anything_analysis::web_scripts::scripts_from_har_within has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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/analysis/src/web_scripts.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e60603e2f1476490e5847944e14f5903bb08ee05912204dba2eb7380b6e9461"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::program_facts_tools::native_offered_symbols_list (cognitive 19): craft_anything_engine::tools::program_facts_tools::native_offered_symbols_list has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab5c19587c1021d564571a8af02dd64307126f0c1e6e110850a8d14598efe2b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::website_tools::web_page_states_capture (cognitive 19): craft_anything_engine::tools::website_tools::web_page_states_capture has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 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/engine/src/tools/website_tools.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7ef1d2a3f1f8bc825cec46ab23474132d1c327e149989016e0503e4ce72183"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeCache::has_readable_signer (cognitive 19): ProbeCache::has_readable_signer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/apk_sign.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c499f5e5c9f988f9ca414a5eec16d4b7bf48979c70629e4fb340012bb50ad6c"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::count_leaf_cells (cognitive 19): SqliteDb::count_leaf_cells has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, 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/formats/src/sqlite.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de91f041462d731d80b12d7882f719471163ab9b917ef7c4a0293babc0edeb"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::decompress::lz4_block (cognitive 19): craft_anything_formats::decompress::lz4_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 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/formats/src/decompress.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff79261657997d37ac80838a6c53a20f0ee2fd87a3e2c5b48a87d9c866939b8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::decode_attribute (cognitive 19): craft_anything_formats::dotnet::model::decode_attribute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), 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/formats/src/dotnet/model.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf434305946d15642c4e56c754cee219bc56caf60581ba26a0db9e47ea5f943"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dotnet::model::classify (cognitive 19): craft_anything_formats::dotnet::model::classify has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4 (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/formats/src/dotnet/model.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b5047abdeaccc436a9f62a9033c639372db66e1ae2162ef1a9cca03e5b46b7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::extfs::file_block_map (cognitive 19): craft_anything_formats::fsread::extfs::file_block_map has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 3 (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/formats/src/fsread/extfs.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9666d34d291791248c610c023c59b0944e1c398db7e73d6dc258b9f85b2ede"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::pe::bound_modules (cognitive 19): craft_anything_formats::pe::bound_modules has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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/formats/src/pe.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a67bb60aa6181b2ce06b5e2458d6e9aca9a4124cad16c80992da15d35810cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::unreal_iostore::files (cognitive 19): craft_anything_formats::unreal_iostore::files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (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/formats/src/unreal_iostore.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c0b132a359e3f4fef05b8b9d5fb1a57e582022be16d1af5ec0f348ceaf975a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::verify::ecdsa (cognitive 19): craft_anything_formats::verify::ecdsa 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/formats/src/verify.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2a25303bbea57b4599b33bc44fd878e9376272f7c9bcefb545117ace0c75da"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::vendor::banner_vendor (cognitive 19): craft_anything_js::vendor::banner_vendor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 2 (4 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/js/src/vendor.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"18804fd70e0de77dadde65b55068382db64a888a03fe9394e72541d93535a669"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_setup::plan::plan (cognitive 19): craft_anything_setup::plan::plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 2 (6 pts), loops 2 (4 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/setup/src/plan.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"083df4fc5fdcd36faa6f4a2783e96454ca0063cd0a6a79080a4b37d449361d37"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::elf64 (cognitive 19): craft_anything_testkit::elf64 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, loops 6 (8 pts), match/switch 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3ca9c750ca426c94b8725398a9497b7aa0dd7f7a1a1c2a25b736fd0d0a5f03"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::project::check_card (cognitive 19): craft_anything_ui_egui::project::check_card has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 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/ui-egui/src/project.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"8399aabf39e093c0a15e8107e8ca09ac126cf01a5d78e026184f822d3c27a950"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::theme::apply (cognitive 19): craft_anything_ui_egui::theme::apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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/ui-egui/src/theme.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"73667079f9acb001fcedb86568749f5e889a30e3b522291b5442cb1dbe4b3c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::highlight (cognitive 19): craft_anything_ui_egui::workbench::highlight has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 1, 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/ui-egui/src/workbench.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2098fe77488e00b592541d67dd6b370cb0284185819bdf9af05252b4cca5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::jobs (cognitive 19): craft_anything_ui_egui::workbench::jobs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), 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/ui-egui/src/workbench.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"5977807c6956908c0033ec6b0ce4d8607762c9ec84cf89cf3a9a3a14f77bb7a3"}},{"ruleId":"D2","level":"warning","message":{"text":"native_ui_helper.swift.top-level code (cognitive 19): native_ui_helper.swift.top-level code has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 2 (6 pts), boolean chains 4, 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/engine/src/tools/apple_runtime/native_ui_helper.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36e5b3bda4973a2e41f6c399debedafbbd71936d96f20c8f4028798051f1981"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::rebuild::kinds::website::pick_routes (cognitive 18): craft_anything_ai::rebuild::kinds::website::pick_routes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, 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/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4f5f7a6368e92689ccce467a3b96c106e8a9003c82415f32a71ca099970d60"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::function_match::mask_a64 (cognitive 18): craft_anything_analysis::function_match::mask_a64 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 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":"crates/analysis/src/function_match.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5b1ddefe4ebc24cebabe61fca4343e966db9ae9d75562dec62e03b48327b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::web_har::merge_outlines (cognitive 18): craft_anything_analysis::web_har::merge_outlines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 1 (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/analysis/src/web_har.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"197eabca00ec677c90d5cf867b85304cc315c12c2bde1f387529c4e7b6823d87"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifter::condition (cognitive 18): Lifter::condition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3, boolean chains 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/disasm/src/pseudo.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3b17f5ea691739fedae4924a130d7bc72e85b5f619c06c18baeb71f78a1db6"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::files (cognitive 18): Plan::files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, 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/engine/src/pins.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a934ebe46b1b77159956162087af3e5f81e3e4acd9c9479f7d3271f945b681b"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::post (cognitive 18): Client::post has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 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/engine/src/tools/android_tools/jeb.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fca01db01cbbf7944fec494e2528886bd06e0d2783cc896598c64ffb0120a0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::capture_artifacts (cognitive 18): craft_anything_engine::tools::browser_tools::capture_artifacts has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 1 (4 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaed8a079a625ff130e518241c8a78b41848863c9f7d5bc261df9b124086cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::byte_search::native_bytes_find (cognitive 18): craft_anything_engine::tools::byte_search::native_bytes_find has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 2 (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/engine/src/tools/byte_search.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f728e131d9ab50709153e72f6976684b0e8f86a95a727076ab81cd5b04c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::compare_tools::app_call_path_find (cognitive 18): craft_anything_engine::tools::compare_tools::app_call_path_find has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 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/engine/src/tools/compare_tools.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2933e9b4501ccf80b8ef601b827fba709b0cd902d0a0a83aa314d52872fe5b"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::electron_fuse_tools::scan_file (cognitive 18): craft_anything_engine::tools::electron_fuse_tools::scan_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), match/switch 1 (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/engine/src/tools/electron_fuse_tools.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bae7d111229087c0c1f84573851f524a255d1644373a35b2c1849d735894313"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::game_archive_tools::game_iostore_list (cognitive 18): craft_anything_engine::tools::game_archive_tools::game_iostore_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 3 (4 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3730403946b0a7b9f55e8e837beb840ff141f6374c789110ddd7f0e3cc175fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::java_tools::java_archive_show (cognitive 18): craft_anything_engine::tools::java_tools::java_archive_show has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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/engine/src/tools/java_tools.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"918fd482b3eb7c9d59132e468efa2f5bf5bb1c411e6f763c51c998a136a961e7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engines::game::unreal_version (cognitive 18): craft_anything_engines::game::unreal_version has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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/engines/src/game.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5111e337c8a52a2cae66507c85ed80a0a774e996be90b4b53f32d879d4bb90"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engines::ghidra::analyse (cognitive 18): craft_anything_engines::ghidra::analyse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), loops 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/engines/src/ghidra/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"44785f2eae8ef372dd8010b77aa852a158aefb18ef824793ad37c280a77d1089"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_evidence::canonical::write_value (cognitive 18): craft_anything_evidence::canonical::write_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 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/evidence/src/canonical.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2284719707e83383441d86638eb4123d02662ef4242bfffa19f853ccefe18f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::jffs2 (cognitive 18): Scanner::jffs2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 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/formats/src/firmware.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"203936c5e014e1864cc60cfc5ea3946c63ddc5403af04fcc455b72cef42310b5"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::bun_program::read_modules (cognitive 18): craft_anything_formats::bun_program::read_modules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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/formats/src/bun_program.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e2ae8a83bb355b61cbe0d17c242f3f1b3d3858ed97831a31bf953afdeee5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dos::parse_mz (cognitive 18): craft_anything_formats::dos::parse_mz has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 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/formats/src/dos.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d85f745510ac4282966b0294768fe715ad542659fc1b9837a44ac66940217"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::extfs::walk (cognitive 18): craft_anything_formats::fsread::extfs::walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/fsread/extfs.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb83362fb82b29ffcd45568715dca08e93af36e72d6cc6ebd8846271b7f478e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::squashfs::parse_dir (cognitive 18): craft_anything_formats::fsread::squashfs::parse_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (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/formats/src/fsread/squashfs.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81e322f1f6d5218f018a66a352c78eaa3e29478a49aaea6df7f7de3cb9f5f71"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::packed_carrier::sections (cognitive 18): craft_anything_formats::packed_carrier::sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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/formats/src/packed_carrier.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3ca37d1630a6a015d106cd6094ffba0979acacc2ad26337965554cd5849e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Ref::render_full (cognitive 18): Ref::render_full has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (2 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/js/src/facts.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"002e880d49f4c64b8975ba28cea9be4a40cdec534227fb7327156390a15debca"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::on_expose (cognitive 18): FactVisitor::on_expose has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 2 (4 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/js/src/facts.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f348e0b7b00daec108d9161ec361ff1938eb13af55e17d916b57aa5af1cafba1"}},{"ruleId":"D2","level":"warning","message":{"text":"Mutex::wait (cognitive 18): Mutex::wait has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 pts), 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/platform/src/sync.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea86ad425eb6ae4c227c9125df64154f8757bfcf05c563996a8ff2613bc5e71"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::which::which_in (cognitive 18): craft_anything_platform::which::which_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (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/platform/src/which.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bef53d79920c4be64a62ef2a0f979c4c37dff3ab588ec3041360bf7bffb032"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftApp::pictures_checked (cognitive 18): CraftApp::pictures_checked has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 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/ui-egui/src/project.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"7014ebe592cccfacf242f9b57990d3543afbed0a8f1eb14f3d2ef67eadccb8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::make::choose_target (cognitive 18): craft_anything_ui_egui::make::choose_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1, 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/ui-egui/src/make.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"106ab5ed65d55016bc60fa74f287f978f7d74be3954c0f910ccf45a11195a872"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::menu::update (cognitive 18): craft_anything_ui_egui::menu::update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 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/ui-egui/src/menu.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a7ea31663af28b1248f990675f76e58eca5946cc5c625287743f963ff78ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::pins::section (cognitive 18): craft_anything_ui_egui::pins::section has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (2 pts), boolean chains 1, 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/ui-egui/src/pins.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e63b422d1f5c97c73b3262578c15acccea1cac7660e0629404e5b15b5b27c9"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::i18n_coverage::check (cognitive 18): xtask::i18n_coverage::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 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":"xtask/src/i18n_coverage.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c442594d41fbaf10d985e955195ca63ebdefc5b7240630afcadf01cfbd4e3fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ai::cli_agents::adapters::claude_handoff (cognitive 17): craft_anything_ai::cli_agents::adapters::claude_handoff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/cli_agents/adapters.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c286c8cb8688f76137cb1b30e09c2f052c52cb5dddb09c0a5f43f2f375ae210d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrub::scan (cognitive 17): Scrub::scan has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), loops 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/analysis/src/standin.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a89b2c05fd7afa9d933f40faa0edc72cd3a57dfaa224390049e7f5d608c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_source::glob_match (cognitive 17): craft_anything_analysis::js_source::glob_match has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 3). 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/analysis/src/js_source.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"82084ec598dab7eb6359862049bae3964cb934fac838ca107e36cdeb5b3444d6"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_trace::runtime_scripts_from (cognitive 17): craft_anything_analysis::js_trace::runtime_scripts_from has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/js_trace.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"204ef7725d565884f5672d0c768e49de7cd465266a5f95f6db34cee567eba781"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::native::value_trace (cognitive 17): craft_anything_analysis::native::value_trace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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/analysis/src/native.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5740c20bcb644fac012efbffea661ca28b5688173bbcb9f788572f4e38a1fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::web_har::safe_url (cognitive 17): craft_anything_analysis::web_har::safe_url has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 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/analysis/src/web_har.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eb9beb8b37cce2634c5cc44758bfdeb3b4aff6a799fab909cbd2c0bc812492"}},{"ruleId":"D2","level":"warning","message":{"text":"Source::parse_all (cognitive 17): Source::parse_all has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), boolean chains 1, 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/engine/src/tools/java_tools.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"129af2ddc7d1f20dce0967400714a96e6fc5c6c8c2fe0ba98ac5dd2d1a71e7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Replay::answer (cognitive 17): Replay::answer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), boolean chains 2, 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/engine/src/tools/standin_tools.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff702be5fa60aa89064fc36f0965cf97f1a36d591f7f1046cb47817c6b93fa23"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::native_function::native_instruction_show (cognitive 17): craft_anything_engine::tools::native_function::native_instruction_show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/native_function.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79799087d7d5f5eff6044cfc80a73a489d3ae0d54f489e31fa1d91577e3419"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::packet_tools::packets_fields_show (cognitive 17): craft_anything_engine::tools::packet_tools::packets_fields_show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, match/switch 2, loops 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/engine/src/tools/packet_tools.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1e26403fe197af2e2adb590f1dde28313876b3b9600794c2ef28cc10b8df48"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::web_runtime_tools::web_modules_trace (cognitive 17): craft_anything_engine::tools::web_runtime_tools::web_modules_trace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 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/engine/src/tools/web_runtime_tools.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0fdc43352b2ffc6892aebaf1c737f7401397a24c0bd64b469b84aa01e25c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Http::request (cognitive 17): Http::request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 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/engines/src/mcp_client.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1276d08a92dce19cd39e9b9bed7760d7323cf2cbf99bdc51fff34b072a702f8"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engines::adb::parse_devices (cognitive 17): craft_anything_engines::adb::parse_devices has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 1 (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/engines/src/adb.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0c6020cdd0bf1641bae3b7c6d804a5b4f37845f7db793770f6cd97fb05f7e8"}},{"ruleId":"D2","level":"warning","message":{"text":"StringPool::parse_with_recovery_budget (cognitive 17): StringPool::parse_with_recovery_budget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, loops 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/formats/src/axml.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"29389b59f794b181e0675f44b385cee8025903d561f9a1ed57d1d620c604395d"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::method (cognitive 17): Resolver::method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 3, boolean chains 2, loops 2 (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/formats/src/dotnet/model.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bab10fa95ed7350618588d3499f3ca494a2db3140e3aabc562419b9aa10f488"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::lz4 (cognitive 17): Scanner::lz4 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 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/formats/src/firmware.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9be83abbbc9b3199c4487da12e8c13897b66282d4314fa35623c5d1ef2e9b50"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::zip (cognitive 17): Scanner::zip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1, match/switch 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/formats/src/firmware.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c898609f5684e4a5bb4f60748100fc22fc082799a29c67aca2a0fc1c3bdde22"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::ubi (cognitive 17): Scanner::ubi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, 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/formats/src/firmware.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c98445b975c6537e8f6eb2648a9acfc3e773a381f06b59f25a4c05c269ae4d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::codesign::sha1 (cognitive 17): craft_anything_formats::codesign::sha1 has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/codesign.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3495cdf7d436282bc23316bd6f4e8985e0fe37f065d8a8d55a28d5d8cb3da3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::dex_ops::decode_one (cognitive 17): craft_anything_formats::dex_ops::decode_one has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 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/formats/src/dex_ops.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"242db4de5a71cda0f5705d43056536ef25730a2d3fffdd768efd9150773a67e9"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::fsread::extfs::read_indirect (cognitive 17): craft_anything_formats::fsread::extfs::read_indirect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, 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/formats/src/fsread/extfs.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1677fa1c39ba61c90a207c4fe1a604f2ad83de6e7509807c9fba262ba69be850"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::go::search_region (cognitive 17): craft_anything_formats::go::search_region has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 4 (7 pts), boolean chains 3 (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/formats/src/go.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0d46c5e529df87c887b1b3c46174abceab5301ed50f808e29c5702cf692044"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::java_class::parse (cognitive 17): craft_anything_formats::java_class::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), 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/formats/src/java_class.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e110ebdca2cfea77a88514a1bdd30d95adc84e28ca513eb3f2781713ecec8313"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::nib::parse_nib_archive (cognitive 17): craft_anything_formats::nib::parse_nib_archive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4, match/switch 2 (4 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/formats/src/nib.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4409328c59e603272957b19db9fb72955ffe782d067034a4a7c31ad83d791"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::packed_carrier::walk_notes (cognitive 17): craft_anything_formats::packed_carrier::walk_notes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/packed_carrier.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eac1ab9e5b553ff29f2e72c44d8cd263d52d5e933ed0cef42d89f7aea0c5a4"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::sqlite::without_rowid_order (cognitive 17): craft_anything_formats::sqlite::without_rowid_order has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 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/formats/src/sqlite.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7d0d8c45a455c839e9c1ae38dfa801eece93db8a8c3559bd37f23e386e5db1"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::unreal_pak::plain_entry (cognitive 17): craft_anything_formats::unreal_pak::plain_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 1 (3 pts), match/switch 1 (2 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/formats/src/unreal_pak.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc54321a297cfa17f4a38265298f7cb73452301ee519e7656155cff3b9b7b78"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::verify::verify_pkcs7_detached (cognitive 17): craft_anything_formats::verify::verify_pkcs7_detached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 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/formats/src/verify.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec8bf208cf1b4c215c530ed09e57b21b88a92071fd209e9ab5658501ffa5dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::recover::recover_modules (cognitive 17): craft_anything_js::recover::recover_modules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), boolean chains 1, 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/js/src/recover.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1dea3bbd0b24de5b3565ee0d0df8fc693c4e0394e625bac5fad54159d3acbe"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_setup::yaml::find_child (cognitive 17): craft_anything_setup::yaml::find_child has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 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/setup/src/yaml.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9b563a9e4391eda72456714f53305535874b966cadb4459be03c692273e443"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::games::unreal_pak (cognitive 17): craft_anything_testkit::games::unreal_pak has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), 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/testkit/src/games.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc8516d9c305238d42dea1d85aeca4c8bd76ae39aff53b683e4d9049bdb60d4"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::sidebar::row (cognitive 17): craft_anything_ui_egui::sidebar::row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3, boolean chains 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/ui-egui/src/sidebar.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca8a3c8a1663d5619cfdfe8aeeb6f1903f040fb8a004f1299a50196cae93d72"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::workbench::ledger (cognitive 17): craft_anything_ui_egui::workbench::ledger has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ui-egui/src/workbench.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b903af9ee06eec83227cc121486ff415c99fab90590b9baa312864fe84e0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentLoop::run_one (cognitive 16): AgentLoop::run_one has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/ai/src/agent.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"16009a67da568b1d3aee170a925a0b2046003d0f3c34c05c504bde81037be120"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenCode::parse (cognitive 16): OpenCode::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 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/ai/src/cli_agents/adapters/opencode.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf746d55415fdedd93237f2986c3c331ddcf7bcb76ea22ed9eb99b44167de81"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatStream::finish (cognitive 16): ChatStream::finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 1, loops 1, 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/ai/src/openai.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"179946cd5d069832713c19230129c1eb4a6d6c71f0c238a8adf778f6f3faa9eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Inventorier::add_archive (cognitive 16): Inventorier::add_archive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/js_inventory.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfae711e0e5e41112f914fa5aac857cf1b71f4bd76481c4f4b160d590872ada"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_compare::compare_versions (cognitive 16): craft_anything_analysis::js_compare::compare_versions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2 (4 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/analysis/src/js_compare.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e286df2eec83746ad8623522b50e7f8b41933463b019070aa56423ff67b4c98"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_analysis::js_trace::find_seeds (cognitive 16): craft_anything_analysis::js_trace::find_seeds has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/js_trace.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce9b28f12dffba169394a5b22c41a24fa91302dcf77c4349d4888ac19408bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::availability (cognitive 16): Engine::availability has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 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/engine/src/lib.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a73cf90348368c1c29c14fb2e2a44685ffe3aad76b7128faf7376784a86305"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::evidence_files (cognitive 16): Project::evidence_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a52b7a2b967fa5df392628e0f315a69dad524c8645a15f243dad5ed537716bd"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::browser_tools::collect_scripts (cognitive 16): craft_anything_engine::tools::browser_tools::collect_scripts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff52be6809cfb818a7d4742e92c14a7f29f5ba0923baf056220d69114fd9415d"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::build_tools::build_files_list (cognitive 16): craft_anything_engine::tools::build_tools::build_files_list 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/engine/src/tools/build_tools.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b339965b63602ec785038a43f85fd4536e2f711074a8d3fd24c199e0118a6829"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::format_tools::native_go_binary_show (cognitive 16): craft_anything_engine::tools::format_tools::native_go_binary_show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 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/engine/src/tools/format_tools.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3068d84d6e5c7a40906336e6054e6c35936cec7b622e2f075d8ce03eefe7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::game_archive_tools::extract_folder (cognitive 16): craft_anything_engine::tools::game_archive_tools::extract_folder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a61d1f403a3c8312ad6966f068c9739c2d669e6a4d5f7851a078b209495cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::managed_tools::tier (cognitive 16): craft_anything_engine::tools::managed_tools::tier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3, boolean chains 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/engine/src/tools/managed_tools.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9139e78a091817167a759ef053bc3d9d8ed1b07e3024f46e99254d783f2e04"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::native_formats::core_target_triage (cognitive 16): craft_anything_engine::tools::native_formats::core_target_triage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, 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/engine/src/tools/native_formats.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc7953bc203b5fe6a826daee449ee7367c84203cb40cdc36ff222ee5ce3057"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::web_tools::web_scripts_save (cognitive 16): craft_anything_engine::tools::web_tools::web_scripts_save has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_tools.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdb3dc00ad251d1111d2afb7a544d387e45fec067e37855eaebf3fcf7e77fca"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_engine::tools::website_tools::capture_into (cognitive 16): craft_anything_engine::tools::website_tools::capture_into has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), 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/engine/src/tools/website_tools.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaffa309e1829816013a5965c9e03e1c0da475459c21e3bbfa3e6b6c343c37d"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::request (cognitive 16): Client::request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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/engines/src/ghidra/client.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6e362a2cd8d112c9ded8b3ccfdd777648bc782ae1d50175b8e190c6b2d26f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::fat (cognitive 16): Scanner::fat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 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/formats/src/firmware.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce5278403f9cd8a5d50c8ecd8df563160287d1e18945971e15c9da1b7c93593"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::asar::walk (cognitive 16): craft_anything_formats::asar::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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/formats/src/asar.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bbaa8f0f069196bf4d02539bae570079bc944a7f3655717b19495e9ac74311"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::authenticode::read_signature (cognitive 16): craft_anything_formats::authenticode::read_signature has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 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/formats/src/authenticode.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4e291e370eb94566afd98af91e95b27100059f0dd55b52848983bf027ab9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::java_class::parse_members (cognitive 16): craft_anything_formats::java_class::parse_members has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), 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/formats/src/java_class.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e7a3015a20f4b97cea7c1adaf3cd2fdd556f8d38b0464d893fd7b19b077bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::rust_bin::rust_symbols (cognitive 16): craft_anything_formats::rust_bin::rust_symbols has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 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/formats/src/rust_bin.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"77845dc5e0accb379f47b2f3b0616e9a75d5911899e49a417f89e7a6b4729bab"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::sqlite::literal_default (cognitive 16): craft_anything_formats::sqlite::literal_default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 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/formats/src/sqlite.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb07cb7669b4efaa2b82048e25ab3ebaf6a24987c72c3070356d7ade7bbc61cd"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::unity_texture::parse (cognitive 16): craft_anything_formats::unity_texture::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 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/formats/src/unity_texture.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff86678f018e06e48a4ae7bad439e6bbd438e2a991315b893e3310fdd727f26f"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_formats::verify::verify_jar_integrity (cognitive 16): craft_anything_formats::verify::verify_jar_integrity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), 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/formats/src/verify.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"0605295fa014164d7e61363c6585eb08eb47f7a5b16e9b28cbe311a54d656848"}},{"ruleId":"D2","level":"warning","message":{"text":"FactVisitor::api_call (cognitive 16): FactVisitor::api_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/js/src/facts/api.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9573a771f6d33a2541f2c5b0616188843750fb0428e3273b4eebb512b953450"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_js::bundle::classify (cognitive 16): craft_anything_js::bundle::classify has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. 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/js/src/bundle.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf47a04c87cae71b02e74ba75127170a7a7b89c4675b6715ac350700394af566"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_platform::standin_server::write_response (cognitive 16): craft_anything_platform::standin_server::write_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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/platform/src/standin_server.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48a478f42d16aefb19bc31e9572237bbdccf8fa4bf9768824016501ba9b0353"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::apple::to_bplist (cognitive 16): craft_anything_testkit::apple::to_bplist has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (6 pts), match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (add). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/apple.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bba2fa44405f637cc1d14d620f6ed7761cc35cda91c0887f526140967f0372"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_testkit::sqlite::without_rowid_db::tree (cognitive 16): craft_anything_testkit::sqlite::without_rowid_db::tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (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/testkit/src/sqlite.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2cbc845bef65bcc36aed5a449ba38e12fb24be176f7b1c3eb6b7db8bd60b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"CraftApp::acted (cognitive 16): CraftApp::acted 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/ui-egui/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8237c6276868e3e43cce1f5ce36ed181871e67eb0e992649fdf0c181029fd331"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::chat::rich_text (cognitive 16): craft_anything_ui_egui::chat::rich_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, 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/ui-egui/src/chat.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6c7ac12e988114ff9aa7837899ba10a16877c7e8efdeb15b20d9bb38610f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::evidence_ui::details (cognitive 16): craft_anything_ui_egui::evidence_ui::details has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), loops 2 (4 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/ui-egui/src/evidence_ui.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41199a6e2d2569c45c023d791f164e73d14cf34483eb17f5ec4c298e673d365"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::first_run::brain_card (cognitive 16): craft_anything_ui_egui::first_run::brain_card has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 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/ui-egui/src/first_run.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1916940243e7368b0a925c3d8364baffe868869fe1e9fdf72fde9796a4af8a"}},{"ruleId":"D2","level":"warning","message":{"text":"craft_anything_ui_egui::settings_ui::general (cognitive 16): craft_anything_ui_egui::settings_ui::general has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (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/ui-egui/src/settings_ui.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f584c5987527b4874031a8780398d20931855e632cb4075cf61bd820b983"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CraftApp: TooManyMethods \u2014 162 methods, declared across 8 files: src/lib.rs (57), src/project.rs (52), src/builders.rs (20), src/engine_ui.rs (16), \u002B4 more file(s). The bar is 30 methods; this is 132 over it, 5.40\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/ui-egui/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"de82f7f634e07a67a54500beec7bf50351ae7dbaf329325e4a888862840374de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_analysis::js_app::analyze_application: FunctionTooLong \u2014 craft_anything_analysis::js_app::analyze_application runs 477 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 377 over it, 4.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/analysis/src/js_app.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4db63ecae883f5f5336e750d01cfbd382c6c8532ab02be60199b138e0175b5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/browser_tools.rs: FileTooLong \u2014 1806 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 61 free functions. The bar is 500 significant lines; this is 1306 over it, 3.61\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/engine/src/tools/browser_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6e15b39d9a299f8cfb26a3334bdd54bad25f14583e3bcf15db26763391fed3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: D.operator: MethodTooLong \u2014 operator runs 314 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 214 over it, 3.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/formats/src/swift_demangle.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d38014ca10643fdc39d1997d75c7cb65cd2407038a7565085812534a457073"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_ui_egui::settings_ui::ai: FunctionTooLong \u2014 craft_anything_ui_egui::settings_ui::ai runs 298 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 198 over it, 2.98\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/ui-egui/src/settings_ui.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d810d5f89e461b858e28d70cf245608d41b759778d7bb8df7af523b6297168f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project.rs: FileTooLong \u2014 1380 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 33 free functions. The bar is 500 significant lines; this is 880 over it, 2.76\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/ui-egui/src/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea73b104ba3f1a8eb36683b78f22ad21bc343dd059a8a1c66473e19ebbec83c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1331 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: CraftApp (4 blocks, 416-2037). The bar is 500 significant lines; this is 831 over it, 2.66\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/ui-egui/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33e63c0ca63a60a03dcec2f0edaecf1cb18cbe1b32e5cca2892051f7a786710"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CraftApp: ClassTooLong \u2014 1057 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), 162 methods, 4 blocks, lines 416-2037. The bar is 400 significant lines; this is 657 over it, 2.64\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/ui-egui/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d21d68d20aec39e1a87e9882030d5a7cf76927cc4bbe9200159e9b161b978f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/firmware.rs: FileTooLong \u2014 1294 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: Scanner (2 blocks, 309-1536). The bar is 500 significant lines; this is 794 over it, 2.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/formats/src/firmware.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4d7172fe56aa076ebfdaa6503453b83e57323e4c6dcd3ab43e0de9288f2ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::wasm::inspect: FunctionTooLong \u2014 craft_anything_formats::wasm::inspect 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/formats/src/wasm.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3cea8b29f0bc4d831c40e166f0e663f7f3af26ae278cfe7dc68255f35376a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::adb_tools::specs: FunctionTooLong \u2014 craft_anything_engine::tools::adb_tools::specs runs 247 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 147 over it, 2.47\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/engine/src/tools/adb_tools.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14b01f2d505904c2d14cec08232abd83bef60cb8d7ff18686a689825c7112d6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scanner: ClassTooLong \u2014 949 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), 34 methods, 2 blocks, lines 309-1536. The bar is 400 significant lines; this is 549 over it, 2.37\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/formats/src/firmware.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6fa59abbd0c9bdfe22a3c15653e2425f25b5a0018fb0edb6472601e53f6356"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_testkit::managed::build: FunctionTooLong \u2014 craft_anything_testkit::managed::build runs 232 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 132 over it, 2.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/testkit/src/managed.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b1f55aef7af96933f9a11a219c1d7c5f2a81f1df50564e70f56066b3b9b407"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::firmware_tools::firmware_image_extract: FunctionTooLong \u2014 craft_anything_engine::tools::firmware_tools::firmware_image_extract runs 228 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 128 over it, 2.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/engine/src/tools/firmware_tools.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ffd17d0ed1e89fb8b93328b1f3fbc660ba2d08c74ac9bb9bb6e940d718b3b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CraftApp: TooManyFields \u2014 68 stored fields beside 162 methods. The bar is 30 stored fields; this is 38 over it, 2.27\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/ui-egui/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"714b0c457a495a69b8257d8977a15b8286a832befe6d2e69a133f62b4a689027"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FactVisitor: ClassTooLong \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), 46 methods, 3 blocks, lines 150-1530. The bar is 400 significant lines; this is 492 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/js/src/facts.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d32248a265f4486e04856aed386357124e8eebc3f0ba83eec06132a7fcfc18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/adb_tools.rs: FileTooLong \u2014 1078 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 50 free functions. The bar is 500 significant lines; this is 578 over it, 2.16\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/engine/src/tools/adb_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb11348ba5f01d167b8aa363aba1f66549816b8d597231c6a2432674b45475f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pcap.rs: FileTooLong \u2014 1053 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 553 over it, 2.11\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/formats/src/pcap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c2cec79675498a8f95bd9c2367b146fde95c906bf610c00c924d6cca97143f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/game_archive_tools.rs: FileTooLong \u2014 1050 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 550 over it, 2.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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86357b4eea0a06dd2593233293a33c9dda0f0aa2b559b62fdb80823ed26c584c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/facts.rs: FileTooLong \u2014 1047 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 85% of them inside a single declaration: FactVisitor (3 blocks, 150-1530). The bar is 500 significant lines; this is 547 over it, 2.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/js/src/facts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d75ee4aea6411e22000aa46ba48644c0ad475d84553a5376a840e591c8ac80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::macho_deps::parse_thin: FunctionTooLong \u2014 craft_anything_formats::macho_deps::parse_thin runs 207 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 107 over it, 2.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/formats/src/macho_deps.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ea4daebb6fb35c567232a98ff0723d52b2aa613b32a4a04a82fb2241abb4d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/apple_tools.rs: FileTooLong \u2014 1032 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 34 free functions. The bar is 500 significant lines; this is 532 over it, 2.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/engine/src/tools/apple_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ea67d4e8f72c6359211bd99865094c6630829cf89b95493d53a17dca0885e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_platform::capture::unix::capture: FunctionTooLong \u2014 craft_anything_platform::capture::unix::capture runs 204 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 104 over it, 2.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/platform/src/capture.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"4109ac75736baa2730d9a2c2d5f93159746e20036cb0596df23cb97ca4371970"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.analyze: MethodTooLong \u2014 analyze runs 195 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 95 over it, 1.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/disasm/src/program.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851ad963a3b5633967ea6ce6c4964ab380078ed84608c50fc3fc6b29b513d0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Worker.run: MethodTooLong \u2014 run 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/ai/src/rebuild/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb2c2a152e365276cdefdd6ad99adf94e550d4ae9e1e359c1e505a2013bc525"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::macho::enrich: FunctionTooLong \u2014 craft_anything_formats::macho::enrich runs 191 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 91 over it, 1.91\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/formats/src/macho.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ec3a8650aa845a98dba0b6730b5811eece5c62cac4d327bae8d74016da82c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/swift_demangle.rs: FileTooLong \u2014 943 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: D (2 blocks, 117-975). The bar is 500 significant lines; this is 443 over it, 1.89\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/formats/src/swift_demangle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc01fe09a5fb1730a7da49cf97f25de69b08308a8d6ebf7732502ce368103cea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/android_tools.rs: FileTooLong \u2014 939 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 439 over it, 1.88\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/engine/src/tools/android_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"003c2961eb991b955d7e98d03d02230c99f3a4b0ca161198c9da6acffcf74bdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/program.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). The bar is 500 significant lines; this is 429 over it, 1.86\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/disasm/src/program.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6453642a09478166e9a275287685fca3b1aefc7ea240582d54dd6c8aa7176fb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_testkit::macho64: FunctionTooLong \u2014 craft_anything_testkit::macho64 runs 182 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 82 over it, 1.82\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/testkit/src/lib.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a824f31f1903402bcdbbf42208f042f30e74360479302b6b20ffda197e2bc45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotnet/model.rs: FileTooLong \u2014 899 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 399 over it, 1.80\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/formats/src/dotnet/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b200def0bf660771d6c66957c151494c1f67f318806ff303cfbb5602d4cba4ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CraftApp.handle_done: MethodTooLong \u2014 handle_done runs 176 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 76 over it, 1.76\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/ui-egui/src/lib.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9848847477ec0094d4ef6436c2b00e8dc6fce1e5f8e848a1111b7cc027114073"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/standin.rs: FileTooLong \u2014 878 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 31 free functions. The bar is 500 significant lines; this is 378 over it, 1.76\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/analysis/src/standin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa17d3b2192410b12657993dd79b84aa51fffeb211186670a4ad3cf480e6066"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_disasm::decode::decode_a64: FunctionTooLong \u2014 craft_anything_disasm::decode::decode_a64 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/disasm/src/decode.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14b67a2ac7404f088ca2965e36293344242312a2e1bbdb4ac167fb41f91801b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/website_tools.rs: FileTooLong \u2014 866 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 36 free functions. The bar is 500 significant lines; this is 366 over it, 1.73\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/engine/src/tools/website_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4237a9ef868bf5de4fb67e7aa244ce9c061f2eaddd52bc28a8ff70f07c416bd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pseudo.rs: FileTooLong \u2014 847 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 347 over it, 1.69\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/disasm/src/pseudo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70282f531c4290ce1e6b2fabf05fd26e3bff0f03eaf3e5b3e3775d78cde9f41f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FactVisitor.on_call: MethodTooLong \u2014 on_call 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/js/src/facts.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d08490b354a616d4e616447cd9135dab9d3b5c7c97a8305f00226ab57daa47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/program_facts_tools.rs: FileTooLong \u2014 843 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 343 over it, 1.69\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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf86d4d873a09e186d7fbe8d6582203bf211e08f600ea9399198d26c7f28f02d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotnet/csharp.rs: FileTooLong \u2014 840 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 340 over it, 1.68\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/formats/src/dotnet/csharp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d334cba742d343972a31b1263324a078ec67d3c9eab1fcdec538a1ae97aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decode.rs: FileTooLong \u2014 839 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 339 over it, 1.68\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/disasm/src/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a578a5214b1fe80e00ca69b2dc78c82e58dad7ef615cff37ed111f9eac8abcd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native.rs: FileTooLong \u2014 829 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 329 over it, 1.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/analysis/src/native.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34fcab5704a06bf9921df131e0ba5469bc62ce5437edd64b752314792e9a93d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DexBuilder.build: MethodTooLong \u2014 build 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/testkit/src/android.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89385f179cfb9477ea4d37daae117f98f1038b64d6e4a33067b10cf1557fd47"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: D: ClassTooLong \u2014 648 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 117-975. The bar is 400 significant lines; this is 248 over it, 1.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/formats/src/swift_demangle.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"35645bfd405fe6db5e232be842e7e8a6079ef79d2b09233b77d66d615e885bb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 803 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 303 over it, 1.61\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/testkit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"035098bf42d29bdcd0a08f3641700843aa9fb9065509f0fb0f321e63ccac4ae5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/android.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), declaring 33 free functions. The bar is 500 significant lines; this is 302 over it, 1.60\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/testkit/src/android.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4afa764afa1c2736b290b540797f297d687b32a75b09ebf0f85fb97d385349"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AiHub: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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/ai/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f3764b482b723c659e18dd82ceadd01c122b0a13405397ed34afaafd1202cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::evm::analyze: FunctionTooLong \u2014 craft_anything_formats::evm::analyze runs 158 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 58 over it, 1.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/formats/src/evm.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4db95da2ef3b62e818206de7b902d742633a4b7290f709bd415f75e17544b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rebuild/mod.rs: FileTooLong \u2014 789 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: Worker (2 blocks, 416-1189). The bar is 500 significant lines; this is 289 over it, 1.58\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/ai/src/rebuild/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3be3191360bbe44885969e592681a3c5c3c092f8aa2c0387e18f60419de95f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sqlite.rs: FileTooLong \u2014 788 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 288 over it, 1.58\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/formats/src/sqlite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5349e5b00ac613abd9e5d4802386756396e0386ac89c83205ff7713f8c0a11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::solana::inspect: FunctionTooLong \u2014 craft_anything_formats::solana::inspect runs 154 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 54 over it, 1.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/formats/src/solana.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2bce2a09b822b2c466e3177352c65ba44d713d86e7f2e2782662a195d6175"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FactVisitor: TooManyMethods \u2014 46 methods, declared across 2 files: src/facts.rs (34), facts/api.rs (12). The bar is 30 methods; this is 16 over it, 1.53\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/js/src/facts.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea28a058d373d790f2603d122cd0f5e212088c18e7e1f3a3bc12b9e07e59443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/managed_tools.rs: FileTooLong \u2014 765 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 265 over it, 1.53\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/engine/src/tools/managed_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"922697cb2400235745780347dbe7aa8fd27c402622e9f8336904b2c1b67486ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/js_app.rs: FileTooLong \u2014 763 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 263 over it, 1.53\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/analysis/src/js_app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2989e4e89c530aaf84abe18285cb55b36326d31342ec4ac0107d6c08e527efa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/elf.rs: FileTooLong \u2014 758 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 258 over it, 1.52\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/formats/src/elf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8424cbff3ba6e8955f7f37dcfe839ac63dea53b030b3d7a6cbc65b6c48fe38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_disasm::decode::decode_a32: FunctionTooLong \u2014 craft_anything_disasm::decode::decode_a32 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/disasm/src/decode.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ad6ae6ea13b52905b7514764c60789b00ef8c7d56c89cf5cb82f0bc0136f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_disasm::dataflow::def_use: FunctionTooLong \u2014 craft_anything_disasm::dataflow::def_use runs 147 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 47 over it, 1.47\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/disasm/src/dataflow.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"711f1550158d48581fed3a397851292d2a9117d63f98671d04160ee703cb8f37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::native_workflows::specs: FunctionTooLong \u2014 craft_anything_engine::tools::native_workflows::specs 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/engine/src/tools/native_workflows.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f2d29d85ce220d49c28e7088aa486740a8ef8ee89150d53b48a3d1a72793c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_testkit::elf64: FunctionTooLong \u2014 craft_anything_testkit::elf64 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/testkit/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1c9eed77a8ede50594c694c588f1a1cea849af657a64c9744757bd5afc437c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::native_listing::specs: FunctionTooLong \u2014 craft_anything_engine::tools::native_listing::specs 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/engine/src/tools/native_listing.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbc36523deba69e501ee2c42e7a33d8971351bd6fda474115e0c447c4885845"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/capture.rs: FileTooLong \u2014 720 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 220 over it, 1.44\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/platform/src/capture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27c9195c63a97e7862df3fe67a89267a3718db0a77f7ba55cc472ab919644b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workbench.rs: FileTooLong \u2014 710 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 210 over it, 1.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/ui-egui/src/workbench.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b6ab844ace07638c292ff20ec01647dc7e54e0baf2b050ccdfd5990b927a50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::project_tools::specs: FunctionTooLong \u2014 craft_anything_engine::tools::project_tools::specs 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/engine/src/tools/project_tools.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0ec0adc8b6af53348a857892dba50e44a391a5de89120af6d3d622086ac89b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/web_common.rs: FileTooLong \u2014 707 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 36 free functions. The bar is 500 significant lines; this is 207 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/engine/src/tools/web_common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5ccb142aaef47b88e02a913b3c780fcdf8225a17d06db30da5977bcf72310e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pe.rs: FileTooLong \u2014 700 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 200 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/formats/src/pe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49b07ed33b653d5d8884d02fc08396038acfff7931f6b3a6bac9ce9c694dc47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings_ui.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/ui-egui/src/settings_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac331b1dd9e2cbf0e5017ebd3500bdbd8a77b3da9fc7b056be18a6df42b36d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::js_tools::load_app_input: FunctionTooLong \u2014 craft_anything_engine::tools::js_tools::load_app_input 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/engine/src/tools/js_tools.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b7cc60f4d40f45ea47a948456a104b859fbfac3767f137a8ad3e230c0a6601"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 692 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 192 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/engine/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec78474e7275eeaee237b48913f28b9f5e6d99d364802ecdf23252046e8fe3bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_setup::clients::clients: FunctionTooLong \u2014 craft_anything_setup::clients::clients 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/setup/src/clients.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e5e6a65950889b2083983199878833999e88b662fb7e8477ffb06f78df552"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process.rs: FileTooLong \u2014 685 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 185 over it, 1.37\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/platform/src/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb02e1868b55f7aa4784c23de175eeee123868626d3035c15bd1811969b32a03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli_agents/mod.rs: FileTooLong \u2014 683 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 183 over it, 1.37\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/ai/src/cli_agents/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b458f46b851acc74680f5df2246ab6de18bb3c9b35207c52f7451410723365"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_ai::cli_agents::run_cli: FunctionTooLong \u2014 craft_anything_ai::cli_agents::run_cli runs 136 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 36 over it, 1.36\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/ai/src/cli_agents/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e936f533956cad6e611d219ce2fcc15f1a740b0af76ca0799386cb67f36ebc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::native_annotate::specs: FunctionTooLong \u2014 craft_anything_engine::tools::native_annotate::specs runs 136 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 36 over it, 1.36\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/engine/src/tools/native_annotate.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a424fb56d3622c1ce9b0aeb18fe68707415eebf3ca039d40a45bd53622f4deb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::java_ops::opcode: FunctionTooLong \u2014 craft_anything_formats::java_ops::opcode runs 136 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 36 over it, 1.36\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/formats/src/java_ops.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a03585a0d3569c48e1b721165eebe08aa9ae9693b3ccff09311301a5b49df6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/install_tools.rs: FileTooLong \u2014 676 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 176 over it, 1.35\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/engine/src/tools/install_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dccf5cd366c0011cfdbe6efdea689ddae743ac030b06e0e81bfd99894fa5de1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Sim.step: MethodTooLong \u2014 step 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/analysis/src/java_decompile.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"059f07c0b7ece05a888f9f0bd34b23848c2f5d2113c93852fb48e49a7e7f1d36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_cli::ai_cmd::ai: FunctionTooLong \u2014 craft_anything_cli::ai_cmd::ai 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":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"be294eeeeb70618f1e8a826a4cc7644b98faf0c6c9df57596ef6e7308f1247d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_disasm::decode::decode_x86: FunctionTooLong \u2014 craft_anything_disasm::decode::decode_x86 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/disasm/src/decode.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"624790a83b505e50ec0947f194ac82f79e4155a61ab378b24f3c5b59d18789d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::session_tools::specs: FunctionTooLong \u2014 craft_anything_engine::tools::session_tools::specs 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/engine/src/tools/session_tools.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"397ca91eb94e370cf4697c6e64bb4b9221fe8a7629ba2c805fd0e16862e01afc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 658 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: AiHub (2 blocks, 372-1026). The bar is 500 significant lines; this is 158 over it, 1.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/ai/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3c75b24dc2ea38cdad9e97100c52248242d54f9f98e5e991e57ad58ba732a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::browser_tools::web_walkthrough_record: FunctionTooLong \u2014 craft_anything_engine::tools::browser_tools::web_walkthrough_record 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf749dff30c6654264d0ffbbe153ab03e9f126c8e8e6df8b0bc30ed44261c57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine_ui.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). The bar is 500 significant lines; this is 144 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/ui-egui/src/engine_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9122315e59c34edd4c737c4f6a1b5061292e74534873f39ff13a7af6ceb766c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/apple.rs: FileTooLong \u2014 640 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 39 free functions. The bar is 500 significant lines; this is 140 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/testkit/src/apple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7bc7a27d9055a1035c8489d2d3f8af7054c14a7a9adf6972a955728f53378b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::database_tools::db_sqlite_show: FunctionTooLong \u2014 craft_anything_engine::tools::database_tools::db_sqlite_show 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/engine/src/tools/database_tools.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e6fa2eb9f9ab9b9389986533c0d3a080a82ea85b417ddefb259ce1b4113519"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::sbpf_tools::formats_sbpf_show: FunctionTooLong \u2014 craft_anything_engine::tools::sbpf_tools::formats_sbpf_show 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/engine/src/tools/sbpf_tools.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5124e8450e32e37358a3715d4b168b47ee518a544e763a7ec606f7043ffc421b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::binary::parse_object: FunctionTooLong \u2014 craft_anything_formats::binary::parse_object 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/formats/src/binary.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c4737715410eb2c69f44ea39ea4714344e4242a329c90dbb1c420ffe59fc24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::android_tools::android_package_show: FunctionTooLong \u2014 craft_anything_engine::tools::android_tools::android_package_show runs 127 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 27 over it, 1.27\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/engine/src/tools/android_tools.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0994306bd2dc3f515a165be8e2f2a7483a75875208e36aa8e338795a563a382b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: UiState: TooManyFields \u2014 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27\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/ui-egui/src/state.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9448597f9ec5962fd3daa97e15d99259b6b0986470cf98eaa70b15d189d4aa16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::hints::detect: FunctionTooLong \u2014 craft_anything_formats::hints::detect 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/formats/src/hints.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bf803ef7eab2628912ce68ecb15faac9ececa83ca799599437a8b2e4a4e914"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::native_function::specs: FunctionTooLong \u2014 craft_anything_engine::tools::native_function::specs 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/engine/src/tools/native_function.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"076e441d8f9997121d5c29f02634ca3174b3bae7cc155e63c439ed69e55000b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::zip::parse: FunctionTooLong \u2014 craft_anything_formats::zip::parse 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/formats/src/zip.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c493b4cbc1da7727cb4a3a9d69cedb18b6f9599fcf9fa6d34345888653e24d07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scanner.member: MethodTooLong \u2014 member runs 124 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 24 over it, 1.24\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/formats/src/dotnet/csharp.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb9dfa49fb82f4ce13b24ff44a9e0a17a3dddb6609f7c1db1703d1cbe05163f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: craft_anything_ui_egui::widgets: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; 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/ui-egui/src/widgets.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d58d85b4dd980d66f5366a7d3f8fea370676e27658bcdb4cb52f2ff89ca9d75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::pcap::tls: FunctionTooLong \u2014 craft_anything_formats::pcap::tls runs 123 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 23 over it, 1.23\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/formats/src/pcap.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f17c5629189ff2d7a1b59ada531c9e80615d0002d895b1ed718685a2d2cba5e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Worker: ClassTooLong \u2014 486 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), 33 methods, 2 blocks, lines 416-1189. The bar is 400 significant lines; this is 86 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/ai/src/rebuild/mod.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1434f5e178a7dc8e4ddb57a5d06a49b5f768aecb93e4145efd4733163231c33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_disasm::sbpf::decode_one: FunctionTooLong \u2014 craft_anything_disasm::sbpf::decode_one runs 120 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 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/disasm/src/sbpf.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eadb79cbf9af94cb2eb1c1ebeeb7ac4dbee9a6da6bad502c42299534f15a2ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent.rs: FileTooLong \u2014 597 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 97 over it, 1.19\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/ai/src/agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cc4e01510eecb47a2e22ef9b31682cad6f5c124414aca92086ae2f86aeabe0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::dex_ops::decode_one: FunctionTooLong \u2014 craft_anything_formats::dex_ops::decode_one 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/formats/src/dex_ops.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f264cdecf2180f7dfa549d6bda06f049edac287a1cdc76a371b0150113ca5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_testkit::firmware::squashfs_image_with_extended_directories: FunctionTooLong \u2014 craft_anything_testkit::firmware::squashfs_image_with_extended_directories 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/testkit/src/firmware.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16a0d5a5c68fdcf2e588dea73fd044de528d9681fb79161afbd234033cfc484"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_testkit::flutter::elf_so: FunctionTooLong \u2014 craft_anything_testkit::flutter::elf_so 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/testkit/src/flutter.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"78787be88ab5ec5d6187cc4b34706d4f40e7d66707aa3467469d6d6b28c053ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/go.rs: FileTooLong \u2014 588 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 88 over it, 1.18\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/formats/src/go.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7ff32a2824495726a4d546a71c583b08b7017577ec4cbe36f6a12ee823ca42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/java_decompile.rs: FileTooLong \u2014 586 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 86 over it, 1.17\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/analysis/src/java_decompile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"797af4a514ef22ff1fc77da2f8e6610246038200d28df1bb1bd7d2f149f57246"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/native_formats.rs: FileTooLong \u2014 585 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 85 over it, 1.17\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/engine/src/tools/native_formats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a83e9cb14c5be81627d2f030b2755c38add3e071efdd9fd1997654029b1851f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::pe::parse_resources: FunctionTooLong \u2014 craft_anything_formats::pe::parse_resources 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/formats/src/pe.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"163f8cf2c983094182b292476cf837914d01d9287d67073a3a59e9902ebdc7ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Workspace: TooManyMethods \u2014 35 methods, declared across 2 files: src/workspace.rs (34), workspace/progress.rs (1). The bar is 30 methods; this is 5 over it, 1.17\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/engine/src/workspace.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3b0059d9b0384a4206c866acc8fef344913bb10c94988d13538e340d95e300"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/application_tools.rs: FileTooLong \u2014 580 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 80 over it, 1.16\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/engine/src/tools/application_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2d4e62cb5dcd9ad24646f4de1ee77ecc23e5d921529370af2f7a78a79f80fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::elf::parse_core: FunctionTooLong \u2014 craft_anything_formats::elf::parse_core 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/formats/src/elf.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd91e5e1eaf0c6e1e3937cb4ee80baec3a6ec498c408f3af4627ab8945dd1cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/java_tools.rs: FileTooLong \u2014 578 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 78 over it, 1.16\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/engine/src/tools/java_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0792738ce4451fc193b4324fc73face306a11d3d02690b3bd51845d99f3dbe2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/game.rs: FileTooLong \u2014 578 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 34 free functions. The bar is 500 significant lines; this is 78 over it, 1.16\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/engines/src/game.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fec04914a326bac8ee988198fdb098af0fda243fe5289290d830516357cb0b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_disasm::program::scan_function: FunctionTooLong \u2014 craft_anything_disasm::program::scan_function 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/disasm/src/program.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53d23369b8320576ae8de37707cde4c79c1b13138299c9de8d4342e0a4efc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/artifact_tools.rs: FileTooLong \u2014 573 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 73 over it, 1.15\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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d968274a4a6c7c5a648b4dbe78e74639dcaa21c864d170f37ac5b5a1d5ebbc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_ui_egui::palette::show: FunctionTooLong \u2014 craft_anything_ui_egui::palette::show 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/ui-egui/src/palette.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebdde8d1f7b0e27365e15fd4b4cee765dfd5f2e019b0380a4b705bf33d4c5f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/native_function.rs: FileTooLong \u2014 567 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 67 over it, 1.13\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/engine/src/tools/native_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"166db44593ed353dcbbbd17cfa449e7acddae6552e0a1fd2d22242e79db8d366"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scanner: 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/formats/src/firmware.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0037b18bfeef16276e1c110baa0952fa9de3e4a807b50813091ca60a6de77d11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::browser_tools::specs: FunctionTooLong \u2014 craft_anything_engine::tools::browser_tools::specs 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"065e064da3e9e59d5f94b20abed35e7498de12f94f7037a14d32149e13ca342b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_formats::dotnet::csharp::tokenize: FunctionTooLong \u2014 craft_anything_formats::dotnet::csharp::tokenize 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62fd37fc2fb024504d66b9d03d640eb36c00e92c9380c075e55f17ae0532c02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::program_facts_tools::app_builds_line_up: FunctionTooLong \u2014 craft_anything_engine::tools::program_facts_tools::app_builds_line_up 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0de4a203c41c4420dd4bd443b11c5b6f0c856b20544d8d89a67b78d5b61099"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scanner.run: MethodTooLong \u2014 run 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff74b603aa904079c70d8e56cc1a35896732eddc213e502a51dd80c78260f0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kinds/website.rs: FileTooLong \u2014 553 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 53 over it, 1.11\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/ai/src/rebuild/kinds/website.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d00b7a7794f9142d8c828560b11bc842c9066fcb86ef4a7febaabc0e170ba0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Worker: TooManyMethods \u2014 33 methods, declared across 5 files: rebuild/mod.rs (23), rebuild/study.rs (7), kinds/mod.rs (1), kinds/runs.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 3 over it, 1.10\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/ai/src/rebuild/mod.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2c715d6111d15ee6fd64ef0720b5cc0dd8554b4316e4368dbc69b2ef32e68f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::program_facts_tools::native_source_folder_write: FunctionTooLong \u2014 craft_anything_engine::tools::program_facts_tools::native_source_folder_write 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/engine/src/tools/program_facts_tools.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cf792a7fddef56ead2e95f852efa587c8a384a3f485f8256d8d8bd61ab17c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli_agents/acp.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/ai/src/cli_agents/acp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aedf9089ff697a839333d5d4a000499f79b50f85053b428c8ff14f36868164"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/compare_tools.rs: FileTooLong \u2014 548 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 48 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/engine/src/tools/compare_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c568f0e850764fe63d3933a52b9328105e70736e950a61105deade67ccd06b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::process_tools::runtime_walkthrough_record: FunctionTooLong \u2014 craft_anything_engine::tools::process_tools::runtime_walkthrough_record runs 109 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 9 over it, 1.09\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/engine/src/tools/process_tools.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"318ebd730ab5dd6331958854d68d9609d9d830c14b81b27adaf722627422dd14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/binary.rs: FileTooLong \u2014 541 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 41 over it, 1.08\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/formats/src/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0b5ca788471de80eca236423b035a7d4c6e13d6cbe39675aa04a12fd2e2c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/firmware.rs: FileTooLong \u2014 541 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 41 over it, 1.08\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/testkit/src/firmware.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de960cd1ce326e0b117505b53453a55e7bdd66222842a29a89449eba106a0584"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/games.rs: FileTooLong \u2014 537 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/games.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa18f277d101993c91276aa07f3513936b842359fc2f23e19c5caf6c2777abb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/investigation_tools.rs: FileTooLong \u2014 535 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 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/investigation_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8e01da61866efa3804ab7206f0c1472eaefbe17735822f71374001fbca8342"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/native_listing.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). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/native_listing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1e6f2d2d9cc99205ddbfa82a4745bf04f9b8db27bbbf6176d20311bada34a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_analysis::native::triage: FunctionTooLong \u2014 craft_anything_analysis::native::triage 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/analysis/src/native.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fabc94b11070d65b6dd7e06a3d5bdc33d888c8cd61f044071d2de5767591fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_analysis::standin::build: FunctionTooLong \u2014 craft_anything_analysis::standin::build 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/analysis/src/standin.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b450dcf5cf9f91d14e02c1c50f4a3d7643ae77f429107113c10db8ab1b75957"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_engine::tools::artifact_tools::core_archive_extract: FunctionTooLong \u2014 craft_anything_engine::tools::artifact_tools::core_archive_extract 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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b21518358db8fd3a07df9d26e3e577d74d5939e4815db72b6015ef8517cf567"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_js::api_ops::read_document: FunctionTooLong \u2014 craft_anything_js::api_ops::read_document 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/js/src/api_ops.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fc02a6b7f055a19af28ceeef995596f6858e372beab9f844b6ac6959d61fe6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bptc.rs: FileTooLong \u2014 515 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 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/bptc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2006acc96d849ac698bbd2b67b64f53d952a67c9572426f95d5ee57ab685d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentLoop.handle_turn: MethodTooLong \u2014 handle_turn 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/ai/src/agent.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2e04105a45bf041f6a033b1d23eae41708b4fd34648beaa04fd2d5e47553e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/frida_tools.rs: FileTooLong \u2014 513 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/frida_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb763f37d5fdb884a3ea5981abfa6679a7633987b4b3d1704c686cecac347978"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/java_class.rs: FileTooLong \u2014 511 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 11 over it, 1.02\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/formats/src/java_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca65b7dede74c4107f15d5621b36ce00e9a607bc0388941b86d8d7477d0102"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: craft_anything_ui_egui::prompt_box::show: FunctionTooLong \u2014 craft_anything_ui_egui::prompt_box::show 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/ui-egui/src/prompt_box.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be462e0307840d4286f1aba3ed313baa62bdebe679ba8012afcdacb2a221ae7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/native_workflows.rs: FileTooLong \u2014 507 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 7 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/engine/src/tools/native_workflows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cebabf11c3984e6cf886676746f6648a8aa7de026586fad2a116fa6c58dfd79"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AiHub: 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), 48 methods, 2 blocks, lines 372-1026. 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/ai/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e92e0bd4a0210d074b88d6e1cccc4624ca1c243d00dd194679400c1d6d3a679"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli_agents/adapters.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/ai/src/cli_agents/adapters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d7b4520fcedcc2e44752f4eef9e743707ac0d9a2fad0d23b7e937a63faae6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (21 shared lines): crates/formats/src/pe.rs:260-302 | crates/formats/src/pe.rs:309-352 \u2014 These two members are variants of one another: 21 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/formats/src/pe.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a358f8e1b290074372c0b6bcfdadae96b36814acb34cf43162e5e8fe323cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/tools/native_function.rs:377-431 | crates/engine/src/tools/native_workflows.rs:441-463 | crates/engine/src/tools/native_workflows.rs:566-576 | crates/engine/src/tools/native_workflows.rs:578-607 \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/engine/src/tools/native_function.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"329d2586568c5b1ac912e32af8a59b0a489f35f1b357e978bd85b3057417e1b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/testkit/src/android.rs:936-947 | crates/testkit/src/android.rs:996-1011 \u2014 both copies are in the same file, so extract the block 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/testkit/src/android.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b220ac402768a202e4c4d5005651329fee55ee291dd78801f95b9e54475ef99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engines/src/gdb.rs:74-85 | crates/js/src/lex.rs:196-207 \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/engines/src/gdb.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec0b4d37b4fa78c8c8ff06629b0e612aca5ccaf73c413d7ae4ffba5973e96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/formats/src/sourcemap.rs:283-294 | crates/js/src/lib.rs:158-169 \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/formats/src/sourcemap.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"33227a07b2bb88d11dbc9008b3a4cd766b2ab3a44feaf5357a274cdbab5d6013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/artifact_tools.rs:310-320 | crates/engines/src/install.rs:414-424 \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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352728f0a0cb680d992d4b04c9d75863b8810468c89869e2481fd2d93377e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/disasm/src/pseudo.rs:143-152 | crates/disasm/src/pseudo.rs:172-181 \u2014 both copies are in the same file, so extract the block 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/disasm/src/pseudo.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63d0175bc2422e9cab3609242b57013b8f7bf40c05a6fb1979df74b2ba6ee2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/formats/src/dex_ops.rs:557-566 | crates/formats/src/java_ops.rs:503-512 \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/formats/src/dex_ops.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7cc79624f258fc18c921c08de2752899dbc62b31f6d8fe06cfb8ce84b98104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/formats/src/dotnet/csharp.rs:762-771 | crates/formats/src/dotnet/csharp.rs:815-824 \u2014 both copies are in the same file, so extract the block 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/formats/src/dotnet/csharp.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5dae086e3969b3a3b4a176d14f0432adf8c17fc89f0a6fb5842fc494324c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/formats/src/pe.rs:287-296 | crates/formats/src/pe.rs:335-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/pe.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac5ec949872e909a9618e0a26927ebccd272dc6b91f09b7241c20e986f4cc60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/craft-anything-cli/src/tool_args.rs:60-68 | crates/ui-egui/src/schema_form.rs:34-42 \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":"apps/craft-anything-cli/src/tool_args.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d649415d67c2e6ad433ae552e99c42a838a400260833fbd5677d78c5893ef8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 3): crates/ai/src/rebuild/locate.rs:74-82 | crates/ai/src/rebuild/question.rs:242-244 | crates/engine/src/outputs.rs:191-199 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ai/src/rebuild/locate.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd40cf3e8cd2da34aa058f411e0aa75697d1b410d02192e13fb2e738978a6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/compare_tools.rs:468-476 | crates/engine/src/tools/compare_tools.rs:769-777 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/compare_tools.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7539cb9d712cfb9c8e93dca822b678a65d7446b7fe321ebfb9a7c5cafa0bd339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/testkit/src/firmware.rs:461-469 | crates/testkit/src/firmware.rs:473-481 \u2014 both copies are in the same file, so extract the block 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/testkit/src/firmware.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8120911972cd01fed3533209463087cb9c1c4a8f0f97be30c323ee28bd34d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/testkit/src/flutter.rs:103-111 | crates/testkit/src/sectionless.rs:103-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/flutter.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdbc17d14a0a30d583c22f1aa84c268565db81c6d76e04ececdb773329984a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/testkit/src/formats.rs:69-77 | crates/testkit/src/formats.rs:109-117 \u2014 both copies are in the same file, so extract the block 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/testkit/src/formats.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d751a24c70b2d58a07b3289b27dd91811c7997bedef9177f3524ff9e52f7a3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/android_tools.rs:1246-1253 | crates/engine/src/tools/packet_tools.rs:402-409 \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/engine/src/tools/android_tools.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d451a768ff6e6c0a11ad03bade8ae7e29a4ded36cf68092f33aa76ccb5bc65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/browser_tools.rs:276-283 | crates/engine/src/tools/electron_runtime_tools.rs:153-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/browser_tools.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6339f2979d563bdf5678d8faca9305a858b9830b061ed93d8a09356f48454149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/gdb_tools.rs:268-275 | crates/engine/src/tools/rizin_session_tools.rs:276-283 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/gdb_tools.rs\u0060 and \u0060crates/engine/src/tools/rizin_session_tools.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 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/engine/src/tools/gdb_tools.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b1f15910600f70bebb775bbc87d8bb42bfb8010984d26f77083c3ffe0e3f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/packet_tools.rs:250-257 | crates/engine/src/tools/packet_tools.rs:600-607 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/packet_tools.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"900019ee05f5fa50b6a936cf48f1c022ec51cada53b4d01f385f9fbeff8ecad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/formats/src/go.rs:762-769 | crates/formats/src/go.rs:799-806 \u2014 both copies are in the same file, so extract the block 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/formats/src/go.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8a28f6bab2f31f7e6164c07b2f33bbe6d0ad5f80c14305e2561cb5557e9e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/platform/src/capture.rs:675-682 | crates/platform/src/process.rs:686-693 \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/platform/src/capture.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e30c9ad56dca797058f28865d3d56cd444ddc294401420a30f83c15b630677a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/disasm/src/dataflow.rs:83-89 | crates/disasm/src/pseudo.rs:1029-1035 \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/disasm/src/dataflow.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfb06bca29c5904a56f05d32cc3c84bca3c2f24a37ce25b9d93296f82df079b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/adb_tools.rs:1023-1029 | crates/engine/src/tools/adb_tools.rs:1077-1083 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/adb_tools.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"609ca9195ae0082d07ce4c90c6f539a82c9c73ebd0456ef2feb07a3d078684a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/android_tools.rs:1084-1090 | crates/engine/src/tools/java_tools.rs:758-764 \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/engine/src/tools/android_tools.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8b9bf234bbaf8d5b899bebc88078cad9424578466bf7f4926b8a0cfcf9bc64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/artifact_tools.rs:600-606 | crates/engine/src/tools/packed_tools.rs:242-249 \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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"f808e4dac466c34819401252f3c565c027241fa1c3d87d8fda64684fa0bacb43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/packed_tools.rs:136-142 | crates/engine/src/tools/sbpf_tools.rs:464-471 \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/engine/src/tools/packed_tools.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2c9cbc4e3a20ef7537c0ecbd2d499d5b1cce0238b0e187896e597105ccd138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/packed_tools.rs:138-144 | crates/engine/src/tools/python_tools.rs:102-108 \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/engine/src/tools/packed_tools.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e367b42b767496aad201499103b1d336345cad883462f4444235e2981f41816e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/web_common.rs:204-210 | crates/engine/src/tools/web_common.rs:246-252 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/web_common.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c67909e28a2114ec838ab2d8bcea8d53866a53ee249e5a1f39dea76f92ef0cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engines/src/gdb.rs:253-259 | crates/engines/src/rizin.rs:128-134 \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/engines/src/gdb.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c63b5225062c523c5ecc8e36789d69d918c88937e4361ae54f6c678a0a765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/formats/src/pcap.rs:649-655 | crates/formats/src/pcap.rs:670-676 \u2014 both copies are in the same file, so extract the block 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/formats/src/pcap.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbe755e789fd16f5ff354ca20fb2d4ec9a1fde1912a68c9701c8b2fa7d9b072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/testkit/src/apple.rs:389-395 | crates/testkit/src/apple.rs:399-405 \u2014 both copies are in the same file, so extract the block 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/testkit/src/apple.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bc7232dab425f91f29603586ff4689ff93bacace8ac01a5b15630d056ae84d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/testkit/src/firmware.rs:514-520 | crates/testkit/src/firmware.rs:528-534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/firmware.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0438c09cefefa7572582f537af6c110fb1c8b836bbf606e74279acd0334d26f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/testkit/src/lib.rs:301-307 | crates/testkit/src/sbpf.rs:91-97 \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/testkit/src/lib.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e7096b5a8535e544c281d777b6575d680c95ea1cc15b22c3cf42c95ed5f0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ui-egui/src/settings_ui.rs:884-890 | crates/ui-egui/src/settings_ui.rs:905-911 \u2014 both copies are in the same file, so extract the block 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"d280145253e9af587a0e2f2d08959d716c35404f2d3a2bd79912ec2e10ee8cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/tools/native_function.rs:512-517 | crates/engine/src/tools/native_function.rs:544-549 | crates/engine/src/tools/native_function.rs:598-603 \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/engine/src/tools/native_function.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3fbd9d27b6254ea9e064e775334c5784b4c25b3c14c35568b4192a549b5138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/testkit/src/formats.rs:157-162 | crates/testkit/src/lib.rs:351-356 | crates/testkit/src/program_facts.rs:281-286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/formats.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df494104b96a340a390bd36342b89f0cff11c794615ea9562c53d9c84e04c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/interaction_tools.rs:238-243 | crates/engine/src/tools/interaction_tools.rs:261-266 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/interaction_tools.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"893c97bd1f09278cf1034c0486873f168a22071b181db80406c4d74d78041d70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/managed_tools.rs:442-447 | crates/engine/src/tools/managed_tools.rs:449-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/engine/src/tools/managed_tools.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f59b64f34f43a89f6b5117d852fb1874cc5dcbf76ea7bd66e565b00a56dd20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/formats/src/asar.rs:215-220 | crates/testkit/src/electron.rs:182-187 \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/formats/src/asar.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cfe3c0c549340d82da1649a647ad9ca7e237a6ff90bd0ffc49d0a38ee91387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/formats/src/evm.rs:619-624 | crates/formats/src/evm.rs:647-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/evm.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1effe48725ec585d288ff2b97e64691db2e7a146672cfa4c4016b3da6258e792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/formats/src/pe.rs:272-277 | crates/formats/src/pe.rs:321-326 \u2014 both copies are in the same file, so extract the block 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/formats/src/pe.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8111f2405bc291838ee4cd48184357da3ba933ede7722d17f91e8d2cc5b4c3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/platform/src/process.rs:250-255 | crates/platform/src/process.rs:945-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/process.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8237de93792b87582374a5434bcc19e6b9e834875da3665d80a172c44873df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/android.rs:923-928 | crates/testkit/src/crypto.rs:236-241 \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/testkit/src/android.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e913788e207ad78f34d7fa426364bd348b39a69d35850df1a759164c9ea829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/apple.rs:249-254 | crates/testkit/src/apple.rs:257-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/apple.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"74519c12a0dc926777edf413c1b558a32337f64bba4ed70f35dff32a9d05e1c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/firmware.rs:445-450 | crates/testkit/src/firmware.rs:585-590 \u2014 both copies are in the same file, so extract the block 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/testkit/src/firmware.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"790d8a56766366ac28ed2b63f8b8f4aa7a0be49edc045f36d71b65c41babf44c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/formats.rs:170-175 | crates/testkit/src/formats.rs:186-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/formats.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c0d5ea87f14eb5a8fac6cb4320ad0820bcc10dde5240d68e03ecabceb79e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/java.rs:207-212 | crates/testkit/src/java.rs:299-304 \u2014 both copies are in the same file, so extract the block 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/testkit/src/java.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2a2d7123bcf3bc4f746f1f521093add8f8a84e8005f1cef0fb71cf1645e171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/java.rs:211-216 | crates/testkit/src/java.rs:236-241 \u2014 both copies are in the same file, so extract the block 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/testkit/src/java.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1267e0adbe8cbb4b1e9519ab88920b91efabb8933940cbd9766ad1afa042627a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ui-egui/src/theme.rs:125-130 | crates/ui-egui/src/theme.rs:157-162 \u2014 both copies are in the same file, so extract the block 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/ui-egui/src/theme.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b11a4979dbaefca14d1237723c277d74231cb079b4a3a84ed3cf7f2792545a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ai/src/rebuild/tools.rs:373-377 | crates/ai/src/rebuild/tools.rs:433-437 \u2014 both copies are in the same file, so extract the block 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/ai/src/rebuild/tools.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"8411453865cd4920708f03dc875c52bf42c6e36c1616abc36c69a14a633d560f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/pins.rs:348-352 | crates/engine/src/workspace.rs:67-71 \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/engine/src/pins.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9626a5070e6c76eaebf98661154895e26ac62912d7006922eba97b37a64825d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/adb_tools.rs:1150-1154 | crates/engine/src/tools/adb_tools.rs:1270-1274 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/adb_tools.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fbb389f017960ebe5ca19a0e46908ba2241d0edb8d43497e79c96e0b1fbdaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/android_tools.rs:711-715 | crates/engine/src/tools/android_tools.rs:1040-1044 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/android_tools.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"93aaa51ee9b6e6a1734d70ede49f903b3b5a7cdb0ee1ab96ffb4139e64c800c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/android_tools.rs:789-793 | crates/engine/src/tools/android_tools.rs:933-937 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/android_tools.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9598a21664157df29293e7562e2526978f19b7e7dcbb94fae4544b0542131df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/android_tools/jeb.rs:166-170 | crates/engines/src/cdp.rs:285-289 \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/engine/src/tools/android_tools/jeb.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0ae47cc6d47bc7ea0255c90adbb7d20861e59eb539e9c38fa77afbd700dec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/game_archive_tools.rs:857-861 | crates/engine/src/tools/game_archive_tools.rs:1289-1293 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7dc68a0009a102735789d05f1a18175173f0cdf58424ba25497ccd63e5819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/gdb_tools.rs:277-281 | crates/engine/src/tools/rizin_session_tools.rs:285-289 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/gdb_tools.rs\u0060 and \u0060crates/engine/src/tools/rizin_session_tools.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 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/engine/src/tools/gdb_tools.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"da51c9ff8fac4db97ed77a13ed6ab9d97019c84b06111049ca56ca0e24dc5b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/native_formats.rs:232-236 | crates/engine/src/tools/static_input.rs:50-54 \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/engine/src/tools/native_formats.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc79b841b2c76561f9952fffd3c0dbfc0b7ed1b155fa5f89ef40b88cbedce7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): crates/engine/src/tools/native_function.rs:414-417 | crates/engine/src/tools/native_workflows.rs:443-447 | crates/engine/src/tools/native_workflows.rs:568-572 | crates/engine/src/tools/native_workflows.rs:590-593 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/native_function.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"083536af9693ce6ec8f1ef3ac7ccf10fb3e7412283cb59f1ebd40110d9371486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/sbpf_tools.rs:332-336 | crates/engine/src/tools/sbpf_tools.rs:443-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/sbpf_tools.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2b3a32a4ae017c91dd144ca1b199bbec93a9738d923e07aab9ab31f1aa0c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engines/src/adb.rs:154-158 | crates/engines/src/frida.rs:263-267 \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/engines/src/adb.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9891da4be957f3172a4c2c735c97935a2f5f6350d0fa3c6b73fc823e746b93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engines/src/frida.rs:289-293 | crates/engines/src/frida.rs:322-326 \u2014 both copies are in the same file, so extract the block 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/engines/src/frida.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcea278c9cbd75f2b07cdf0e634932e1315f8c6ddb0f1fdb5dfdf11bbc58377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/formats/src/decompress.rs:81-85 | crates/formats/src/decompress.rs:93-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/decompress.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1606f30a5b64f87f7fa57e362ab1850543a762993a1883061eb33ebac61d5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/formats/src/pe.rs:265-269 | crates/formats/src/pe.rs:314-318 \u2014 both copies are in the same file, so extract the block 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/formats/src/pe.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6673999b4aa6a3b49af423564525d085c3dc8a6a0ff1eb868db6e00ad48868e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/formats/src/unity_serialized.rs:103-107 | crates/formats/src/unreal_pak.rs:120-124 \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/formats/src/unity_serialized.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7732905b3207ac1ded4ea9fc9e465a701b12b340eb98a9d5a4a45cd2d580b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/lib.rs:338-342 | crates/testkit/src/sbpf.rs:160-164 \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/testkit/src/lib.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"270d2d3c49c9f6e5ccaf27e3c863dad455a9be7d65849f8711d90feb98bd80ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/lib.rs:628-632 | crates/testkit/src/lib.rs:855-859 \u2014 both copies are in the same file, so extract the block 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/testkit/src/lib.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782b71b07ea4217275ea0ef8c1d5f8946dd48c76d2d3f520bd9ace0f41307b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ui-egui/src/settings_ui.rs:864-868 | crates/ui-egui/src/settings_ui.rs:891-895 \u2014 both copies are in the same file, so extract the block 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/ui-egui/src/settings_ui.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce99bd25fb6cb6045fb4103eb7fedd28a6eeae4a2ffd80cee7ac38312651a4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ui-egui/src/theme.rs:115-119 | crates/ui-egui/src/theme.rs:147-151 \u2014 both copies are in the same file, so extract the block 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/ui-egui/src/theme.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"37162530a2ccfd22b1cac8ef9dfe50ed778bafc97a5c276780d4a10638dcb9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ai/src/rebuild/tools.rs:250-255 | crates/engine/src/tools/pin_tools.rs:156-161 \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/ai/src/rebuild/tools.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92368520a140ce0f40771657474c01150a447ed77f794f209793402474afde6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/android_tools.rs:349-353 | crates/engine/src/tools/java_tools.rs:322-326 \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/engine/src/tools/android_tools.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7fd2b6fa37c8eeeeb2026cbcac0d420b66ad7be4d966524f2e60f6203859de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/tools/browser_tools.rs:166-171 | crates/engine/src/tools/electron_runtime_tools.rs:93-98 | crates/engine/src/tools/web_runtime_tools.rs:438-443 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/browser_tools.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a211560d4063f57a2489b2195bf7c910afe3105f94b90791d689c8d7a7c2f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/gdb_tools.rs:159-165 | crates/engine/src/tools/rizin_session_tools.rs:176-182 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/gdb_tools.rs\u0060 and \u0060crates/engine/src/tools/rizin_session_tools.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 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/engine/src/tools/gdb_tools.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5dc68a7c92834446ae326a071bbc4a1f14d305c04a1b7c52f37fa802d30ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/testkit/src/android.rs:421-428 | crates/testkit/src/firmware.rs:19-26 \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/testkit/src/android.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e91e67f2fe394b0f45ee68a1bedaa052f7e215ef0af23193c1e37c6d77bf4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/android.rs:905-909 | crates/testkit/src/crypto.rs:209-213 \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/testkit/src/android.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef75235b11f99de6a9e1d70bd35a9944863795def2de4df48394fa30c5c46caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/testkit/src/electron.rs:196-205 | crates/testkit/src/firmware.rs:8-17 \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/testkit/src/electron.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b60ec3bcb4f81fe7d6b564d0f43c2c02eb68a52f93440b084d4f425a59184dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/gdb_tools.rs:226-237 | crates/engine/src/tools/rizin_session_tools.rs:233-243 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/gdb_tools.rs\u0060 and \u0060crates/engine/src/tools/rizin_session_tools.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 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/engine/src/tools/gdb_tools.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89386702819681701ce29ba737f16dacac8b7495f682c43dc4b269dfe4dc4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/java.rs:266-276 | crates/testkit/src/java.rs:323-327 \u2014 both copies are in the same file, so extract the block 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/testkit/src/java.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6750816cf52233d1a43bd4310388365cc1f67e227600f991b6321e570589dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/formats.rs:150-154 | crates/testkit/src/sbpf.rs:99-106 \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/testkit/src/formats.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56f3b9e2e738a99713db74b542625a72e57761397cdae52bf62de385366547d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ai/src/agent.rs:447-454 | crates/ai/src/agent.rs:485-492 \u2014 both copies are in the same file, so extract the block 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/ai/src/agent.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b75e2a010804e57c73742ceffd40daa12f1625c631472d06933e30f702ba180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/testkit/src/firmware.rs:265-272 | crates/testkit/src/firmware.rs:274-281 \u2014 both copies are in the same file, so extract the block 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/testkit/src/firmware.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"213dbfae7865cb47f27c0c1a66615dce3d0f93c4d3f7aa81f2af4d072bb268ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): crates/engine/src/tools/adb_tools.rs:591-592 | crates/engines/src/adb.rs:160-166 | crates/engines/src/frida.rs:269-275 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/adb_tools.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca9e97bf8b36d14e34ee5752d2f4a873bea6779434a5396be2cf6c309c1dac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/formats/src/swift_demangle.rs:895-901 | crates/formats/src/swift_demangle.rs:918-924 \u2014 both copies are in the same file, so extract the block 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/formats/src/swift_demangle.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b404e607ce6060e7c6c74a66473b7c2fa85f64c24d4b5ec7e23d729b3a2c4f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/adb_tools.rs:642-648 | crates/engine/src/tools/android_tools.rs:1229-1235 \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/engine/src/tools/adb_tools.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb91fd45702d681c8686100fdc69def370e42ecdcbc52104cc45d750b5689496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/browser_tools.rs:953-958 | crates/engine/src/tools/browser_tools.rs:1244-1248 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7cd51a88f88ab3000ed80c7e2eab6ac54f6a738e07f9d01dca75d18f68c032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/formats/src/java_ops.rs:464-469 | crates/formats/src/java_ops.rs:489-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/java_ops.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7087ee1661f06e2d8983536e7bf2ea729c563e916482254fbed2ba07e3e74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/craft-anything-cli/src/ai_cmd.rs:355-360 | apps/craft-anything-cli/src/ai_cmd.rs:362-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1a58cd28fe436892cc214b3b18dbc0c092d98f2677e16f0adaa4b73be326a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/web_common.rs:192-197 | crates/engine/src/tools/web_common.rs:235-239 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/web_common.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6a90258dc6b2811a60e9800f1856130cd1baa69a4c793805116b300de4652c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/craft-anything-cli/src/output.rs:100-105 | apps/craft-anything-cli/src/output.rs:127-132 \u2014 both copies are in the same file, so extract the block 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":"apps/craft-anything-cli/src/output.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7349cc596050895ae71a57491ae2db8c27abb102f0f17d818300d543d82a306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/formats/src/plist.rs:323-328 | crates/formats/src/plist.rs:337-342 \u2014 both copies are in the same file, so extract the block 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/formats/src/plist.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c2b53f63d72d54c7bfa8ff108ba8af1912cc0e097d5d053be814ae15781d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/testkit/src/apple.rs:774-779 | crates/testkit/src/apple.rs:784-789 \u2014 both copies are in the same file, so extract the block 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/testkit/src/apple.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c0ccf345106b7d2388ab1869edec7ef4984e58d96acc0f8ee547122dc5fa7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/browser_tools.rs:2223-2227 | crates/engine/src/tools/electron_runtime_tools.rs:313-317 \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/engine/src/tools/browser_tools.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d441330eb81710d776571b8b096bd2661ebb4e2270a68096b9601e46a3e91817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/engine/src/tools/browser_tools.rs:954-958 | crates/engine/src/tools/browser_tools.rs:1183-1187 | crates/engine/src/tools/browser_tools.rs:1244-1248 \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/engine/src/tools/browser_tools.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cd9ecd88f48699af3f908fd7b8ad782fdc6e8b4dc545e439ef91caed5c0670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/analysis/src/js_projection.rs:117-121 | crates/analysis/src/js_projection.rs:261-265 \u2014 both copies are in the same file, so extract the block 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/analysis/src/js_projection.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba97cd1fef2c8770f7bfc547824d5bacd498f3d7b4fac17bee996ed019817d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ui-egui/src/manage.rs:111-115 | crates/ui-egui/src/pins.rs:315-319 \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/ui-egui/src/manage.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f067abdd5279448e23d5a3b8b9dc28063ba80737a963200dfdc938ab19f6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/native_workflows.rs:483-487 | crates/engine/src/tools/native_workflows.rs:521-525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/native_workflows.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f422eb3da74ee1510aa844952784ace5d1b0688aa92c5506928b00781ac32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/web_runtime_tools.rs:144-148 | crates/engine/src/tools/web_runtime_tools.rs:264-268 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/web_runtime_tools.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60d510c0aa014adb79fe15134abb4980ae83a0aedc1a0b000e0c14bc361a7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/gdb_tools.rs:216-220 | crates/engine/src/tools/rizin_session_tools.rs:223-227 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/gdb_tools.rs\u0060 and \u0060crates/engine/src/tools/rizin_session_tools.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 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/engine/src/tools/gdb_tools.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b51e0e0b773b9941edc1e49f5c9059e8417f1e42ff068712c3f67c9ecd45139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ui-egui/src/make.rs:110-114 | crates/ui-egui/src/make.rs:168-172 \u2014 both copies are in the same file, so extract the block 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/ui-egui/src/make.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61126482ea9d29e209326c46a4d4994e19d80150f1826252c27c5050ff71d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/android_tools/jeb.rs:626-630 | crates/engine/src/tools/android_tools/jeb.rs:651-655 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/android_tools/jeb.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42b2c88e6c53e4a1a8391c2ce4dfb62c9b6388ea12d27c4f86d29c088a4289f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engines/src/gdb.rs:369-373 | crates/engines/src/rizin.rs:289-293 \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/engines/src/gdb.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d17a63551f12a98e5b9f44ab3ce5f8d1df9f19970410993d3d00b66afc2a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/game_archive_tools.rs:316-320 | crates/engine/src/tools/game_archive_tools.rs:689-693 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4bde6491bcd2e6d0ddbd076691f6299b85111f8f0c55c06ec4a5fcbe16225c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/game_archive_tools.rs:415-419 | crates/engine/src/tools/game_archive_tools.rs:523-527 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"498f963a031c91f169dfc55ab83e70d7474ebf7a37ed4af78a284b666e38e3e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/disasm/src/dataflow.rs:60-65 | crates/disasm/src/pseudo.rs:1014-1019 \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/disasm/src/dataflow.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb25e13e56733dad7381ea7d61fd3fd6a66daa134b9ef1a6f8a42dd8d1ca7fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/journal.rs:30-35 | crates/formats/src/pcap.rs:1450-1455 \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/engine/src/journal.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5ab68ec601417076c648f51761caadd845503128ce9300f36ef90c140b158f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/application_tools.rs:230-234 | crates/engine/src/tools/application_tools.rs:282-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/application_tools.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca604815f2683541ba30d8c73004b65e01fd8a95599013b68dcc9ac935a9c12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/browser_tools.rs:1666-1670 | crates/engine/src/tools/browser_tools.rs:2402-2406 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/browser_tools.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f18c2d9b7cbcb4abbad272aec1ff00862126e636fb8145c7b6959096fc80ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/engine/src/tools/game_archive_tools.rs:277-281 | crates/engine/src/tools/game_archive_tools.rs:368-372 | crates/engine/src/tools/game_archive_tools.rs:664-668 \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/engine/src/tools/game_archive_tools.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a1c15252dcbd0951bcda61df8fe9cfa2afec6898cc62b11ed2caab587e139d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/gdb_tools.rs:289-294 | crates/engine/src/tools/rizin_session_tools.rs:297-302 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/gdb_tools.rs\u0060 and \u0060crates/engine/src/tools/rizin_session_tools.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 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/engine/src/tools/gdb_tools.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"881a8998442fc5f19d23f702ddd79868fbb776142a33b6449acdc69a142c4a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/report_tools.rs:273-277 | crates/engine/src/tools/report_tools.rs:509-513 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/report_tools.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ece7b78bf68d62d24df834ab3a27a089438e8ab99490b94992e0b67df4e02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/formats/src/pcap.rs:1100-1105 | crates/formats/src/pcap.rs:1128-1133 \u2014 both copies are in the same file, so extract the block 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/formats/src/pcap.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f2e3993d300ecc8a8082728a87e94ad140bf32223dfc0bc6f99762fe1065ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/formats.rs:83-87 | crates/testkit/src/formats.rs:121-125 \u2014 both copies are in the same file, so extract the block 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/testkit/src/formats.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"89953098ef4987b867d3a2a485ad6b3b5871d62c4058606b22f9555d85bfc404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/games.rs:86-90 | crates/testkit/src/games.rs:98-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/testkit/src/games.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee92efcbc167193384f0a4dbba4d813b3a550dbd7ec7877a41140a89e8353909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/testkit/src/packed.rs:87-91 | crates/testkit/src/packed.rs:106-110 \u2014 both copies are in the same file, so extract the block 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/testkit/src/packed.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f1e5498c89156eecb8b0b572f92e7d4d45dd1ac0a7de43a635c4f57a952d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ui-egui/src/builders.rs:379-383 | crates/ui-egui/src/engine_ui.rs:487-491 \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/ui-egui/src/builders.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d442d56715c2a41cef0104aa08eab6471661a76589928bd9fabbb7dc289f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): xtask/src/locks.rs:199-203 | xtask/src/main.rs:239-243 \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":"xtask/src/locks.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f402afe815586ca02ecf212dc0c97627909ea93c2000e79ed17d91d2fa10bfbe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: craft-anything-evidence: craft-anything-evidence: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"47288aec260a303733a9ddfe2d22087c412458aba057a977524af56203aecfde"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: craft-anything-js: craft-anything-js: 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":"8a9fc1bf36c2d9b357307801f3737d7a98b086a5d183d5f78ea68c7f80813815"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: craft-anything-formats: craft-anything-formats: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b1d923fc324e4a9adf19437a6e5f05d60bba030c180759f93f90ee5bea92e1ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: craft-anything-platform: craft-anything-platform: abstractness 0.02, instability 0.11, distance 0.87 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"111298859ef819b171a88dabb3040cea0290d53ee74e64f120ce161a615da3cf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: D (LCOM4 46): D\u0027s methods fall into 46 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 46 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/formats/src/swift_demangle.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"effb26cd8aa35154bfce92263361f2219d78ff2fd0e0a42af27c5fc71b8b3c0e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Device (LCOM4 9): Device\u0027s methods fall into 9 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 9 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":"vendor/wgpu-hal/src/dx12/mod.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4715dfc9bdf79e00622e19695b6acf5150973f4040ce27bc10a01524a6268a4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Settings (LCOM4 5): Settings\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/engine/src/settings.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20ed9f1c39914fdbdc2d5e3db71321e44f5c946bbeb365991a192d8d3e3eab6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExternalEngine (LCOM4 4): ExternalEngine\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/engines/src/table.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7403c32e809dfae52b73b4bc69f157ac20d500dba96f4725e25e9379435a229b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/lib.rs: crates/ui-egui/src/lib.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in CraftApp::handle_done at line 1384. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/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/ui-egui/src/lib.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ec3686b8af85f7a34727b6716735c24b1c4b7453e7b9ed0af36d8b692fce04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/rebuild/mod.rs: crates/ai/src/rebuild/mod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in Worker::run 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/rebuild/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/ai/src/rebuild/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eac142de9eec8b5c87e5b16677f625a02e363708f64be5e8fac4859514b3d6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/settings_ui.rs: crates/ui-egui/src/settings_ui.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in craft_anything_ui_egui::settings_ui::ai at line 320. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/settings_ui.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/ui-egui/src/settings_ui.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"65515a588bf92ccb64f8d2a56fbb16b1e5094dbd14f3991aafeddfdf4ece435f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/cli_agents/mod.rs: crates/ai/src/cli_agents/mod.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in craft_anything_ai::cli_agents::run_cli at line 747. 1 of those changes was a fix/bug commit, and the other 30 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/cli_agents/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/ai/src/cli_agents/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd514e23c7a1759e3cd9ffe9a0ff8b113bd226c67a210fb795b69bb9a2faa3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/project.rs: crates/ui-egui/src/project.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in craft_anything_ui_egui::project::composer at line 1735. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/project.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/ui-egui/src/project.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b1f331519f37c46507fa1e609d804947324d291879629131a11fd3f3c725d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/cli_agents/adapters.rs: crates/ai/src/cli_agents/adapters.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ClaudeCode::parse at line 409. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/cli_agents/adapters.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/ai/src/cli_agents/adapters.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbda0149dada79477f5005d8f5904542cb36bd2bf4fbee12bf1830c017bec75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/craft-anything-cli/src/ai_cmd.rs: apps/craft-anything-cli/src/ai_cmd.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in craft_anything_cli::ai_cmd::ai at line 204. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- apps/craft-anything-cli/src/ai_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":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ce7f668efb8da2499608ff663b97800c0c179cb8aa419ee73b35690c8e542e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/pcap.rs: crates/formats/src/pcap.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Capture::next_ng at line 236. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/pcap.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/formats/src/pcap.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f0040ee9a0b4b53877b80fafba617663922c5113bcea816066656147cff01d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/platform/src/capture.rs: crates/platform/src/capture.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in craft_anything_platform::capture::unix::capture at line 846. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/platform/src/capture.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/platform/src/capture.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1adb019219bdaae5f7e16354673db2ebea531cf295193c3fe2d9e9ff462363"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/disasm/src/decode.rs: crates/disasm/src/decode.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in craft_anything_disasm::decode::decode_a32 at line 841. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/disasm/src/decode.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/disasm/src/decode.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad273e25762f224b919a60dcd7ca1cc1b1c1961d157948a899963f7ee3f0e39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/openai.rs: crates/ai/src/openai.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ChatStream::apply at line 326. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/openai.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/ai/src/openai.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"82df7b2a84adfb4face569c3f880519a7b17aa5d0899a5765d14ca18c2986052"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/chat.rs: crates/ui-egui/src/chat.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in craft_anything_ui_egui::chat::item_ui at line 432. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/chat.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/ui-egui/src/chat.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e571080404da677680824c1f5276c4af8fd6b4f21450396d966c66e0b14282d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/artifact_tools.rs: crates/engine/src/tools/artifact_tools.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in craft_anything_engine::tools::artifact_tools::core_archive_extract at line 634. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/artifact_tools.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/engine/src/tools/artifact_tools.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"67158020fda96dd7f0a64c9f921f2da7478f17129801958e22ae173a14992c90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/rebuild/feed.rs: crates/ai/src/rebuild/feed.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in craft_anything_ai::rebuild::feed::apply at line 10. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/rebuild/feed.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/ai/src/rebuild/feed.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"69251387734af53b898403792a9113d3caf8ccfc26d1d406e9fd0db95b313d2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/disasm/src/program.rs: crates/disasm/src/program.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in craft_anything_disasm::program::scan_function at line 788. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/disasm/src/program.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/disasm/src/program.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"556d5ba4809724832eed78889e3e8280881786335e5eba6852c6b28cbb3bd430"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/zip.rs: crates/formats/src/zip.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in craft_anything_formats::zip::parse at line 96. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/zip.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/formats/src/zip.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c09397e0774465481b6bdcc27ba93592f481a55e202cc44620e8f071542cd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/agent.rs: crates/ai/src/agent.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AgentLoop::handle_turn at line 349. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/agent.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/ai/src/agent.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ea562bc8aaa8dc6274f472513145c1915931a07d7f7f3f505d22af673e4696"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/builders.rs: crates/ui-egui/src/builders.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in craft_anything_ui_egui::builders::agent_model_picker at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/builders.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/ui-egui/src/builders.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b10738456cf44f01b71d7a44c5783671d8ff9bbc2f3951c9ea72c13ef339d33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/dotnet/csharp.rs: crates/formats/src/dotnet/csharp.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Scanner::run at line 693. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/dotnet/csharp.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/formats/src/dotnet/csharp.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e032ebbf41e3d38955b99abbbc218eb05f07e5410c787d534c2213481210d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/craft-anything-cli/src/rebuild_cmd.rs: apps/craft-anything-cli/src/rebuild_cmd.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in craft_anything_cli::rebuild_cmd::run at line 96. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- apps/craft-anything-cli/src/rebuild_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":"apps/craft-anything-cli/src/rebuild_cmd.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc851205dc607c254db99a6fb12253e572554550564c710f9a94583d5d688e92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/analysis/src/standin.rs: crates/analysis/src/standin.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in craft_anything_analysis::standin::build at line 774. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/analysis/src/standin.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/analysis/src/standin.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c4c73b791877dd37576eb11f2b87f316a4ec4f668eaca73a00c30a24ae68c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/make.rs: crates/ui-egui/src/make.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in craft_anything_ui_egui::make::hero at line 81. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/make.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/ui-egui/src/make.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"835c999f19acd6925beb4bf5e6cb43d8568764a0eee77cbd49cd46ab1749b067"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/prompt_box.rs: crates/ui-egui/src/prompt_box.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in craft_anything_ui_egui::prompt_box::show 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/prompt_box.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/ui-egui/src/prompt_box.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7910c27931415f9f14997ccdef9cd130aba721f74db028c407baf6360292526f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/setup/src/doctor.rs: crates/setup/src/doctor.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in craft_anything_setup::doctor::doctor at line 68. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/setup/src/doctor.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/setup/src/doctor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f8a73f6383a1621e7af56d7b3cb872ddd31c5cf95825e249e8b69ad20a4a89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/disasm/src/dataflow.rs: crates/disasm/src/dataflow.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in craft_anything_disasm::dataflow::def_use at line 57. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/disasm/src/dataflow.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/disasm/src/dataflow.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed5f3682af448b16f0f664873e309fbf6a26107ef5304a1200f8b07ff848698"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/titlebar.rs: crates/ui-egui/src/titlebar.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in craft_anything_ui_egui::titlebar::show at line 130. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/titlebar.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/ui-egui/src/titlebar.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e21c6c185a48171589673ec51bde1be26d93f437ea6954d15942d3b25c4f4a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ai/src/rebuild/check.rs: crates/ai/src/rebuild/check.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in craft_anything_ai::rebuild::check::build_check at line 106. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ai/src/rebuild/check.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/ai/src/rebuild/check.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c799fc3532f158aaee260b96fbcc5f5a58af6e57c77ab826b8583f66a6383"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ui-egui/src/palette.rs: crates/ui-egui/src/palette.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in craft_anything_ui_egui::palette::show 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/ui-egui/src/palette.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/ui-egui/src/palette.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a27e33ecbc20d579375e83b09daa08344fcadee78b1ff13adf97ae18eba2317"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/binary.rs: crates/formats/src/binary.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in craft_anything_formats::binary::parse_object at line 510. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/binary.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/formats/src/binary.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacef6a6fd3e51be194c0db9fdc271a57137d915e85c53b7c78a704fd7a0a512"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/sqlite.rs: crates/formats/src/sqlite.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in craft_anything_formats::sqlite::decode_serial at line 719. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/sqlite.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/formats/src/sqlite.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"64124917a131dce9b7b5d5f934cf82f287ebe3df892152e7df589837ac520719"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/main.rs: xtask/src/main.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in xtask::main at line 35. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- xtask/src/main.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":"xtask/src/main.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff25c237cc89f8deb8f42b76ea49283325d779974670e147cb5786c2447a564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/settings.rs: crates/engine/src/settings.rs changed 4 times in last 90 days, max cyclomatic complexity 18 in ToolPaths::override_for at line 57. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/engine/src/settings.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/engine/src/settings.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241078276892642711df9c8dadbbdb159e8c3ee5a6f4daadfde315a75d8c960"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/tarcpio.rs: crates/formats/src/tarcpio.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in craft_anything_formats::tarcpio::cpio_with_checksum at line 290. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/tarcpio.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/formats/src/tarcpio.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0458c8b4888d0b3f9dc7dd0f0d201a67cc842e8e876b6136b0e81ed030c05958"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/js/src/html.rs: crates/js/src/html.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in craft_anything_js::html::scan_html at line 140. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/js/src/html.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/js/src/html.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9867a3750d8e1af3fd7513de1fa96f57f84ffe1a5016d1b58307e2af3e666050"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/formats/src/axml.rs: crates/formats/src/axml.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in StringPool::parse_with_recovery_budget at line 66. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 00:59:53 \u002B08:00\u0027 --until=\u00272026-11-07 00:59:53 \u002B08:00\u0027 --full-history --no-merges -- crates/formats/src/axml.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/formats/src/axml.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa36ea56eee9b7ebd6a5ed9acccbf58eaf25c4a1c28e9b31b2a0c8b9b08a90dc"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 18 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is \u0060crates/engine\u0060 (53114 LoC, 499 module-visible types across 6 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":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52c44b78bb75864f5952d19f7ea0b636885d7a511f252017e7b5409397e95d4d"},"properties":{"commitSha":"f64ae3bf3c8863a982af1304e06de20653803968"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"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":"32029cfd755703bf7ae1b0501a731fdefcb86097bdb372e2452dce09914d8489"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7b4c43cffd4a9d41ec1d923c4693495da579f972451d6544244462562e58022"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db09c9bf7bb49fc58045b6f2df4b9569380b5acddd44b51aa94286127940aece"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0f8524cb88b8ecebe1baaeaecf466d52056f7516482bb09c5e09b1bef14fb54"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab37af43cd215843f6a4196880225a1681d972daa655f4a9d00c86e0578b8e2c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cbd3a4287905dfae3bec9ca4b9dda0ed0d2fd00edf01f4f5c3b773a2b840599"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32a3436ac85d56d2ea2d6ec362cd6124be8226987e35cf4e26b2343a2358f32a"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4d4d5dc82c9a24221836e5499a615470300bb7eb08ff62696226d6672b77554"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c959f0712c7c3c93b5a21d0736bad50a09e58f76130d58acd18f4ee182f53a1d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6c741fcd3fe5e9366154cdc04436de7fe52304895a11719a3ba2b3ed028cd61"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"0378320e7af56d3d8c5ff967411af0d7f1bebe67185b8d39b40ebb7f0dbadbc5"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"9f27588e3d70bc99cf21c7877df2bd7396fe3a81e21c7583114aafcfe6791ca8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"6e3c4c4023edd678ce5b49f9c1bc28986f69fafc8dba9557553b534029987b2d"},"properties":{"dependency":{"package":"zvariant","version":"4.2.0","advisory":"RUSTSEC-2026-0370","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":"418f2313fe19513275f486540b5dfc35f86fbe86cb2934388be3cfcf2b7ba98a"},"properties":{"dependency":{"package":"zvariant","version":"5.15.0","advisory":"RUSTSEC-2026-0370","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":"97130daeb1518b58bc1060d49786022ed2647ef388424ccf314633d37c5d05a6"},"properties":{"dependency":{"package":"zbus_names","version":"3.0.0","advisory":"RUSTSEC-2026-0371","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":"088b72c397cd79c1755a77f5c7d3c056b9324996e72474f55e97eca38c7e8a4b"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","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":"5ecd047d6511b3eab152460e8d2317ce773a32a894f6954fd5f8e9e99a959434"},"properties":{"dependency":{"package":"zvariant_derive","version":"4.2.0","advisory":"RUSTSEC-2026-0372","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":"dc5d25db4713224cda55ddad41f912c5219580e6113901e291d896e566454f07"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.0","advisory":"RUSTSEC-2026-0372","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.2","advisory":"RUSTSEC-2026-0386","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":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","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":"7add5f9c1bcccaa168433f9d0f7b9ea60d488c38df23f35c4452125a6c35ab47"},"properties":{"dependency":{"package":"wasmtime","version":"49.0.4","advisory":"RUSTSEC-2026-0422","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0423","RUSTSEC-2026-0424"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-web/index.html"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd90aa9c3443e2b67e9d7a409fe368d7afa8b03fe1e3c5e18130dc97fbb3894"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"about.hbs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb4fab554bc89812013aff862952fececd67c55a7601d9a5ed81bae3f28a4ae"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-web/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3573b27bd6c2dc6708854f7cfc506bcc0c4309a2c82500893642db5f5cee0913"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/craft-anything-web/index.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2effb797a81ff48b75c480d6b50521bfd65a0e02a9b4b23b6bd6ae4969d31922"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"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 10/12 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engines/src/cdp.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2909a03700a1fe08600710ac57d2c41d327b08d66da106d4ab4b6c7f9df76757"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/verify.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"094c166c97d4238d9cb9a8fe4a1c8d85be9770af1b3c86cd75eb5679d37f84e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(widgets::primary_icon(ui, None, \u0022Rename\u0022, ok).clicked() || enter) \u0026\u0026 ok\u0060 appears character-identically in 2 files \u2014 crates/ui-egui/src/manage.rs, crates/ui-egui/src/pins.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/ui-egui/src/manage.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"970c2227c490830cb7da8f1ced58cd85fa3d15a075e6ebbf7ddcaa192f5b5839"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Instant::now() \u003E= deadline || cancelled()\u0060 appears character-identically in 2 files \u2014 crates/engines/src/gdb.rs, crates/engines/src/rizin.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/engines/src/gdb.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b264c0f3b03a1f71bd529371dc1f4083c833f5e4c9072f73f2c9e79e7da64b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060d.needs_key || d.suggestion.base_url.as_deref().is_some_and(craft_anything_ai::openai::is_opencode_go)\u0060 appears character-identically in 2 files \u2014 crates/ui-egui/src/first_run.rs, crates/ui-egui/src/settings_ui.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/ui-egui/src/first_run.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28e2d7e15e46e3952c871870bc02da77a4d12e443ddfdd703bd8d137fccfc8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.message.contains(\u0022newer\u0022) \u0026\u0026 err.remediation.is_some()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/settings.rs, crates/engine/src/workspace.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/engine/src/settings.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"82396166310cf82a4046a25a99bc97adad4c387e1124f7d4e2b4c93e52bdb740"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fix.contains(\u0022copilot login\u0022) \u0026\u0026 fix.contains(\u0022restart Craft Anything\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ai/src/cli_agents/acp.rs, crates/ai/src/cli_agents/adapters/copilot.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/ai/src/cli_agents/acp.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea29e9aa914375ea76617b41587c46558d109dc94bc05a642bf3922bce4290c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.cli_model.is_none() \u0026\u0026 options.cli_thinking.is_none()\u0060 appears character-identically in 2 files \u2014 crates/ai/src/cli_agents/adapters/copilot.rs, crates/ai/src/cli_agents/adapters/opencode.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/ai/src/cli_agents/adapters/copilot.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ae1674807231f9983f1becd292f059ac6a60edaaeab99aafb061343398de81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool == \u0022TodoWrite\u0022 || tool == \u0022build_checklist\u0022\u0060 appears character-identically in 2 files \u2014 crates/ai/src/rebuild/activity.rs, crates/ai/src/rebuild/feed.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/ai/src/rebuild/activity.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fa47e4d4e517e9a71875378474aeef95438e2052a23da5ff1cfbdcf0a1aa6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x.kind == XrefKind::Jump \u0026\u0026 f.contains(x.to)\u0060 appears character-identically in 2 files \u2014 crates/analysis/src/native.rs, crates/engine/src/tools/native_function.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/analysis/src/native.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be66cac4d5006e5921f9acfc5fab5eec9c666722c9904e6589b6833f8346c83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engines/src/ghidra/CraftAnythingBridge.java"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb54c574106f5fa5bd38cd17b94c6ad1bae683c5670a0a5ce6180e5112754b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engines/src/ghidra/CraftAnythingBridge.java"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a575b67491f7106b5f085cb49ed3fc8c97640f9fa66b201dbb388609f15849"}},{"ruleId":"X5","level":"note","message":{"text":"Java packages are not null-marked everywhere: 0/1 of this repository\u0027s Java package directories are under a non-null default: a \u0060package-info.java\u0060 declaring \u0060@NullMarked\u0060 (JSpecify) or \u0060@NonNullApi\u0060, \u0060@ParametersAreNonnullByDefault\u0060, \u0060@NonNullByDefault\u0060, \u0060@DefaultQualifier(NonNull.class)\u0060; a \u0060module-info.java\u0060 declaring \u0060@NullMarked\u0060; every type in it \u0060@NullMarked\u0060; or a build that runs NullAway with the package in \u0060AnnotatedPackages\u0060, or the Checker Framework\u0027s \u0060NullnessChecker\u0060. Elsewhere every reference admits null and no checker warns on the dereference that throws a \u0060NullPointerException\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"419201f6fc7ba243aef2cfb154378641588a8190e6269cea04a7b48c3d343bd5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060doctor_checks\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":"apps/craft-anything-cli/src/ai_cmd.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f08fee0d826992d2719c2591843ac17c02fdab86ef565a857baa9c12585f70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060line\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/ai/src/cli_agents/acp.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"475c39abae1d93b97e4fb80b2369af0977c0819849036c3d0056abe6bc0b94e5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060toml_string\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022\\\u0022\u0022.into()\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/ai/src/cli_agents/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a61918766707a183fa17434e0fa849d659c0d327e73643a9a7f0c077d476a84"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060opencode_servers\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/ai/src/detect.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"177ab846909b05c7856cceaa7e165aa47b86058541b78bd27988702fac6862e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060claim\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/ai/src/rebuild/notes.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e69b5a93d7ea1d4e93fc7956a59a9aefba32e25c8f6cf8eb1dd8ad419e75ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pending\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/engine/src/inbox.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3d1e22f43d21fe49656d78a5de364ce2a063b04a333bc7c2fb41b038c1eff7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060tail\u0060 turns every \u0060Err\u0060 into \u0060String::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/engine/src/pins.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ffe90f7305a0a749b333bdacbf5f3ffd81976116ba95fd8581077554e7cfe7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060candidates\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/engine/src/tools/electron_fuse_tools.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb659098a99df95b63398a1e9fe4b6a7f871744df596991a17ef884ee0b71cd3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060unreal_registry_roots\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/engines/src/game.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"828568215efe7d44c408a82264d6cbd6b911301130bdc2c8e802777f920616f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pe_resources\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/formats/src/packed_carrier.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe9c4520619a60ec02c999d35d04438881802fcc1641d4dbd165c1cf9cc6e81"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060display_cards_in\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/platform/src/display.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8046a0c04abe004f33a24a56afa45e57be7b6d9f03097e77561a514d302c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060newest_versions\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/platform/src/which.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e69c2e32874126fa4236164cb39e01b59f42634ae479a1ff063bd8a0aaf4e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scalar\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022\\\u0022\u0022.into()\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/setup/src/yaml.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62f21d452a64ccdc9aa8b9da575763c1d05ff51322fb0abb9ff5376a79106ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060unity_texture2d\u0060 turns every \u0060Err\u0060 into \u00600\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/testkit/src/games.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b52bdfb45cf1ffa6f23225ef9d9caa7b1198a68935c33078750e9306a25eff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060language\u0060 turns every \u0060Err\u0060 into \u0060\u0022en\u0022.into()\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/ui-egui/src/i18n.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"024f35fd5f8e9eec058fb6d6366b09b633348ffddea4c41443a9e3aa2a1b4e58"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060destroy_render_pipeline\u0060 turns every \u0060Err\u0060 into \u0060false\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":"vendor/wgpu-hal/src/gles/device.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"6679954d1c0a87502e0a2df7f9f2621de6a760271e9d5e5e8468023445321a2b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060destroy_compute_pipeline\u0060 turns every \u0060Err\u0060 into \u0060false\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":"vendor/wgpu-hal/src/gles/device.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e93874549c89682829ca9c60ad5dc69142c6920832ce3860417495d55338457"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_adapter_pci_info\u0060 turns every \u0060Err\u0060 into \u0060String::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":"vendor/wgpu-hal/src/dx12/adapter.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca0ee379758ebcc7d963cd854cf1cf3739167ff5ec54875e44255993c5d61ee"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060help.contains(\u0022bad thing\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060help.contains(\u0022sh -c \u0027echo bad thing \u003E\u00262; exit 1\u0027\u0022)\u0060 also satisfies \u0060help.contains(\u0022bad thing\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/process.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f0ced66ef71b8e03d0776644baad0cc0a161e96294746be6563f51106ed526"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060tail.starts_with(\u0022fc\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060tail.starts_with(\u0022fc\u0022)\u0060 also satisfies \u0060tail.contains(\u0022fc\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/formats/src/swift.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4455c60b8e37c59ef364c91e5b21f1e0a5c7abda60e5aff292168dfdf953fd01"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060p.contains(\u0022libxamarin\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060p.contains(\u0022libxamarin\u0022)\u0060 also satisfies \u0060p.contains(\u0022xamarin\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/js_projection.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa196420dcb0f7715c6c83eba6f1ed8eaaac3d34880b4fcd6e87cb13e7105d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060l.ends_with(\u0022_token\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060l.ends_with(\u0022_token\u0022)\u0060 also satisfies \u0060l.ends_with(\u0022token\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/analysis/src/web_har.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2a2a13f185daf8a4d310c281658bdae20e3e690a67bbc8c168d6dcccb5d381"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"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/"}]},{"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":29,"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."]}]}