{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"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"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-1059"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"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":"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":"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::ui::tabs::details::draw_connection_details (cyclomatic 94): rustnet_monitor::ui::tabs::details::draw_connection_details has cyclomatic complexity 94 (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":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1fe02fd456e2ad9b54447a26e28b4e1462cdec1b45c0ebe638107d2c134ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::tui::run (cyclomatic 70): rustnet_monitor::tui::run has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88643f2b1536c81bfe3b85820324a94a1f8a77dce0c12b71c7d9c7e0d73c4b0"}},{"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":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"040b7d487483ea1dbfda2279243de904deec4314f07877a8d34e7ee7c4af4562"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::bootstrap::run (cyclomatic 44): rustnet_monitor::bootstrap::run has cyclomatic complexity 44 (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":"App::run_process_enrichment (cyclomatic 42): App::run_process_enrichment has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/enrichment.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"318c1d5138b1622d50716a56261becd43d85877127b7d4b880f5cd79eb6dfb49"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_udp_packet (cyclomatic 38): rustnet_core::network::dpi::analyze_udp_packet has cyclomatic complexity 38 (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":189}}}],"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":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c4a197033c8ea2347fd95587c02df6a7b2425e99f8337c3b83c1decb7cfcc"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::status_bar::view_hints (cyclomatic 36): rustnet_monitor::ui::widgets::status_bar::view_hints 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":"src/ui/widgets/status_bar.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"998a86596469286d5b22e775a6f1325f191c801f98f6c722767838aa315d0871"}},{"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":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed46ddd16384d96fbec3b594e71a0fc904d4962ccc51197a0e03c36718c236a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::overview::draw_stats_panel (cyclomatic 33): rustnet_monitor::ui::tabs::overview::draw_stats_panel has cyclomatic complexity 33 (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":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"880c9c9c3b0a028b2f79dba2ad05531848e3f8520b7d9ffe9ec41edec1abdcd1"}},{"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":"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_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cyclomatic 28): rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"936e1390bb53aa8ea25f6bcfb2b724b6de48e6fe123ed2fd8241263bc621e0c2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_tcp_packet (cyclomatic 27): rustnet_core::network::dpi::analyze_tcp_packet has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be7ca10ebb94e1fcf066cd1ae32232a26845086476f2847b972b022c20bf5fa"}},{"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::merge::analyze_tcp_segment (cyclomatic 26): rustnet_core::network::merge::analyze_tcp_segment 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/merge.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2e6a20e811d8d402ebb2bdfd5630a0f577045e3e2d63df82fc6a06c887fa6f"}},{"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":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89b85a7e03ca3b7ff90e324308894af034ca0c0382f37c79c172f7c177455ce"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_core::network::merge::merge_quic_info (cyclomatic 25): rustnet_core::network::merge::merge_quic_info has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/merge.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee9b4edd8343e343e55126d0bc79a066b1e6e881a9b9e0f082f1bf988fdda1"}},{"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":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77533f6b86806e7b5691227686f3a7795629c445b5470c5dd0cece08f830ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_sandbox::linux::landlock::apply_landlock (cyclomatic 24): rustnet_sandbox::linux::landlock::apply_landlock 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-sandbox/src/linux/landlock.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5ca25d60abd8aae1690030ae3e575e43ade08d9b7474fc522ca2ac3cfcc2fd"}},{"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":"MacOSProcessLookup::parse_lsof_output (cyclomatic 23): MacOSProcessLookup::parse_lsof_output has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/macos/process.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1ea1c3149dd7dc214aab9c77a2f983fecca809e7bd27ae501448c9f5d255ee"}},{"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":"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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80f58f7e8f7da56624048410136d3c740cf47ab878d17ff74d108d6ad9b3112"}},{"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":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1116ac5bd7ace09f328253a5ec1d7a98e4fa880973b86b83cd0958626961d4"}},{"ruleId":"D1","level":"warning","message":{"text":"App::start_packet_processor (cyclomatic 18): App::start_packet_processor has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b7c887320d2112cedf2520306261914d8a002ac752f02be2bd649079d0ebe"}},{"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":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7c79227f6c0c5df8dfd8eb928c68e9cc86f3c5ab54877d58cef8666f7d622d"}},{"ruleId":"D1","level":"warning","message":{"text":"DnsAnalyticsTracker::snapshot (cyclomatic 17): DnsAnalyticsTracker::snapshot 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":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44a2852482953e53a57606d22220716459f99a2b70c25c1de32d25808177156"}},{"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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e64bc126f9c6add76ae89d474b7dfce9f244e7f4ffd1cf58918a48c84b26f2"}},{"ruleId":"D1","level":"warning","message":{"text":"rustnet_monitor::ui::draw (cyclomatic 17): rustnet_monitor::ui::draw has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b120df3e067c550172e0a1eda2ecfab915cd9c6dae9e334f351d16bb685f32"}},{"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::merge::apply_packet (cyclomatic 16): rustnet_core::network::merge::apply_packet 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/merge.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27913df30f4d7dd5d593739f44b9d6aaf37770decf2cdcaf8e060b5011c460"}},{"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":"D1","level":"warning","message":{"text":"pcap_enrich.create_pcapng (cyclomatic 16): pcap_enrich.create_pcapng 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":"scripts/pcap_enrich.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d726c9311fc37906783329d574d54db95154dfec5c496b534313c3ca1bc30125"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::tui::run (cognitive 204): rustnet_monitor::tui::run has cognitive complexity 204 (threshold 15). Drivers by points: if/else 47 (158 pts), match/switch 5 (27 pts), loops 3 (11 pts), boolean chains 8 (nesting depth added 141). 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":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"76faa784b1e280cdafc0be300111f8d4429c246016e3a5ef8ca899f652b98afd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::details::draw_connection_details (cognitive 125): rustnet_monitor::ui::tabs::details::draw_connection_details has cognitive complexity 125 (threshold 15). Drivers by points: if/else 76 (92 pts), match/switch 12 (23 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 28). 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":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa8a8817e53cc31ac8efc722fa91d3680b679f59aa944ecc17d586128e37fec"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_process_enrichment (cognitive 101): App::run_process_enrichment has cognitive complexity 101 (threshold 15). Drivers by points: if/else 31 (89 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into 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":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b576848c893b7b006f5cf9f6381d01196ded12a06da6373a4bbf3c9d5079442"}},{"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":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"639009a9970fed10dce6693d262dff473509e9a920e926e8cdeb9f7f2879c42d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::status_bar::view_hints (cognitive 60): rustnet_monitor::ui::widgets::status_bar::view_hints has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (48 pts), boolean chains 6, 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":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff6d08cba312698dfc85e79a0418fb3c4140a3b566375f81c6ac3970a407193"}},{"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":454}}}],"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":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86d5401d9c7782ba90c78ae7075dc9cf75369f2f4fe017bacc83d4cdf29bf47"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cognitive 57): rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 4 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/quic/salvage.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44b3131d836a0c27c844371ebac82692f5ba5ea1b18d11a1d74ad844fc9cd4a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::bootstrap::run (cognitive 55): rustnet_monitor::bootstrap::run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 32 (41 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::merge::analyze_tcp_segment (cognitive 53): rustnet_core::network::merge::analyze_tcp_segment has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (43 pts), match/switch 2 (6 pts), boolean chains 4 (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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a969d01635898cadfdc1a7b95ec4e55c31d5da9291ad5b46e9773a05658e2464"}},{"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":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28a8c7e47f830694680cf0d40084652a45314b7303a688b9a275a238053719"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::merge::merge_quic_info (cognitive 49): rustnet_core::network::merge::merge_quic_info has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 4 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 26). 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/merge.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3eef5fc204ae13db159cbb655bef6922d417db41a118e497a9ed2182bd954a"}},{"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_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":"MacOSProcessLookup::parse_lsof_output (cognitive 43): MacOSProcessLookup::parse_lsof_output has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 4 (10 pts), boolean chains 6, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/macos/process.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af7a4fcd9ebac67f713fcf4e0f57bd60cec2a5d40e7b5b1497d732224092211"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::tabs::overview::draw_stats_panel (cognitive 42): rustnet_monitor::ui::tabs::overview::draw_stats_panel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 41, 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":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"5445a9e8b36fc2dd010c6f68c185006d5565dc1b7d2833fe3f403206b28237e1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_udp_packet (cognitive 39): rustnet_core::network::dpi::analyze_udp_packet has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 21, 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":189}}}],"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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a23567233cdc879b333f25d050d6cbf9796d9b12720360f05e867a0641b87"}},{"ruleId":"D2","level":"warning","message":{"text":"App::start_packet_processor (cognitive 35): App::start_packet_processor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (10 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"102836fb7002f2a6dff2dff8aad41bfa7423953fc8a22cded92f3644f4d589eb"}},{"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":"pcap_enrich.create_pcapng (cognitive 30): pcap_enrich.create_pcapng has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (4 pts), boolean chains 1, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pcap_enrich.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8750e08d3347d6931e6251f8a2c11cad8ac4375b251263ba52b78e1985e986af"}},{"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":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca6c846816445bfd9b67dfd2ddffa711a82bc30850d8f9e1c3c7ff0f2b0521b"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsAnalyticsTracker::snapshot (cognitive 28): DnsAnalyticsTracker::snapshot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dns_analytics.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada34489c9f9e4cc1090a891efcd24428f37ab926f616802fa5c290658375cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::analyze_tcp_packet (cognitive 28): rustnet_core::network::dpi::analyze_tcp_packet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15, boolean chains 13. 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":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d150718b61348c2b7cd5bc015c3e74c24f0ebb8b79b7c81d779e9a4318ceae8"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_sandbox::linux::landlock::apply_landlock (cognitive 28): rustnet_sandbox::linux::landlock::apply_landlock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6, boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-sandbox/src/linux/landlock.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"03630a8d0db6ae7a8e31c963f17a47b6fe94c52372617453b25f2d0e20fbb465"}},{"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":526}}}],"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_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":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8b0e50fe92042bae5c2dced1c149bd88fd52b6b93925b93992e55bed2274e"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::merge::apply_packet (cognitive 24): rustnet_core::network::merge::apply_packet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/merge.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"224fd886ac4a2f4192a5e77e463ba4704dd7d3a111e31b2f6c7543af8dd8c910"}},{"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_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":540}}}],"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":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dbde6f42c8b4dc9046ddf84813d8c4f1ec47e73704ca4ae907c38c50321e25"}},{"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::dpi::quic::packet::merge_quic_packet_info (cognitive 22): rustnet_core::network::dpi::quic::packet::merge_quic_packet_info has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/quic/packet.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"584de2cce7031155d77340f03e6fcc9c941c4ee207948ce7071c5764cdef14bd"}},{"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":"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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8fe2529b5d378c0ed33b63478de1b33514fc96a8e94ba91b3ae0afb80886d0"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::ui::widgets::tabs_bar::draw_tabs (cognitive 21): rustnet_monitor::ui::widgets::tabs_bar::draw_tabs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets/tabs_bar.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b9534c6f5316bae744bc2e71dee557c506acea7f5560a222d0f57069609d04"}},{"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":"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::dns::parse_question (cognitive 19): rustnet_core::network::dpi::dns::parse_question has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/dns.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b5f23ccc2dc12707f0538c2f75ba3e2991d9fe5f3fbb6d404141687597fd4b"}},{"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":"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":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da9e520dac5aeee5f34650e12ab198ef17ac68adfb6ca4c66105dc6d3600e2c"}},{"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":"App::start_snapshot_provider (cognitive 18): App::start_snapshot_provider has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 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/app/sampling.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"16db7ba72793937917ec5c2c5dd3dd6b28a2318e38e4f7bd1f7d030bcbfe36b6"}},{"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":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e6e15a9ae63d75607c1a28381316e0b379a911dcab7784994ea2ff43b60090"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_core::network::dpi::quic::tls::try_extract_tls_from_reassembler (cognitive 17): rustnet_core::network::dpi::quic::tls::try_extract_tls_from_reassembler has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/dpi/quic/tls.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b880b04ea642be3eda9c42680c97191370157c4e133278a49e4e0c95c5d29e4e"}},{"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":"rustnet_monitor::ui::widgets::braille_graph::render (cognitive 17): rustnet_monitor::ui::widgets::braille_graph::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/widgets/braille_graph.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9e5e16951312ca9e542bdee8f5c614bd1dfe85d6e470c609aa64dcd73bf3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"pcap_enrich.find_matching_connection (cognitive 17): pcap_enrich.find_matching_connection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pcap_enrich.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a021acba7444de14455f917547cee022887c9c63489b23eb9d85a2161041020b"}},{"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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"56358d572ed86bbba5f12638e75255e8457997f318a523c37a53f550f3f0b1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"LinuxProcessLookup::parse_and_map_content (cognitive 16): LinuxProcessLookup::parse_and_map_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-host/src/linux/process.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeff8c48d6d56410b24077a8da4b38c9466f46efc90b4172aa8188e838e54a0"}},{"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":245}}}],"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":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca20c697a357d581564fe0aab4d3acbadc67db905046252f8c04bc404db87b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustnet_monitor::app::logging::log_connection_event (cognitive 16): rustnet_monitor::app::logging::log_connection_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 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":"src/app/logging.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aecf021f5382b5a9dd5d6350d3c1b3d469d3a8be414f7882a25db6323f7eca3"}},{"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":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ce09a1c126c0f17d6fae4d3a47a24ecdc924459fc85d6363d803516668f5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"pcap_enrich.load_connections (cognitive 16): pcap_enrich.load_connections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pcap_enrich.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedda19e4dd364e127ed18b68939ac41a1854c532146fd74cc46d2837d2f2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"pcap_enrich.print_table (cognitive 16): pcap_enrich.print_table has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/pcap_enrich.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7937d89426c580fe61efbfef064f95d5d5c2bb6d2ec1912f4e5bf688e1e1ec81"}},{"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 838 significant 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 738 over it, 8.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/details.rs"},"region":{"startLine":1013}}}],"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 327 significant 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 227 over it, 3.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/overview.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"160baaa51469628283ca4d363f180b3544de2d787f45b9b180891fa456e10e40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/details.rs: FileTooLong \u2014 1418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 918 over it, 2.84\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::tui::run: FunctionTooLong \u2014 rustnet_monitor::tui::run runs 250 significant 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 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui.rs"},"region":{"startLine":12}}}],"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/overview.rs: FileTooLong \u2014 1097 significant 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 597 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/overview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af23227641b5e35176d08afee41d8eb92efa0031a38a684b6eebc7cb05cc02e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rustnet_monitor::bootstrap::run: FunctionTooLong \u2014 rustnet_monitor::bootstrap::run runs 205 significant 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 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee64917d6cd5f7f34b2a13ee34aa92275bfb6cc38a4920c228f1108960656a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 59 methods, declared across 5 files: app/state.rs (43), app/capture.rs (6), app/sampling.rs (5), app/enrichment.rs (4), \u002B1 more file(s). The bar is 30 methods; this is 29 over it, 1.97\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":"FunctionTooLong: rustnet_monitor::cli::build_cli: FunctionTooLong \u2014 rustnet_monitor::cli::build_cli runs 189 significant 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 89 over it, 1.89\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":"FileTooLong: types/protocol_info.rs: FileTooLong \u2014 903 significant 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 403 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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":"TooManyFields: UiState: TooManyFields \u2014 50 stored fields beside 40 methods. The bar is 30 stored fields; this is 20 over it, 1.67\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":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e44cd3995a2e4361e97392168b0a34f00793f84a89c23508a46c77c64ba1054"}},{"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":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"be83dedf4dfdb8ab04fd0458fbc725cfefc68b7c8941a24d22c29d82d481e690"}},{"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 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/activity.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2baa83cb437c42ae1fac71dfd3d3ff124865b1b81373a49aa7246c62019692c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/state.rs: FileTooLong \u2014 767 significant 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 267 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6cd5881f0612e76855159a23d36c47d22b224ca355188f50bfae651f8fd8d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/capture.rs: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 250 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfcba582841b70c9cc6701b5a4ded06961da26c37a720980493d46a97c567d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Connection: TooManyFields \u2014 44 stored fields beside 19 methods. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/types/connection.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ea4bd19b9ca5b74bac6ab11a4c8748c977e339bccf38059ff823be0c5eb655"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run_process_enrichment: MethodTooLong \u2014 run_process_enrichment runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/enrichment.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d859d48ddd7247d0f216c9be31f2e658455edb90e431412f34c6b86fd59137c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.start_packet_processor: MethodTooLong \u2014 start_packet_processor runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/capture.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"91512e673795b0e7dc29bd106744d9bc36b16b65e9a677c835c8eb1d4d0c0583"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UiState: TooManyMethods \u2014 40 methods, declared across 2 files: ui/state.rs (38), ui/sections.rs (2). The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/state.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c066a5ae0e5af0e88e9744f079ff5e6ccf0f619afa1fbc1a6c4c54690cafdca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/tracker.rs: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: ConnectionTracker (3 blocks, 345-1188). The bar is 500 significant lines; this is 148 over it, 1.30\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":"MethodTooLong: ConnectionSnapshot.from_connection: MethodTooLong \u2014 from_connection 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/headless/schema.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de5f44c72602f88a346199d7e6a5d25f86c0cd213429d15cc1262aaf4e3b3c4"}},{"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":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c07a265e3c0246cd09ee801a6e2f985f75f6b8df701471c2602c8b3c616b09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tabs/activity.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ui/tabs/activity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55774533e8a175978a716bbdaef908a09f4df7d965ce3775d84b758017a8cd0a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConnectionTracker: ClassTooLong \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 3 blocks, lines 345-1188. The bar is 400 significant lines; this is 94 over it, 1.24\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":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984f7d39eac0bbf988ab8a93ab0705ae4a5eab3e1bff68b828607d6baf22afe"}},{"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":"ClassTooLong: App: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 3 blocks, lines 68-1081. The bar is 400 significant lines; this is 80 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/state.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1d53a9858fe46d828e33e74971bd371daa68ff4299514187c8b7687bfa5f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/process_activity.rs: FileTooLong \u2014 590 significant 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 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/process_activity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a6ddb9e7c1017cae8d2dcccead4f72420fe4b9a0d1e9803d9c979f3c4e7b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 35 stored fields beside 59 methods. The bar is 30 stored fields; this is 5 over it, 1.17\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":"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":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d2639e75e5f0d4b39f6e16ac2281fa33cca11a376b38c3c14013c5fc2fbe7b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectionTracker: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rustnet-core/src/network/tracker.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0085d7e1548080fa3d88a12ea956b65b9c4e035b52eef9e555c9058e665a57f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/state.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: App (3 blocks, 68-1081). The bar is 500 significant lines; this is 62 over it, 1.12\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":"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: network/merge.rs: FileTooLong \u2014 529 significant 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 29 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-core/src/network/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8011a742e7778b7eef2a922a0c4813d940f4cf1cc68f2bf954ba64b40ca90904"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/process.rs: FileTooLong \u2014 529 significant 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 29 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":"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":"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."},"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:69-78 | crates/rustnet-host/src/freebsd/process.rs:96-105 \u2014 both copies are in the same file, so extract the block 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":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f62f7d5225c520adc0dfcaa9129c2215758d9785d443148313b0dafc849690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rustnet-core/src/network/parser.rs:814-821 | crates/rustnet-core/src/network/parser.rs:836-844 \u2014 both copies are in the same file, so extract the block 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-core/src/network/parser.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fb5dd3f3087510e863320d62208cc8b12a61fd651e85de6dea1f8d1a04d23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rustnet-core/src/network/tracker.rs:582-588 | crates/rustnet-core/src/network/tracker.rs:596-602 \u2014 both copies are in the same file, so extract the block 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-core/src/network/tracker.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dca7ea7d61ef222d23a73c77f3855d4165ba387df31b7bcb35d050e9db28b08"}},{"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."},"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 (7 lines \u00D7 2): src/ui/tabs/graph.rs:614-620 | src/ui/tabs/graph.rs:621-627 \u2014 both copies are in the same file, so extract the block 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/graph.rs"},"region":{"startLine":614}}}],"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.02, instability 0.00, distance 0.98 \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":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 names a data collector that ships in the \u0060coverlet.collector\u0060 package, and this repository wires up none \u2014 no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, \u0060--collect\u0060 produces nothing even from a suite that builds and passes. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/tabs/details.rs: src/ui/tabs/details.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in rustnet_monitor::ui::tabs::details::draw_connection_details at line 1013. 9 of those changes were fix/bug commits, and the other 34 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae82cacfd3389b7bcca76e54d653c1f8ab418165dce4605476ad51e721c7aa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/mod.rs: src/ui/mod.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustnet_monitor::ui::draw at line 302. 6 of those changes were fix/bug commits, and the other 41 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"051216c46a873255132aac6d31cd7b99dd60ffa3ab6ac5d60c2df2950c45ec56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/tabs/overview.rs: src/ui/tabs/overview.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in rustnet_monitor::ui::tabs::overview::draw_stats_panel at line 895. 3 of those changes were fix/bug commits, and the other 18 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e15784a22b1b0e42ef5af684d6579c29ba546a23bb65f0a4a5641990083f348"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/tracker.rs: crates/rustnet-core/src/network/tracker.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ConnectionTracker::measure_timings at line 526. 5 of those changes were fix/bug commits, and the other 19 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f31c2fbc90a550004264c7c119c0c35a58bccdc100f766f41a8577e8295847f"}},{"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 454. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"365d3ec007131f00df9701683f3fc96b9a0d6c24d5ffaff63a9bcc4e2fadac86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/merge.rs: crates/rustnet-core/src/network/merge.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rustnet_core::network::merge::analyze_tcp_segment at line 116. 5 of those changes were fix/bug commits, and the other 14 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c787ebae55d42fb64c1c0d66ab71b5bd84c95983aaf47f290a236c46ef05c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/widgets/status_bar.rs: src/ui/widgets/status_bar.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rustnet_monitor::ui::widgets::status_bar::view_hints at line 105. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e8443d1e02e681aa42b4369f6f5ed38113b4ea3622befeb6154b2afbdee9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/ui/connection_table.rs: src/ui/connection_table.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustnet_monitor::ui::connection_table::select_columns at line 143. 3 of those changes were fix/bug commits, and the other 17 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02:00\u0027 --full-history --no-merges -- src/ui/connection_table.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/connection_table.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eb71d7dc5450d9518d7fe85d162cbaf4ff8719e63fc449c242c8899c53b681"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/capture.rs: src/app/capture.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in App::start_capture_thread at line 589. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc1fb25e341cfb29ca11cd919915aff09837634549d7ffa00ad0fdaa2f25990"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/enrichment.rs: src/app/enrichment.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in App::run_process_enrichment at line 160. 1 of those changes was a fix/bug commit, and the other 6 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"55868e1f8106789e7d0498f7deb644d956eaf9b888989951b886056ef776e163"}},{"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 8 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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: src/ui/tabs/activity.rs: src/ui/tabs/activity.rs changed 8 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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/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 38 in rustnet_core::network::dpi::analyze_udp_packet at line 189. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aced018f13be7607041857ed212f236d007e42daa5910252ccbfc1798c29d41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-host/src/macos/process.rs: crates/rustnet-host/src/macos/process.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MacOSProcessLookup::parse_lsof_output at line 178. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02:00\u0027 --full-history --no-merges -- crates/rustnet-host/src/macos/process.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/macos/process.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476a5ba8c388c02baf9890e2758454ad8193cd048fc16a0e33971ccfc73e49b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-sandbox/src/linux/mod.rs: crates/rustnet-sandbox/src/linux/mod.rs changed 5 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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: crates/rustnet-sandbox/src/linux/landlock.rs: crates/rustnet-sandbox/src/linux/landlock.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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: src/tui.rs: src/tui.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in rustnet_monitor::tui::run at line 12. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4124a266281f66b34232f1a583ee83deb514b4f39cf55955a2ae15c75999f3"}},{"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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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: crates/rustnet-capture/src/lib.rs: crates/rustnet-capture/src/lib.rs changed 5 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 408. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff536bf254c9c5d6cbeeec207072b768170e0cdcd69a202111bd75332c2ae93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/filter.rs: crates/rustnet-core/src/network/filter.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ConnectionFilter::matches at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4f7cc4502d6ed4bf1dfa14d58bf28b522a415ac6892705753ec4bc59fcc775"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rustnet-core/src/network/dpi/mqtt.rs: crates/rustnet-core/src/network/dpi/mqtt.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rustnet_core::network::dpi::mqtt::analyze_mqtt at line 54. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02:00\u0027 --full-history --no-merges -- crates/rustnet-core/src/network/dpi/mqtt.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/mqtt.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7541969442466a6a270e4244f32e4eaef547f67f1eb762346c7dd9ab23ea6e0"}},{"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 21 in rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames at line 11. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 11:31:04 \u002B02:00\u0027 --until=\u00272026-09-28 11:31:04 \u002B02: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":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d4eb0e49689777b9c4390fb0aa9f008e1fdee9382b87f894d9eefa3ca8ad62"}},{"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":188}}}],"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant packet parsing/consumption operations. \u0060PacketReader\u0060 appears to be a high-level stream consumer that yields packets, while \u0060PacketParser\u0060 is a stateful parser that transforms raw bytes into \u0060ParsedPacket\u0060. However, \u0060PacketReader\u0060 likely wraps or uses a parser internally. The existence of both \u0060next_packet\u0060 (streaming) and explicit \u0060parse_packet\u0060 (stateless/stateful transformation) creates confusion about whether the user should use the Reader for consumption or the Parser for transformation. Furthermore, \u0060parse_packet_with_refresh\u0060 and \u0060parse_packet\u0060 differ only by an internal side-effect (refreshing IPs), which is an implementation detail leaking into the API surface.: Unify the parsing logic. If \u0060PacketReader\u0060 is the primary consumer, it should handle parsing internally and expose \u0060ParsedPacket\u0060. If \u0060PacketParser\u0060 is a reusable utility, remove \u0060PacketReader\u0060 or make it a simple wrapper that delegates to \u0060PacketParser\u0060. Remove \u0060parse_packet_with_refresh\u0060 and expose the refresh logic as a separate method on the parser or a configuration option, rather than a separate method signature. (signatures: PacketReader.next_packet(): Result | PacketParser.parse_packet(data: \u0026[u8]): ParsedPacket | PacketParser.parse_packet_with_refresh(data: \u0026[u8]): ParsedPacket)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1e8011f07d71544eefbfdef8b497e0340fce732b24d92cedec15ef09c3a58d94"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming for drop metrics. \u0060capture_drops\u0060 and \u0060interface_drops\u0060 are specific, but \u0060total_dropped\u0060 is ambiguous. Does it sum the previous two? Or is it a different metric? The naming convention shifts from specific source (\u0060capture\u0060, \u0060interface\u0060) to a generic aggregate (\u0060total\u0060), which is inconsistent with the other two methods. Additionally, \u0060total_dropped\u0060 sounds like a property or a sum, whereas the others are specific counters.: Rename \u0060total_dropped\u0060 to \u0060total_drops\u0060 to match the plural noun convention of \u0060capture_drops\u0060 and \u0060interface_drops\u0060, or rename all three to \u0060capture_drop_count\u0060, \u0060interface_drop_count\u0060, and \u0060total_drop_count\u0060 for explicit clarity. (signatures: CaptureStats.capture_drops(): u32 | CaptureStats.interface_drops(): u32 | CaptureStats.total_dropped(): u32)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"950dcdc296b26ef48dd04eb59f903311a09deaa32cdcf5b468c7988be5ea3bef"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant availability checking. \u0060is_available()\u0060 likely checks if the resolver is initialized and has data. \u0060get_status()\u0060 returns a tuple of three booleans, which likely includes availability plus other states (e.g., DB loaded, cache ready). However, exposing a raw tuple \u0060(bool, bool, bool)\u0060 is poor API design compared to a typed struct or enum, and it overlaps with the simple \u0060is_available()\u0060 check. Users calling \u0060is_available()\u0060 might not need the full status, but the existence of both suggests unclear responsibility for state reporting.: Remove \u0060is_available()\u0060 if \u0060get_status()\u0060 is the canonical way to check state, or refactor \u0060get_status()\u0060 to return a typed struct (e.g., \u0060GeoIpStatus\u0060) with named fields. If \u0060is_available()\u0060 is a common convenience, keep it but ensure it doesn\u0027t duplicate the logic of \u0060get_status()\u0060 in a confusing way. Ideally, \u0060get_status\u0060 should replace \u0060is_available\u0060. (signatures: GeoIpResolver.get_status(): (bool, bool, bool) | GeoIpResolver.is_available(): bool)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"972bfd29a15fbd7f8603ab3fa566143a705d3f5373b73068db65ae75a16018ed"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent builder pattern naming. \u0060with_defaults\u0060 and \u0060with_defaults_deferred\u0060 suggest a builder pattern, but \u0060try_with_defaults\u0060 returns a \u0060Result\u0060 and likely constructs the resolver directly. This mixes builder-style fluent methods with constructor-style methods. \u0060with_defaults_deferred\u0060 is also a confusing name; it\u0027s unclear what \u0027deferred\u0027 means in this context (lazy initialization? async?).: Standardize on a single construction pattern. If using a builder, all variants should be builder methods returning \u0060Self\u0060. If using constructors, use \u0060new()\u0060, \u0060new_with_defaults()\u0060, etc. Clarify the meaning of \u0027deferred\u0027 or rename it to something more descriptive like \u0060with_lazy_init\u0060. (signatures: DnsResolver.with_defaults(): Self | DnsResolver.with_defaults_deferred(): Self | DnsResolver.try_with_defaults(): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c5482ae21d136e2a496094f0645dadb41332c28dea72b8d6b0d2dcb3ac9e2b79"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 5 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is \u0060crates/rustnet-core\u0060 (27437 LoC, 174 public types across 7 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":"5a920d0f6d7c6c1284a4b4859744dc2f97c9b9b491504f4175bad38481d80e3f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"68bf7b54a0178c5b6c9126ab1eaf0fa5c64805e7c2aa961385f37a1fa530106d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"db83315b517c9b858881666732f41315e45bb383c9c94e29722eb3c79f97332c"},"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"d4981f68fe540436477e77168973db3f13f5b14a8c729c2d03f0e7de924535c0"},"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"}}]},{"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":"317467ed0208af9badb8f573b42af69b856cdfc1c4a6347a5e819e0ea5431cc7"},"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"}}]},{"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":"3a11b1595f10ab9a3c80fae3454b2b6439b849642ea8b83b4e7cc6a14d399958"}},{"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":"780c2c5412c88060d62617842b503653fb09986059297eaff2bac7b4709d242c"},"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"}}]},{"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":"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"}},{"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"}},{"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"}},{"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"}},{"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":"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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"CWE-532","shortDescription":{"text":"CWE-532"},"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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":41,"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."]}]}