{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::tui::run (cyclomatic 68): rustnet_monitor::tui::run 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":"src/tui.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88643f2b1536c81bfe3b85820324a94a1f8a77dce0c12b71c7d9c7e0d73c4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::details::draw_connection_details (cyclomatic 66): rustnet_monitor::ui::tabs::details::draw_connection_details has cyclomatic complexity 66 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/details.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1fe02fd456e2ad9b54447a26e28b4e1462cdec1b45c0ebe638107d2c134ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::state (cyclomatic 52): Connection::state has cyclomatic complexity 52 (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/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"040b7d487483ea1dbfda2279243de904deec4314f07877a8d34e7ee7c4af4562"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run_process_enrichment (cyclomatic 49): App::run_process_enrichment has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/enrichment.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"318c1d5138b1622d50716a56261becd43d85877127b7d4b880f5cd79eb6dfb49"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::bootstrap::run (cyclomatic 46): rustnet_monitor::bootstrap::run has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c44f5c527697284fa2a748d4a176a93492bad6c724f99c6044d03330e0c3943"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::status_bar::view_hints (cyclomatic 39): rustnet_monitor::ui::widgets::status_bar::view_hints has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets/status_bar.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"998a86596469286d5b22e775a6f1325f191c801f98f6c722767838aa315d0871"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_udp_packet (cyclomatic 36): rustnet_core::network::dpi::analyze_udp_packet has cyclomatic complexity 36 (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/rustnet-core/src/network/dpi/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d6935127d33567cc3df3594e8f20fa5645c016d73ce7d00b3a6c85f25bdbb"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::packet::scan_packet_frames (cyclomatic 36): rustnet_core::network::dpi::quic::packet::scan_packet_frames 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/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c4a197033c8ea2347fd95587c02df6a7b2425e99f8337c3b83c1decb7cfcc"}},{"ruleId":"D1","level":"warning","message":{"text":"App::start_capture_thread (cyclomatic 35): App::start_capture_thread has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed46ddd16384d96fbec3b594e71a0fc904d4962ccc51197a0e03c36718c236a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_sandbox::linux::apply (cyclomatic 32): rustnet_sandbox::linux::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/rustnet-sandbox/src/linux/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddc7f44bb018bf1fcd322e94c95b6115e43655dbed33dc9a9968e23e00b1c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::overview::draw_stats_panel (cyclomatic 32): rustnet_monitor::ui::tabs::overview::draw_stats_panel has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/overview.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"880c9c9c3b0a028b2f79dba2ad05531848e3f8520b7d9ffe9ec41edec1abdcd1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::merge::analyze_tcp_segment (cyclomatic 31): rustnet_core::network::merge::analyze_tcp_segment 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/rustnet-core/src/network/merge.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2e6a20e811d8d402ebb2bdfd5630a0f577045e3e2d63df82fc6a06c887fa6f"}},{"ruleId":"D1","level":"warning","message":{"text":"OverviewTab::handle_key (cyclomatic 31): OverviewTab::handle_key has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/overview.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"518a1ccb355089012ba61a50f96a043f1cfa6a90bfee0ca43ad677481b92314e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::connection_details::visit_application_fields (cyclomatic 31): rustnet_monitor::connection_details::visit_application_fields has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connection_details.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e27f40bb40bc7a31e43658129fd4567f3676ff4f1daeff6a8414618751aab"}},{"ruleId":"D1","level":"warning","message":{"text":"ApplicationProtocol::fmt (cyclomatic 26): ApplicationProtocol::fmt 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. This is NOT this file\u0027s highest cyclomatic complexity: DnsQueryType::from_wire (cyclomatic 48) 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/rustnet-core/src/network/types/protocol_info.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36b24e9c44fe45bbefcf9d2ce5065e2f9cbae14e5ff31657b075e2d99c6fd60"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cyclomatic 26): rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments 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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"936e1390bb53aa8ea25f6bcfb2b724b6de48e6fe123ed2fd8241263bc621e0c2"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionFilter::matches (cyclomatic 25): ConnectionFilter::matches 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. This is NOT this file\u0027s highest cyclomatic complexity: ConnectionFilter::matches_dpi_general (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/rustnet-core/src/network/filter.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89b85a7e03ca3b7ff90e324308894af034ca0c0382f37c79c172f7c177455ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionTracker::measure_timings (cyclomatic 24): ConnectionTracker::measure_timings 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/rustnet-core/src/network/tracker.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77533f6b86806e7b5691227686f3a7795629c445b5470c5dd0cece08f830ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_tcp_packet (cyclomatic 24): rustnet_core::network::dpi::analyze_tcp_packet has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be7ca10ebb94e1fcf066cd1ae32232a26845086476f2847b972b022c20bf5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityTab::handle_key (cyclomatic 24): ActivityTab::handle_key has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/activity.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2458f3712b209e222a68bf7f9cd8cec2505b2527915886a1186255853a77cd4"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::braille_graph::wave_panel (cyclomatic 24): rustnet_monitor::ui::widgets::braille_graph::wave_panel has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets/braille_graph.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"29558f35226a67522d160bc32f2ace455c8d3078e4f03e1793aa72579b4e5eac"}},{"ruleId":"D1","level":"warning","message":{"text":"Theme::resolve (cyclomatic 23): Theme::resolve 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":"src/ui/theme/derive.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a003b207584d09ceaa9c02fc23d515898d89706b58cca1014c1c25b25c2f394f"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::bogon::classify_v4 (cyclomatic 22): rustnet_core::network::bogon::classify_v4 has cyclomatic complexity 22 (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/rustnet-core/src/network/bogon.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7796cfd07deb47bf7f3601c3ce8d68a0911b1872b9cf706f8524b84f9f51c94"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames (cyclomatic 21): rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames 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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9dfc8df9617b69b106fa7c7057b3bab703fcfa7e605f7e21954fea47cd1c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessExitTracker::reconcile (cyclomatic 21): ProcessExitTracker::reconcile 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/rustnet-host/src/linux/lifecycle.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06c302f612507baac5ff8107560e12c36ad9ee15334931672649501bdf0317b"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::app::pcapng_export::build_pcapng_comment (cyclomatic 21): rustnet_monitor::app::pcapng_export::build_pcapng_comment 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":"src/app/pcapng_export.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bcddb6885a9688f7432bb0646223e13c7062e9dbea3285f75f2caa18eed0dc"}},{"ruleId":"D1","level":"warning","message":{"text":"DnsResolver::start_with_spawner (cyclomatic 20): DnsResolver::start_with_spawner 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/rustnet-core/src/network/dns.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80f58f7e8f7da56624048410136d3c740cf47ab878d17ff74d108d6ad9b3112"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::merge::merge_quic_info (cyclomatic 20): rustnet_core::network::merge::merge_quic_info 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/rustnet-core/src/network/merge.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee9b4edd8343e343e55126d0bc79a066b1e6e881a9b9e0f082f1bf988fdda1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_sandbox::linux::landlock::apply_landlock (cyclomatic 20): rustnet_sandbox::linux::landlock::apply_landlock has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-sandbox/src/linux/landlock.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5ca25d60abd8aae1690030ae3e575e43ade08d9b7474fc522ca2ac3cfcc2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"App::start_packet_processor (cyclomatic 20): App::start_packet_processor 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":"src/app/capture.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b7c887320d2112cedf2520306261914d8a002ac752f02be2bd649079d0ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::mysql::analyze_mysql (cyclomatic 19): rustnet_core::network::dpi::mysql::analyze_mysql 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/rustnet-core/src/network/dpi/mysql.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2dc91cc17dac78e7723f1446de33e003b0698dfe486274baa4935b730c4c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::find_hostname_candidates (cyclomatic 19): rustnet_core::network::dpi::quic::salvage::find_hostname_candidates 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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1116ac5bd7ace09f328253a5ec1d7a98e4fa880973b86b83cd0958626961d4"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::merge::apply_packet (cyclomatic 18): rustnet_core::network::merge::apply_packet 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/rustnet-core/src/network/merge.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27913df30f4d7dd5d593739f44b9d6aaf37770decf2cdcaf8e060b5011c460"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::draw (cyclomatic 18): rustnet_monitor::ui::draw has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/mod.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b120df3e067c550172e0a1eda2ecfab915cd9c6dae9e334f351d16bb685f32"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::interfaces::draw_interface_stats (cyclomatic 18): rustnet_monitor::ui::tabs::interfaces::draw_interface_stats 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":"src/ui/tabs/interfaces.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881f8f697ff0dd4f0829c723844ee84e4147ee644b7274e234240c35ca5e573"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_capture::find_capture_device (cyclomatic 17): rustnet_capture::find_capture_device 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/rustnet-capture/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7c79227f6c0c5df8dfd8eb928c68e9cc86f3c5ab54877d58cef8666f7d622d"}},{"ruleId":"D1","level":"warning","message":{"text":"DnsAnalyticsTracker::record_packet (cyclomatic 17): DnsAnalyticsTracker::record_packet 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/rustnet-core/src/network/dns_analytics.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff92311b5a59afdd141f35a1137cee9dc73d8c217c53b03c8652c98231214de1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::activity::draw_process_table (cyclomatic 17): rustnet_monitor::ui::tabs::activity::draw_process_table 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":"src/ui/tabs/activity.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e64bc126f9c6add76ae89d474b7dfce9f244e7f4ffd1cf58918a48c84b26f2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::redis::analyze_redis (cyclomatic 16): rustnet_core::network::dpi::redis::analyze_redis 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/rustnet-core/src/network/dpi/redis.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35c0257a02fa4926fb4226097fba037478b73e143885b2d66610428bdb60e72"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::tls_common::parse_extensions (cyclomatic 16): rustnet_core::network::dpi::tls_common::parse_extensions 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/rustnet-core/src/network/dpi/tls_common.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bb2e95f0704acb47ecc191c1646090145352802b1a4134284ce42978304ef7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::connection_table::select_columns (cyclomatic 16): rustnet_monitor::ui::connection_table::select_columns has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/connection_table.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"79afe818376ad455d0fcd264a895e949bb3e46ac480cf5ae81fe6e91170639fd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::tui::run (cognitive 200): rustnet_monitor::tui::run has cognitive complexity 200 (threshold 15). Drivers by points: if/else 44 (154 pts), match/switch 5 (27 pts), loops 3 (11 pts), boolean chains 8 (nesting depth added 140). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"76faa784b1e280cdafc0be300111f8d4429c246016e3a5ef8ca899f652b98afd"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_process_enrichment (cognitive 118): App::run_process_enrichment has cognitive complexity 118 (threshold 15). Drivers by points: if/else 34 (99 pts), boolean chains 11, loops 4 (8 pts) (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":"src/app/enrichment.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b576848c893b7b006f5cf9f6381d01196ded12a06da6373a4bbf3c9d5079442"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::details::draw_connection_details (cognitive 98): rustnet_monitor::ui::tabs::details::draw_connection_details has cognitive complexity 98 (threshold 15). Drivers by points: if/else 61 (73 pts), match/switch 8 (13 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 18). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/details.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa8a8817e53cc31ac8efc722fa91d3680b679f59aa944ecc17d586128e37fec"}},{"ruleId":"D2","level":"warning","message":{"text":"App::start_capture_thread (cognitive 79): App::start_capture_thread has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (67 pts), match/switch 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"639009a9970fed10dce6693d262dff473509e9a920e926e8cdeb9f7f2879c42d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::status_bar::view_hints (cognitive 62): rustnet_monitor::ui::widgets::status_bar::view_hints has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (48 pts), boolean chains 8, match/switch 3 (6 pts) (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":"src/ui/widgets/status_bar.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff6d08cba312698dfc85e79a0418fb3c4140a3b566375f81c6ac3970a407193"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::merge::analyze_tcp_segment (cognitive 58): rustnet_core::network::merge::analyze_tcp_segment has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 7, match/switch 2 (6 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/rustnet-core/src/network/merge.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a969d01635898cadfdc1a7b95ec4e55c31d5da9291ad5b46e9773a05658e2464"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::state (cognitive 57): Connection::state has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 9 (23 pts) (nesting depth added 31). 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/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0758b174be43325b729518a2de041ee88a3bdee4f51398096d1bf66d51babbe"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::packet::scan_packet_frames (cognitive 57): rustnet_core::network::dpi::quic::packet::scan_packet_frames has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (45 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 3 (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/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86d5401d9c7782ba90c78ae7075dc9cf75369f2f4fe017bacc83d4cdf29bf47"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::bootstrap::run (cognitive 57): rustnet_monitor::bootstrap::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 34 (43 pts), boolean chains 7, loops 3 (5 pts), match/switch 2 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e4afeab3c4220c5f51b6d3cf24aa2e86eebc62c2bfa081bf42369549a19af4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::find_hostname_candidates (cognitive 53): rustnet_core::network::dpi::quic::salvage::find_hostname_candidates has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 5 (18 pts), boolean chains 6 (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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28a8c7e47f830694680cf0d40084652a45314b7303a688b9a275a238053719"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames (cognitive 48): rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (40 pts), boolean chains 7, loops 1 (nesting depth added 28). 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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"911b485ebffd8794d9c773e655ee3345350220f0ed3427e18df6c9544f00a8f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cognitive 47): rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 4 (6 pts), boolean chains 5, match/switch 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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44b3131d836a0c27c844371ebac82692f5ba5ea1b18d11a1d74ad844fc9cd4a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_sandbox::linux::apply (cognitive 46): rustnet_sandbox::linux::apply has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 5, match/switch 5 (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/rustnet-sandbox/src/linux/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca78453c90f21275882ab04096eeb05a95c663bc8b892f048b4874dd9de6beb"}},{"ruleId":"D2","level":"warning","message":{"text":"App::start_packet_processor (cognitive 40): App::start_packet_processor has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (10 pts), match/switch 3 (5 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":"src/app/capture.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"102836fb7002f2a6dff2dff8aad41bfa7423953fc8a22cded92f3644f4d589eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::overview::draw_stats_panel (cognitive 40): rustnet_monitor::ui::tabs::overview::draw_stats_panel has cognitive complexity 40 (threshold 15). Drivers by points: if/else 39, boolean chains 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":"src/ui/tabs/overview.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"5445a9e8b36fc2dd010c6f68c185006d5565dc1b7d2833fe3f403206b28237e1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_udp_packet (cognitive 37): rustnet_core::network::dpi::analyze_udp_packet has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 19, if/else 17 (18 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/rustnet-core/src/network/dpi/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f933b631af61bb586931b01879ae3b84a12084b508561fe804d2b17030c998"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsResolver::start_with_spawner (cognitive 36): DnsResolver::start_with_spawner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (10 pts), loops 4 (7 pts), boolean chains 3 (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/rustnet-core/src/network/dns.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a23567233cdc879b333f25d050d6cbf9796d9b12720360f05e867a0641b87"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExitTracker::reconcile (cognitive 35): ProcessExitTracker::reconcile has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 5, 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/rustnet-host/src/linux/lifecycle.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"020f7221eacae8830122e4799b36518f9b489a0851190c5889c172542fa1e8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::tls_common::parse_extensions (cognitive 32): rustnet_core::network::dpi::tls_common::parse_extensions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 1 (3 pts), boolean chains 2, loops 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/rustnet-core/src/network/dpi/tls_common.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"589ea05c604088e7d05e0a9cd1c840ee6b492114c548a25d2e225d35424745ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Theme::resolve (cognitive 31): Theme::resolve has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, boolean chains 8, loops 1 (2 pts), match/switch 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":"src/ui/theme/derive.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f027d56601de8987900426f267383eb9f3215ca30539dcb68c6e67c797cfce"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::braille_graph::wave_panel (cognitive 31): rustnet_monitor::ui::widgets::braille_graph::wave_panel has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, loops 2 (5 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":"src/ui/widgets/braille_graph.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"96386d76d6f3ce2b5022d4f35dbef1a3950a750d9bb8af1c8f019fdf3cfe65bb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::packet::merge_quic_packet_info (cognitive 30): rustnet_core::network::dpi::quic::packet::merge_quic_packet_info has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"584de2cce7031155d77340f03e6fcc9c941c4ee207948ce7071c5764cdef14bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::merge::merge_quic_info (cognitive 30): rustnet_core::network::merge::merge_quic_info has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 1 (4 pts), boolean chains 3, 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/rustnet-core/src/network/merge.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3eef5fc204ae13db159cbb655bef6922d417db41a118e497a9ed2182bd954a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_capture::find_capture_device (cognitive 29): rustnet_capture::find_capture_device has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (5 pts), boolean chains 4 (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/rustnet-capture/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca6c846816445bfd9b67dfd2ddffa711a82bc30850d8f9e1c3c7ff0f2b0521b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::merge::apply_packet (cognitive 27): rustnet_core::network::merge::apply_packet has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 2 (4 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/rustnet-core/src/network/merge.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"224fd886ac4a2f4192a5e77e463ba4704dd7d3a111e31b2f6c7543af8dd8c910"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionTracker::measure_timings (cognitive 26): ConnectionTracker::measure_timings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, match/switch 3 (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/rustnet-core/src/network/tracker.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4440427c7b5cef141a7f8976c2cc4f93f4c67e3eca4d16932a87364c8dd6af77"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityTab::handle_key (cognitive 26): ActivityTab::handle_key has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (3 pts), boolean chains 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":"src/ui/tabs/activity.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3920c961f9dde0bf851b6ad0188aff570fd47350cdf818fbff09ed6349e247"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::app::pcapng_export::build_pcapng_comment (cognitive 26): rustnet_monitor::app::pcapng_export::build_pcapng_comment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21 (26 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":"src/app/pcapng_export.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4898b54def5127d093e22f6e770e70fd46ef9bdd34edd29dbc3d03ce63f1bd9f"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_tcp_packet (cognitive 25): rustnet_core::network::dpi::analyze_tcp_packet has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, boolean chains 10. 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/rustnet-core/src/network/dpi/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d150718b61348c2b7cd5bc015c3e74c24f0ebb8b79b7c81d779e9a4318ceae8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::activity::draw_process_details (cognitive 25): rustnet_monitor::ui::tabs::activity::draw_process_details has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (24 pts), 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":"src/ui/tabs/activity.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8b0e50fe92042bae5c2dced1c149bd88fd52b6b93925b93992e55bed2274e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::mysql::analyze_mysql (cognitive 24): rustnet_core::network::dpi::mysql::analyze_mysql has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/mysql.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd73ac3e8cbe06442317379ae81cd5e28b4771a503e7e0cb8dd8018a37923f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::tabs_bar::draw_tabs (cognitive 24): rustnet_monitor::ui::widgets::tabs_bar::draw_tabs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 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":"src/ui/widgets/tabs_bar.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b9534c6f5316bae744bc2e71dee557c506acea7f5560a222d0f57069609d04"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_capture::setup_packet_capture (cognitive 23): rustnet_capture::setup_packet_capture has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-capture/src/lib.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4082c24aa9e472a6c2783787d6ab2cbc4cee4a49f246339a5c407f12f80ea698"}},{"ruleId":"D2","level":"warning","message":{"text":"LinuxProcessLookup::build_inode_map (cognitive 23): LinuxProcessLookup::build_inode_map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (5 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/rustnet-host/src/linux/process.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646328b732de8182b6d8d6379ea333c100a4e1fb26cd392be1c66335f4245b4"}},{"ruleId":"D2","level":"warning","message":{"text":"UiState::get_selected_grouped_index (cognitive 23): UiState::get_selected_grouped_index has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 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":"src/ui/state.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dbde6f42c8b4dc9046ddf84813d8c4f1ec47e73704ca4ae907c38c50321e25"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::interfaces::draw_interface_stats (cognitive 23): rustnet_monitor::ui::tabs::interfaces::draw_interface_stats has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 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":"src/ui/tabs/interfaces.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e807dddd5cdba978db193f85db5d573ef953e37093f5aad05c3385e2101552"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::dns::parse_question (cognitive 22): rustnet_core::network::dpi::dns::parse_question has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/dns.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b5f23ccc2dc12707f0538c2f75ba3e2991d9fe5f3fbb6d404141687597fd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::tls_common::parse_supported_versions (cognitive 22): rustnet_core::network::dpi::tls_common::parse_supported_versions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (4 pts), loops 1 (2 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/rustnet-core/src/network/dpi/tls_common.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb6a0d3e7fd58f379c0c882db7e2e3f42cf47c01e9d9574928eb2805b2fe214"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::bogon::classify_v4 (cognitive 21): rustnet_core::network::bogon::classify_v4 has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 10. 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/rustnet-core/src/network/bogon.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"90971e70633404e3a1d087546a2adc8b78ffab30972b1270ffce1b6b9d979694"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalEncoder::serialize_connections (cognitive 21): IncrementalEncoder::serialize_connections has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/headless/schema/incremental.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc6e08e1dc70250e42de75543d43a7bad44e9f83486ad02fa6b6e2a975b533"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::activity::draw_process_table (cognitive 21): rustnet_monitor::ui::tabs::activity::draw_process_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 1, 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":"src/ui/tabs/activity.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8fe2529b5d378c0ed33b63478de1b33514fc96a8e94ba91b3ae0afb80886d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::ssh::analyze_ssh (cognitive 20): rustnet_core::network::dpi::ssh::analyze_ssh has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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/rustnet-core/src/network/dpi/ssh.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f344c617632e27f51d27c10c9a90364eef7fc2a97c500a27e0f456f9218b3d62"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_sandbox::linux::landlock::apply_landlock (cognitive 20): rustnet_sandbox::linux::landlock::apply_landlock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5, boolean chains 3, match/switch 2 (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/rustnet-sandbox/src/linux/landlock.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"03630a8d0db6ae7a8e31c963f17a47b6fe94c52372617453b25f2d0e20fbb465"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::graph::draw_health_chart (cognitive 20): rustnet_monitor::ui::tabs::graph::draw_health_chart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3 (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":"src/ui/tabs/graph.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aabd228969d57e10b6cc57ca9d0f31835fa2643d1ca7ed6f3809297e4011f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsAnalyticsTracker::record_packet (cognitive 19): DnsAnalyticsTracker::record_packet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dns_analytics.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd87a2f27b0f6a0342f9e67623e09c4a2e2a6ac0e492777bfcaaba2b4dd123b"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplicationProtocol::fmt (cognitive 19): ApplicationProtocol::fmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/types/protocol_info.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"297d924e322c32edd7d08c64dfb69cd5c5cb751e649f5c9944facf1b14264b49"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::ftp::analyze_ftp (cognitive 19): rustnet_core::network::dpi::ftp::analyze_ftp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/ftp.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c643e79aaadf133e225d9b6db8cc477711b239b7202cf6fdf40cc926db955d73"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::gateway::parse_route_dump (cognitive 19): rustnet_core::network::gateway::parse_route_dump has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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/rustnet-core/src/network/gateway.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"79936920ab7bcfe8ef1ab16e313b4da7cf3dbf6deb40ec7a91b07dfbe562e49a"}},{"ruleId":"D2","level":"warning","message":{"text":"KubernetesSocketTable::build (cognitive 19): KubernetesSocketTable::build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/network/kubernetes.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"811725996dbf9ab0eb57c707cfed2546b1a71236a9b9e11372cd691138317749"}},{"ruleId":"D2","level":"warning","message":{"text":"OverviewTab::handle_key (cognitive 19): OverviewTab::handle_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 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":"src/ui/tabs/overview.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e666b917598fd971920a978a30a8d4d77681dc455f738b17a0906efec85124f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::app::output::unix::parent_dir (cognitive 19): rustnet_monitor::app::output::unix::parent_dir has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 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":"src/app/output/unix.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ff57b258b8a343d53063b3a7059ac44270a44d2f087f094db8b760865b161a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::host::draw_dns_evidence (cognitive 19): rustnet_monitor::ui::tabs::host::draw_dns_evidence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/host.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c626d9581d78ed886309f9618152a370821074ba8f3de93be104442183749006"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsResolver::stop (cognitive 18): DnsResolver::stop 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/rustnet-core/src/network/dns.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da9e520dac5aeee5f34650e12ab198ef17ac68adfb6ca4c66105dc6d3600e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"CryptoFrameReassembler::add_fragment (cognitive 18): CryptoFrameReassembler::add_fragment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/types/protocol_info.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"577cb09c40b1f5e99aa635fbf7e925eb48f7cdbf53fdc2056ee6864f5aa374e6"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::redis::analyze_redis (cognitive 18): rustnet_core::network::dpi::redis::analyze_redis has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/redis.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ce40bfa0b5a8a32d25de1bb0174f893ffe4db0c9f0a58080f337c0e10c0013"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::protocol::tcp::parse_window_scale (cognitive 18): rustnet_core::network::protocol::tcp::parse_window_scale has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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/rustnet-core/src/network/protocol/tcp.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4506462fe00dc60bc464f30e282a6874d547d136bc6f91289824e75521b7ad"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::connection_details::visit_application_fields (cognitive 18): rustnet_monitor::connection_details::visit_application_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (9 pts) (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connection_details.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"364aac5e02d19caa595aec84170392a1d43cfcbb5ae4d1b1b8cb621cc32dd150"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::connection_table::select_columns (cognitive 18): rustnet_monitor::ui::connection_table::select_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), boolean chains 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":"src/ui/connection_table.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d4e4bc6acdfc9e35ecd092111426470e37f2f4e6d9a1b4bb5da522261df402"}},{"ruleId":"D2","level":"warning","message":{"text":"PacketParser::parse_ipv6_extension_headers (cognitive 17): PacketParser::parse_ipv6_extension_headers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 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/rustnet-core/src/network/parser.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e6e15a9ae63d75607c1a28381316e0b379a911dcab7784994ea2ff43b60090"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::dns::skip_dns_name (cognitive 17): rustnet_core::network::dpi::dns::skip_dns_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 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/rustnet-core/src/network/dpi/dns.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"03127f6ab4de9811877692f30e6c7ecf32967befb5b8fb4e8bb1729cc831e041"}},{"ruleId":"D2","level":"warning","message":{"text":"SocketLifecycleTracker::scan_closed (cognitive 17): SocketLifecycleTracker::scan_closed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 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/rustnet-host/src/lifecycle/inventory.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c5dec027f44db8146cb2142529eaecee9d8fd1c6ac2e4be27fc1d54d9e3506"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::app::logging::log_connection_event (cognitive 17): rustnet_monitor::app::logging::log_connection_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), 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":"src/app/logging.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aecf021f5382b5a9dd5d6350d3c1b3d469d3a8be414f7882a25db6323f7eca3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::activity::draw_activity (cognitive 17): rustnet_monitor::ui::tabs::activity::draw_activity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 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":"src/ui/tabs/activity.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3386899a8a0ea10a0c9183c1d9ea585e7a2ad58f19aed5be8be39b652f45a330"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsStatsProvider::get_all_stats (cognitive 16): WindowsStatsProvider::get_all_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/interface_stats/windows.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"56358d572ed86bbba5f12638e75255e8457997f318a523c37a53f550f3f0b1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExitTracker::scan_closed (cognitive 16): ProcessExitTracker::scan_closed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/linux/lifecycle.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2280a00ddc0c28872c45fa22a5a42e22788cf0068b9085194903f099c3021"}},{"ruleId":"D2","level":"warning","message":{"text":"App::start_interface_stats_thread (cognitive 16): App::start_interface_stats_thread has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/sampling.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f57fc5c5d7b09649ee7675d7c8b5e0a4c0587d20b88b415a9c88eb6869855a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::headless::stream_json_lines (cognitive 16): rustnet_monitor::headless::stream_json_lines 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":"src/headless/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca20c697a357d581564fe0aab4d3acbadc67db905046252f8c04bc404db87b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::sections::handle_key (cognitive 16): rustnet_monitor::ui::sections::handle_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/sections.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10a8c90b2d03a6cb7b9fd5741dc45d83d5f52c542412ab799747d689472afcd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::details::draw_traffic (cognitive 16): rustnet_monitor::ui::tabs::details::draw_traffic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, 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":"src/ui/tabs/details.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c2f7df426f148044cb7a75430c10b17b4c87b0916f219934a43d4cc6430cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::overview::draw_overview (cognitive 16): rustnet_monitor::ui::tabs::overview::draw_overview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 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":"src/ui/tabs/overview.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ce09a1c126c0f17d6fae4d3a47a24ecdc924459fc85d6363d803516668f5b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::details::draw_connection_details: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::details::draw_connection_details runs 523 significant 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 423 over it, 5.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":"src/ui/tabs/details.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1fa1c2aa83c365a6f66b0dc0e7bdc610f6bf5dd5b911dc8095f32e895c2bb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::overview::draw_stats_panel: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::overview::draw_stats_panel runs 312 significant 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 212 over it, 3.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":"src/ui/tabs/overview.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"160baaa51469628283ca4d363f180b3544de2d787f45b9b180891fa456e10e40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::tui::run: FunctionTooLong \u2014 rustnet_monitor::tui::run runs 244 significant 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 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe40bd0a47df085fbbb7bfdca314cd84436a2cf614352d2820821de65f46cf38"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rustnet_monitor::ui::theme: TooManyFunctions \u2014 72 free functions. The bar is 30 free functions; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/theme/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76d57c451a11ffb144af914c1a83c6ae2e71e2df647b43c5d6d3ad843069624"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/details.rs: FileTooLong \u2014 1153 significant 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 653 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/details.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b86ae6b7a59278af7d56b388e43388f1bf8a13123600b58aed29acd81d05b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::bootstrap::run: FunctionTooLong \u2014 rustnet_monitor::bootstrap::run runs 229 significant 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 129 over it, 2.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":"src/bootstrap.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee64917d6cd5f7f34b2a13ee34aa92275bfb6cc38a4920c228f1108960656a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/overview.rs: FileTooLong \u2014 1137 significant 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 637 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/overview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af23227641b5e35176d08afee41d8eb92efa0031a38a684b6eebc7cb05cc02e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::cli::build_cli: FunctionTooLong \u2014 rustnet_monitor::cli::build_cli runs 220 significant 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 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"417e71231692a7a61a146eb7e08d95ffe4642e493a8c4cced289b50c443188e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::connection_details::visit_application_fields: FunctionTooLong \u2014 rustnet_monitor::connection_details::visit_application_fields runs 220 significant 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 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/connection_details.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"681bc9ef30ec1bace7c5a035ca52f4d06d0779ef3351ed663079c2cbf3a68ff1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 63 methods, declared across 5 files: app/state.rs (47), app/capture.rs (6), app/sampling.rs (5), app/enrichment.rs (4), \u002B1 more file(s). The bar is 30 methods; this is 33 over it, 2.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":"src/app/state.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b29b83ec01bd57214bc4c91027054d8740184c3acb0c44b27168776f8ceef5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: UiState: TooManyFields \u2014 57 stored fields beside 41 methods. The bar is 30 stored fields; this is 27 over it, 1.90\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":"src/ui/state.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e44cd3995a2e4361e97392168b0a34f00793f84a89c23508a46c77c64ba1054"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/protocol_info.rs: FileTooLong \u2014 938 significant 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 438 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/rustnet-core/src/network/types/protocol_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcce06c9fdd52d160158d7c82f57bb84571358d3e318edb5ed58369cedbb887"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Theme: TooManyFields \u2014 53 stored fields beside 1 method. The bar is 30 stored fields; this is 23 over it, 1.77\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":"src/ui/theme/derive.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cec72ceddcc1fb5343f8fb0776d5a96b162296944d38b21ce2aa34aa39ad993"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run_process_enrichment: MethodTooLong \u2014 run_process_enrichment runs 166 significant 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 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/enrichment.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d859d48ddd7247d0f216c9be31f2e658455edb90e431412f34c6b86fd59137c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::activity::draw_process_table: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::activity::draw_process_table runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/activity.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2baa83cb437c42ae1fac71dfd3d3ff124865b1b81373a49aa7246c62019692c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.start_capture_thread: MethodTooLong \u2014 start_capture_thread runs 162 significant 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 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"be83dedf4dfdb8ab04fd0458fbc725cfefc68b7c8941a24d22c29d82d481e690"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/activity.rs: FileTooLong \u2014 809 significant 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 309 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/activity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55774533e8a175978a716bbdaef908a09f4df7d965ce3775d84b758017a8cd0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Connection: TooManyFields \u2014 48 stored fields beside 19 methods. The bar is 30 stored fields; this is 18 over it, 1.60\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ea4bd19b9ca5b74bac6ab11a4c8748c977e339bccf38059ff823be0c5eb655"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/state.rs: FileTooLong \u2014 790 significant 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 290 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":"src/ui/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6cd5881f0612e76855159a23d36c47d22b224ca355188f50bfae651f8fd8d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/capture.rs: FileTooLong \u2014 777 significant 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 277 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfcba582841b70c9cc6701b5a4ded06961da26c37a720980493d46a97c567d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/host.rs: FileTooLong \u2014 761 significant 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 261 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":"src/ui/tabs/host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69273f35bfc3b4acd912709381098cb2cc4d4c0fb42a4c3960f8c0c52e72ad81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.start_packet_processor: MethodTooLong \u2014 start_packet_processor 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":"src/app/capture.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"91512e673795b0e7dc29bd106744d9bc36b16b65e9a677c835c8eb1d4d0c0583"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::interfaces::draw_interface_stats: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::interfaces::draw_interface_stats 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":"src/ui/tabs/interfaces.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be887b2e1573dd6fe2ca66c45631bad5a42b3f1d48b78d0148b24c796f85b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: headless/schema.rs: FileTooLong \u2014 723 significant 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 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/headless/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4a783f9bf1eb4e745cc2a5d6ff96d4a28e98eb383d18befbf6492da18c7e6b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConnectionTracker: ClassTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 3 blocks, lines 317-1255. The bar is 400 significant lines; this is 170 over it, 1.43\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/rustnet-core/src/network/tracker.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984f7d39eac0bbf988ab8a93ab0705ae4a5eab3e1bff68b828607d6baf22afe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/tracker.rs: FileTooLong \u2014 712 significant 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 80% of them inside a single declaration: ConnectionTracker (3 blocks, 317-1255). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9636529b2b8c8352d7959d4d22542cfa41dd31224cd4a2d67f1f95081afbd5bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UiState: TooManyMethods \u2014 41 methods, declared across 2 files: ui/state.rs (39), ui/sections.rs (2). The bar is 30 methods; this is 11 over it, 1.37\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":"src/ui/state.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c066a5ae0e5af0e88e9744f079ff5e6ccf0f619afa1fbc1a6c4c54690cafdca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::widgets::braille_graph::wave_panel: FunctionTooLong \u2014 rustnet_monitor::ui::widgets::braille_graph::wave_panel 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":"src/ui/widgets/braille_graph.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a201b356680cffe650d1c484d5b9f517d4ee56fb21925cdb572aa483f0bad6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConnectionSnapshot.from_connection_with_process: MethodTooLong \u2014 from_connection_with_process 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":"src/headless/schema.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee12994b9e34a388b3c3668ccd22e24267d80ee3965b19a1e5d338e986c0f2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 3 blocks, lines 68-1178. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/state.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1d53a9858fe46d828e33e74971bd371daa68ff4299514187c8b7687bfa5f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectionTracker: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/tracker.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0085d7e1548080fa3d88a12ea956b65b9c4e035b52eef9e555c9058e665a57f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::details::draw_traffic: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::details::draw_traffic 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":"src/ui/tabs/details.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82969361baf2f0301246358e06df687ce11965707acf967cd1c90c5f0875267"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/process_activity.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/process_activity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a6ddb9e7c1017cae8d2dcccead4f72420fe4b9a0d1e9803d9c979f3c4e7b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::activity::draw_process_details: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::activity::draw_process_details 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":"src/ui/tabs/activity.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c07a265e3c0246cd09ee801a6e2f985f75f6b8df701471c2602c8b3c616b09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverviewTab.handle_key: MethodTooLong \u2014 handle_key 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":"src/ui/tabs/overview.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3707be17fd15816ebe72580208690661d2709bb52da87aea242e58a0b19a1b88"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 36 stored fields beside 63 methods. The bar is 30 stored fields; this is 6 over it, 1.20\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":"src/app/state.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16b97c7fbbb2909317dc8f5349ab29ae2f141d35ab4d1f43a6e33e6af65b2df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/state.rs: FileTooLong \u2014 594 significant 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 86% of them inside a single declaration: App (3 blocks, 68-1178). The bar is 500 significant lines; this is 94 over it, 1.19\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":"src/app/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a135933a265a793381d2dfee5bc5f8517e673e82686e7886919de4cf44701a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_core::network::dpi::quic::packet::scan_packet_frames: FunctionTooLong \u2014 rustnet_core::network::dpi::quic::packet::scan_packet_frames 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/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d2639e75e5f0d4b39f6e16ac2281fa33cca11a376b38c3c14013c5fc2fbe7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::tabs::host::draw_sockets: FunctionTooLong \u2014 rustnet_monitor::ui::tabs::host::draw_sockets 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":"src/ui/tabs/host.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"256e860eda043070428a461b8c048dbd0ff8e733aa8193a99763ff292f908676"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/graph.rs: FileTooLong \u2014 575 significant 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 75 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":"src/ui/tabs/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c80d58ee8a2ab0768ee416b44c6b7a71fc3acaec17140342a688cba83a706e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/connection_table.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/connection_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e50757bf43aaa3eb7aeb1bb51302291af3d72dda52fc1193ee346b57139c111"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/connection.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: Connection (2 blocks, 182-856). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08eb89a19540d8d40c99d20a67468b9d54ad735c2f916227711d174c3d1eb3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/process.rs: FileTooLong \u2014 531 significant 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 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/windows/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b59f5f33411f5713d8fa4138da24ac0d6c52401413d9e87503426c4797cd0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 530 significant 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 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93313c3f6dc0c2a03cd15843c8ed1a94ad7a3c40c64ac477954b9a566b0e970e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::draw: FunctionTooLong \u2014 rustnet_monitor::ui::draw 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":"src/ui/mod.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"481ec67a56379f4b7c88549d7c164d14a811a789f9ebb40339233097ff02ab76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/merge.rs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 26 over it, 1.05\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/rustnet-core/src/network/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8011a742e7778b7eef2a922a0c4813d940f4cf1cc68f2bf954ba64b40ca90904"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: linux/process.rs: FileTooLong \u2014 509 significant 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 9 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/rustnet-host/src/linux/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1d530375fd4f96b6a7a6d4cc22e76af7a61f2cc621359d0a85134506e7747e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Connection: 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), 19 methods, 2 blocks, lines 182-856. 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/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4809f1b33990427e801668d5ae3589a26c4d18bf4a1610da4ae7c04e673f86bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::ui::widgets::status_bar::view_hints: FunctionTooLong \u2014 rustnet_monitor::ui::widgets::status_bar::view_hints runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets/status_bar.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f510fbf8cd5275218b5ce30de056b9e51dcc23c9bfac8a27b7852f8644f72cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/ui/theme/definitions.rs:459-486 | src/ui/theme/definitions.rs:488-515 | src/ui/theme/definitions.rs:521-548 | src/ui/theme/definitions.rs:550-577 \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":"src/ui/theme/definitions.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f3479af190aea4910a375fc084102a9c6b3d679ed3ffd0dfa3aed0e63a756c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/rustnet-core/src/network/dpi/tls_common.rs:280-308 | crates/rustnet-core/src/network/dpi/tls_common.rs:355-386 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/tls_common.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98c1c3a9615e113d0f35a6d8162acd43b843c0baaf768a6b6cefd978fc8f175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rustnet-host/src/freebsd/process.rs:248-262 | crates/rustnet-host/src/macos/process.rs:235-249 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/freebsd/process.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c0d8ad787787ff93ac733acea513b2adca1003e912a5e86d01248d5deee4f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/ui/theme/mod.rs:237-249 | src/ui/theme/mod.rs:536-547 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/theme/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c449f1ee8a93608376c556d28285cca98acf0b0fecb4c1c398a5d20e1b70ec91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/ui/theme/derive.rs:278-290 | src/ui/theme/derive.rs:294-303 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/theme/derive.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d122ee174abaef2a860a734d312172b1e2bf2ec18999d5e9d650fbf3126b66a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rustnet-host/src/freebsd/process.rs:285-301 | crates/rustnet-host/src/macos/process.rs:218-231 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/freebsd/process.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d57aee94ef94a2195c5bb18c6cc31929a94d510dd6e774644766fc114fbd0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rustnet-core/src/network/link_layer/raw_ip.rs:51-65 | crates/rustnet-core/src/network/link_layer/raw_ip.rs:75-89 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/link_layer/raw_ip.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd355d60a53560929bb55048b50997c778c1efe805b38876d6f456abb4c1ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rustnet-host/src/linux/ebpf/tracker_libbpf.rs:53-68 | crates/rustnet-host/src/linux/ebpf/tracker_libbpf.rs:78-93 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/linux/ebpf/tracker_libbpf.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58b0f34df865f976524d49eb431ff8fc317a0c60d34d7a00ff4644228326a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/rustnet-core/src/network/types/rtt.rs:363-381 | crates/rustnet-core/src/network/types/rtt.rs:396-419 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/types/rtt.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"33180444b5e4233c96e8abb47c2873300de1d1fecf030a783d3ac9b0cab3ca7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/export/pcapng.rs:124-131 | src/export/pcapng.rs:137-144 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/export/pcapng.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15ac3430bb96949503793200c593467dff9c50e5587d43f6aa1f6da517b00f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/app/output/unix.rs:57-67 | src/app/output/unix.rs:69-79 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/output/unix.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3c37be5c408975b314f3b07b97297611b415e0fc4139d89eb4e5774638207c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/ui/theme/definitions.rs:475-486 | src/ui/theme/definitions.rs:504-515 | src/ui/theme/definitions.rs:566-577 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/theme/definitions.rs:475\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/theme/definitions.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"98996d5ea60034f276302b5fbaf27acf3273285a2a4243ebd15c2ab229242aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rustnet-host/src/freebsd/process.rs:70-79 | crates/rustnet-host/src/freebsd/process.rs:97-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/freebsd/process.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f62f7d5225c520adc0dfcaa9129c2215758d9785d443148313b0dafc849690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rustnet-core/src/network/parser.rs:775-782 | crates/rustnet-core/src/network/parser.rs:797-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rustnet-core/src/network/parser.rs:775\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/parser.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fb5dd3f3087510e863320d62208cc8b12a61fd651e85de6dea1f8d1a04d23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rustnet-host/src/linux/lifecycle.rs:158-166 | crates/rustnet-host/src/linux/lifecycle.rs:218-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rustnet-host/src/linux/lifecycle.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn scan_closed( \u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/linux/lifecycle.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb24054086cb1766d9f621944d65d7203f76d9a2d52b8527bbd4d551a688d3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rustnet-core/src/network/dns.rs:323-329 | crates/rustnet-core/src/network/tracker.rs:1031-1037 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rustnet-core/src/network/dns.rs:323\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dns.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6dbf1cc418a7676000a7aec713035caeaa839c6cb7f42de182dada94d18fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rustnet-host/src/linux/ebpf/loader.rs:221-227 | crates/rustnet-host/src/linux/ebpf/loader.rs:324-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rustnet-host/src/linux/ebpf/loader.rs:221\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/linux/ebpf/loader.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8053661021d01c14d65ce5e0327b698638f0bafca76ac012de0999d9f9f561a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/ui/theme/definitions.rs:468-473 | src/ui/theme/definitions.rs:497-502 | src/ui/theme/definitions.rs:530-535 | src/ui/theme/definitions.rs:559-564 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/theme/definitions.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5bba10a1e84cd93cfae6ef4636f99cabbc2e1d9107259379ea38fbf6743239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rustnet-core/src/network/dpi/quic/packet.rs:149-156 | crates/rustnet-core/src/network/merge.rs:784-788 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rustnet-core/src/network/dpi/quic/packet.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b7b2ba301bf401ada1e03e81a675e0232de43dc0bff8a9297d437bea9012ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/ui/tabs/activity.rs:307-320 | src/ui/tabs/activity.rs:382-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/activity.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2528d5177f18e4b2a6c8bdd0393bf7614df73986dbab06c699ce253ab8956f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/ui/tabs/graph.rs:621-631 | src/ui/tabs/graph.rs:667-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/tabs/graph.rs:621\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/graph.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c39a138dd9effbc90bb8e5b763ce6bd78f1857408734a7e6a9e069c145a7a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/ui/tabs/graph.rs:722-728 | src/ui/tabs/graph.rs:729-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/ui/tabs/graph.rs:722\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/graph.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b580d4725e71073f5342af3462233ffe7aee98ca6a44f16558bd0e77155a67"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustnet-capture: rustnet-capture: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f35031d1b5f5cedc56d277c0b38731cabb60fe73b9481c4bc2c7c34773c9cde0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustnet-sandbox: rustnet-sandbox: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8889d291942140d8f9f26eb428982b1c8234d64909d0f642300467e6e9d25535"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustnet-core: rustnet-core: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"70e42bbfd771781dde31d68871dc74e9cb338ed546de631386d303b329203b4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/tabs/details.rs: src/ui/tabs/details.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in rustnet_monitor::ui::tabs::details::draw_connection_details at line 879. 7 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/tabs/details.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":"src/ui/tabs/details.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae82cacfd3389b7bcca76e54d653c1f8ab418165dce4605476ad51e721c7aa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/mod.rs: src/ui/mod.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rustnet_monitor::ui::draw at line 336. 8 of those changes were fix/bug commits, and the other 25 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/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":"src/ui/mod.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"051216c46a873255132aac6d31cd7b99dd60ffa3ab6ac5d60c2df2950c45ec56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/types/connection.rs: crates/rustnet-core/src/network/types/connection.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Connection::state at line 558. 2 of those changes were fix/bug commits, and the other 9 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/types/connection.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/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"365d3ec007131f00df9701683f3fc96b9a0d6c24d5ffaff63a9bcc4e2fadac86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/tabs/overview.rs: src/ui/tabs/overview.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rustnet_monitor::ui::tabs::overview::draw_stats_panel at line 949. 6 of those changes were fix/bug commits, and the other 10 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/tabs/overview.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":"src/ui/tabs/overview.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e15784a22b1b0e42ef5af684d6579c29ba546a23bb65f0a4a5641990083f348"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/enrichment.rs: src/app/enrichment.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in App::run_process_enrichment at line 180. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/app/enrichment.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":"src/app/enrichment.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"55868e1f8106789e7d0498f7deb644d956eaf9b888989951b886056ef776e163"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/widgets/status_bar.rs: src/ui/widgets/status_bar.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in rustnet_monitor::ui::widgets::status_bar::view_hints at line 112. 2 of those changes were fix/bug commits, and the other 8 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/widgets/status_bar.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":"src/ui/widgets/status_bar.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e8443d1e02e681aa42b4369f6f5ed38113b4ea3622befeb6154b2afbdee9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/capture.rs: src/app/capture.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in App::start_capture_thread at line 591. 2 of those changes were fix/bug commits, and the other 9 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/app/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":"src/app/capture.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc1fb25e341cfb29ca11cd919915aff09837634549d7ffa00ad0fdaa2f25990"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/merge.rs: crates/rustnet-core/src/network/merge.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in rustnet_core::network::merge::analyze_tcp_segment at line 118. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/merge.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/rustnet-core/src/network/merge.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c787ebae55d42fb64c1c0d66ab71b5bd84c95983aaf47f290a236c46ef05c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap.rs: src/bootstrap.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in rustnet_monitor::bootstrap::run at line 17. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/bootstrap.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":"src/bootstrap.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a662db4cba9263783ccaeba998bc44a54e1f0c7a6fb6bae79a8da4c741a4044"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tui.rs: src/tui.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in rustnet_monitor::tui::run at line 26. 2 of those changes were fix/bug commits, and the other 2 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/tui.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":"src/tui.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4124a266281f66b34232f1a583ee83deb514b4f39cf55955a2ae15c75999f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/tracker.rs: crates/rustnet-core/src/network/tracker.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ConnectionTracker::measure_timings at line 549. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/tracker.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/rustnet-core/src/network/tracker.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f31c2fbc90a550004264c7c119c0c35a58bccdc100f766f41a8577e8295847f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/tabs/activity.rs: src/ui/tabs/activity.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ActivityTab::handle_key at line 58. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/tabs/activity.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":"src/ui/tabs/activity.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1163d504473a595de84b5d49aff1ed88b88cdfc1f2350502396b26183e690b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/types/protocol_info.rs: crates/rustnet-core/src/network/types/protocol_info.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ApplicationProtocol::fmt at line 277. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/types/protocol_info.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/rustnet-core/src/network/types/protocol_info.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc9a23431d06ce79bf733f8c73181d323d4562e15690796d790e0c8466a70f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/dpi/mod.rs: crates/rustnet-core/src/network/dpi/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rustnet_core::network::dpi::analyze_udp_packet at line 184. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/dpi/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/rustnet-core/src/network/dpi/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aced018f13be7607041857ed212f236d007e42daa5910252ccbfc1798c29d41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/filter.rs: crates/rustnet-core/src/network/filter.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ConnectionFilter::matches at line 211. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/filter.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/rustnet-core/src/network/filter.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4f7cc4502d6ed4bf1dfa14d58bf28b522a415ac6892705753ec4bc59fcc775"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/widgets/braille_graph.rs: src/ui/widgets/braille_graph.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustnet_monitor::ui::widgets::braille_graph::wave_panel at line 323. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/widgets/braille_graph.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":"src/ui/widgets/braille_graph.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"588cfc6fce6d3ffbb5f2945eddfce2717199923c7cb39c3bdaa20cf9571228b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-sandbox/src/linux/mod.rs: crates/rustnet-sandbox/src/linux/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rustnet_sandbox::linux::apply at line 69. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-sandbox/src/linux/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/rustnet-sandbox/src/linux/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4995155892345d31bdb7696f731a2686fb0d03aa4148655d0fe46daaab1977"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/theme/derive.rs: src/ui/theme/derive.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Theme::resolve at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/theme/derive.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":"src/ui/theme/derive.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cf848d0bdee37926c11f2923748f4693941bc3cc4654fb60904aed1efb02e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/tabs/interfaces.rs: src/ui/tabs/interfaces.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rustnet_monitor::ui::tabs::interfaces::draw_interface_stats at line 21. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- src/ui/tabs/interfaces.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":"src/ui/tabs/interfaces.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c67b13f68b1e5ae03cb48246315e152ff9bd5ed44fd7595f5fb9b553a89be4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/dpi/quic/packet.rs: crates/rustnet-core/src/network/dpi/quic/packet.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rustnet_core::network::dpi::quic::packet::scan_packet_frames at line 531. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/dpi/quic/packet.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/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d633ca3fe0b928704f661586d31a47ca3a67b703b47a320a86891d700c04cfd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-capture/src/lib.rs: crates/rustnet-capture/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustnet_capture::find_capture_device at line 399. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-capture/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/rustnet-capture/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff536bf254c9c5d6cbeeec207072b768170e0cdcd69a202111bd75332c2ae93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-sandbox/src/linux/landlock.rs: crates/rustnet-sandbox/src/linux/landlock.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rustnet_sandbox::linux::landlock::apply_landlock at line 138. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-sandbox/src/linux/landlock.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/rustnet-sandbox/src/linux/landlock.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7cda4ec997947d591bf4ef150d13351d2b13d4303734597ddbf819169081cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/dpi/quic/salvage.rs: crates/rustnet-core/src/network/dpi/quic/salvage.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments at line 116. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/dpi/quic/salvage.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/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d4eb0e49689777b9c4390fb0aa9f008e1fdee9382b87f894d9eefa3ca8ad62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/dns_analytics.rs: crates/rustnet-core/src/network/dns_analytics.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DnsAnalyticsTracker::record_packet at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/dns_analytics.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/rustnet-core/src/network/dns_analytics.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad0e27771e92f08072c93f54a12bba6a740f9c357cae56dc70093bdcbff89cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rustnet-host/src/linux/ebpf/maps_libbpf.rs: crates/rustnet-host/src/linux/ebpf/maps_libbpf.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is MapReader::cleanup_stale_entries at line 273), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: retire stale connections using host lifecycle evidence (#684)\u201D; \u201Cfix: retain short Kubernetes flow attribution (#634)\u201D; \u201Cfix(ebpf): align ConnInfo ABI on 32-bit targets (#612)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-host/src/linux/ebpf/maps_libbpf.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/rustnet-host/src/linux/ebpf/maps_libbpf.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f3ab4ab27ec9103ce2348dcf75b7b384f3e974e20117f78e2915639da7b468"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rustnet-host/src/linux/ebpf/mod.rs: crates/rustnet-host/src/linux/ebpf/mod.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is SocketMatch::new at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: retire stale connections using host lifecycle evidence (#684)\u201D; \u201Cfix: retain short Kubernetes flow attribution (#634)\u201D; \u201Cfix(linux): keep attribution for connections that predate startup (#575)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:53:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:53:25 \u002B01:00\u0027 --full-history --no-merges -- crates/rustnet-host/src/linux/ebpf/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/rustnet-host/src/linux/ebpf/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"be65816cb93b46a6b5de12a48c6cf810b0da6f5895caf8b94dee16265a21f031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(udp landlock): UDP restrictions (LANDLOCK_ACCESS_NET_CONNECT_UDP / \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-sandbox/src/linux/landlock.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"344bbc1100ec4483bfd0c38ac712a5a4c129f054db89a3a50cb53f13995a7eb6"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 5 project(s) overshoot their size bounds, lowering Project Cohesion to 2.0/10. The most over is \u0060(repository root)\u0060 (35259 LoC, 110 module-visible types across 12 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4b7723ad08a31d3764a3ee0ffe4e52433f46e1c51a274ca3fb7eef2aa1386b0"},"taxa":[{"id":"CWE-78","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":"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":"790112641fdb249b553019ad57bb434ed157bcb13a7a891d6c927b5636dfa181"},"taxa":[{"id":"CWE-78","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":"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":"01f97998bf71a2593bf7aeb303e4d3c3528ff90914f41420255ba012d03999d1"},"taxa":[{"id":"CWE-78","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":"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":"28ef15a1eb5be1781fc09a686a0420a940e8c8db204a79e6242ed33833ec0229"},"taxa":[{"id":"CWE-78","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":"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","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":"dad676e5211068b3cedebe80b9b13cd48c93a9544377a923288d3fa650732653"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","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":"ef7fd20b2d29186984b339c9e7f9bcb22ef1333e9b514f53e5dfedcfcd9a1468"},"taxa":[{"id":"CWE-78","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":"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":"a222c9549278d36e988e986e07eb0e899395e9131d8e01c893cbc24b1a4caa0c"},"taxa":[{"id":"CWE-78","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":"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":"7363add018c4b97d8e0b36fd4c82806d9e5bc88216f939c7a3826106817d2b81"},"taxa":[{"id":"CWE-78","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":"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":"e0927d3df6338bb77b4e2f8b5fefedd2fe73a6e7fdc670b86720cf65af4d1548"},"taxa":[{"id":"CWE-78","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":"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":"89017e98c868a733438b84aa6f026f015f99754224abf8398f4574e30d2ce2c3"},"taxa":[{"id":"CWE-78","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":"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":"5790c875f435dab3fde72cf13f1a22ea6eb94f241a2919e6e5a50bfbf0f895da"},"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"}}]},{"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":"1769941ff766ddef1bf8835289ee74817a700c934e1a8262ff15f07de27bfd8a"},"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"}}]},{"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":"29f5defcb75de5fae17c65d95d74891e77731f07781a6ec7471ca4c7bd511b04"},"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"}}]},{"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":"11e63d8445461d4933b6eabd6dd3d9161de9be64bc702b5e8d9981641d5fa1ac"},"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"}}]},{"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":"5e7893973c293568d9bc9067fa4f37be14a7884742e5fdc010edd716b0bc7ddb"},"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"}}]},{"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":"173b74e0713bf55d4fd09f0f1cb74248ff11eb131b7b0621ee06b85c22e0a6d6"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"3cfe469f1f27f69bd33561f0fdb1dc76052a076164bfb1f048a49aac1de328d0"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"fcec4f646c1164e3ffe342ed86f6e7078fafe094caf2ed5ab21f3f312e856acb"},"taxa":[{"id":"CWE-78","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":"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":"78b84f1c6d0cb173f6774195f84cf2dcba3d30f9f31763e36d8fbf847e7fa905"},"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"}}]},{"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":"c99400015392386d3f0586547322e30a9c0cc3353a563d85fc4aa6e0f003ff5f"},"taxa":[{"id":"CWE-78","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":"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":"254269a5e2a0cd24332ac8f1153fe9b1e2edbb9079e88c4f3ed999956a57fb3d"},"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"}}]},{"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":"c6ef2f316ca631b692d03c475bed7e473e93f3db6fa35d9ef86248c50808e234"},"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"}}]},{"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":"62c0320fe1418f1e9b7b2757835925549f275bf2b005b67d2b5a879327e74f6d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0b18124e4892ee258d4e49dd5ddc458260e915ddfa806aecd20366ab351b68a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"5c802ec97e672feaa32f710e6686a62b890e325cf5a04a8fb4136422a8a2ef74"},"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"}}]},{"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":"a833562152380d1fd2213769e85b74d41cfde70ad66e29407eac87a0ba62a705"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"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":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"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":"94112b1d706b2f9d9118c577518290919c2d702aa0b944fa06a5bcbb51101185"},"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":"5cd6ba725d4cfdefa0b9a1fc9a630396a4a700aff93699a8233f4a088607d6d7"},"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":"a77a628c056f00bc475a03de6d7c923f8e07a855e9b4fc652986cc61cd3be665"},"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":"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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"5eeda55fdfcb52e6b21cb00ff970199e76495532773f3e9ca6b2e1a235154f84"}},{"ruleId":"D31","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":"0a92da0cc0f830b1636377958671223c7d8b403fe47679290bef5e93b48fa090"}},{"ruleId":"D31","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":"1cc9ea7ad4de13141dee3ec2cb12dbdbe0a9db16e7095c5f9ed79e66b498f367"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa1672811e23de8114ffa3fca6e60ec67818aa11a782e2f3132602471f271d1f"},"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"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ebe97dea057442c8c07116d5326441dc864f71aedace7fa1b64a9e6ed720e94"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tracker.rs \u2194 details.rs: \u0060crates/rustnet-core/src/network/tracker.rs\u0060 (context crates) and \u0060src/ui/tabs/details.rs\u0060 (context ui) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006023b9793f\u0060 fix(tcp): apply RFC 7323 window scaling to the displayed window size \u2026; \u0060106ba245\u0060 feat: track LLMNR response time (#552); \u0060fef9b3ca\u0060 feat(dns): attribute connections to hostnames via observed DNS respon\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a2b234a2c81b84c48c3643794e1a0cba49e83ae9ee1ebb843d8a94a73687af"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: details.rs \u2194 help.rs: \u0060src/ui/tabs/details.rs\u0060 and \u0060src/ui/tabs/help.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00609278d367\u0060 fix: navigate connections with the Details mouse wheel (#621); \u0060786c660a\u0060 fix: correct TCP window and duplicate-ACK reporting (#589); \u0060fef9b3ca\u0060 feat(dns): attribute connections to hostnames via observed DNS respon\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/details.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d9a37958a5066909e45d0b810589f74d11abd8099b2a43c66a955b0c30e815"}},{"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":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.block_network \u0026\u0026 allow_dns_resolution\u0060 appears character-identically in 2 files \u2014 crates/rustnet-sandbox/src/linux/landlock.rs, crates/rustnet-sandbox/src/macos/seatbelt.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/rustnet-sandbox/src/linux/landlock.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee3e2499fd81de3956c85ae659ba3921eb0c80610a42250b5b8a60e9083546"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060protocol == Protocol::Udp \u0026\u0026 local_addr.port() == 0\u0060 appears character-identically in 2 files \u2014 crates/rustnet-host/src/linux/process.rs, crates/rustnet-host/src/sockstat.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/rustnet-host/src/linux/process.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bce57f9b9b5536a4d7a871eabb0ed5c125c9865b858e3bd689bf72cf2696458"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sweep_stale\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/neighbors.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb7922f23be218abb5e5026be00a76e089af5a84be99781ce12f2e1a4342851"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060blob.contains(\u0022-eacces\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060blob.contains(\u0022-eacces\u0022)\u0060 also satisfies \u0060blob.contains(\u0022eacces\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/rustnet-host/src/linux/ebpf/loader.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"024fe9bf2d2acb5a1a6ec4bdad5bd65fafcb1e47b67ccbeb9439bad677b2afce"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_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-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"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":42,"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."]}]}