{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"Connection::send_single (cyclomatic 180): Connection::send_single has cyclomatic complexity 180 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4275116f0051822adae2c38286b06b4887ef4ffc6834c606caa18499d017ea00"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::recv_single (cyclomatic 83): Connection::recv_single has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d09e8ff450f94b23a8f07c581bdf4f50897af62acb6d87e38b7244d68e41df"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::process_frame (cyclomatic 80): Connection::process_frame has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":8343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc0510245552f9096b457d56b193d98b664c3f743d36b3181b7c3260575d714"}},{"ruleId":"D1","level":"warning","message":{"text":"quiche_apps::client::connect (cyclomatic 72): quiche_apps::client::connect has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2640a7fe5c6ff19152cbeda647518a160b206e07bd7af887b315a3ba8adf7a7"}},{"ruleId":"D1","level":"warning","message":{"text":"quiche_apps::bin::quiche-server::main (cyclomatic 65): quiche_apps::bin::quiche-server::main has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/bin/quiche-server.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c85e22c96da20c7010b86db3e959f7e78c0d95b0c3cab12051b5742c2d750d"}},{"ruleId":"D1","level":"warning","message":{"text":"http3_test::runner::run (cyclomatic 55): http3_test::runner::run has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/http3_test/src/runner.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa399a9ec8cfcc0a8535f2c3090a6bc0498167b33a50e8d66df6a2e4a9bb7c5"}},{"ruleId":"D1","level":"warning","message":{"text":"h3i::client::sync_client::connect_with_early_data (cyclomatic 46): h3i::client::sync_client::connect_with_early_data has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/client/sync_client.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"494551c463c74192acf367e13c39b55c10c655d534ab9bc152e1511e209f55b3"}},{"ruleId":"D1","level":"warning","message":{"text":"Frame::from_bytes (cyclomatic 42): Frame::from_bytes has cyclomatic complexity 42 (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":"quiche/src/frame.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"00563373156a7bec97b399623bb0aa644ed57526a3bbc4b633af748b6be20157"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::process_readable_stream (cyclomatic 42): Connection::process_readable_stream 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":"quiche/src/h3/mod.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4274f6cf4970fdbe771a0419aacddf595393e2f5420d6de9f9c86f42bb34a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Datastore::consume_netlog_h2 (cyclomatic 33): Datastore::consume_netlog_h2 has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83a1617c36984f2642d5d01527213cc6cd9aea904fb6b4c581386e2f97bdbcc"}},{"ruleId":"D1","level":"warning","message":{"text":"TransportParams::decode (cyclomatic 33): TransportParams::decode has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/transport_params.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1bb7fafc859d0a0cb64f628fa829e9f6b9b1f7cf41d3891fe07be27961f272"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::process_frame (cyclomatic 32): Connection::process_frame 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":"quiche/src/h3/mod.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7e6c1496889d28083a11f6e190c06bed0e6fb88a6729d30831c5e0c941a497"}},{"ruleId":"D1","level":"warning","message":{"text":"Http3Conn::build_h3_response (cyclomatic 31): Http3Conn::build_h3_response 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":"apps/src/common.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fb28bb72657eb36f495d966ff3cc09f2d091b5d11cbf0ac7e24e467adca430"}},{"ruleId":"D1","level":"warning","message":{"text":"Frame::to_bytes (cyclomatic 31): Frame::to_bytes 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":"quiche/src/frame.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0fb98e3df6a8364f1cf56bdca3a1fd997a10ce8f399d489665bd720b2d8db9"}},{"ruleId":"D1","level":"warning","message":{"text":"Datastore::consume_netlog_quic (cyclomatic 30): Datastore::consume_netlog_quic has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4c743dca6a0f7dc5f942b89fbd685bea990f88c7f1323b5905462eb77c5b20"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::stream_do_send (cyclomatic 30): Connection::stream_do_send has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":6007}}}],"partialFingerprints":{"codehealthFindingId/v1":"02506531d01fafde2daad2797a5c16d4723cab3922171a0fb3c7c01efd7d6052"}},{"ruleId":"D1","level":"warning","message":{"text":"Params::with_overrides (cyclomatic 29): Params::with_overrides has cyclomatic complexity 29 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaccb81d479e2a29b0e442344fee48a829bceb04bf9cca2ec3bb7e87e4bb7105"}},{"ruleId":"D1","level":"warning","message":{"text":"RecvBuf::write (cyclomatic 29): RecvBuf::write has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/stream/recv_buf.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"121224bfcad6c22b1da7cc8c5f62629be8630aede07f39fcfb6f375d941b5f82"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog_dancer::reports::events::frames_to_string (cyclomatic 28): qlog_dancer::reports::events::frames_to_string has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d88abda494a6b73b01747f0bf138981ff08a517af25f18c8e6f19e4fe808b6"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog_dancer::datastore::with_netlog_reader (cyclomatic 28): qlog_dancer::datastore::with_netlog_reader 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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeb1d32486de6df42094a284d0ab612c5978b4466d8721907b2a21dd59e01b0"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing (cyclomatic 27): qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d07ad1cc0d0c2ce9e696d8ebdd2f92d742c7d3763edf1b198cb6cc56ac4ccd"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog_dancer::plots::stream_sparks::plot_sparks (cyclomatic 27): qlog_dancer::plots::stream_sparks::plot_sparks has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cc118ce37bdd7655658f0204608e05388fb51671f7245901ecc53486e61c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"Frame::to_bytes (cyclomatic 26): Frame::to_bytes 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":"quiche/src/h3/frame.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f446f7193bd54ae5bf00de7adcfcd7abcf1f9b9f5cd5a03064162d49086c919"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::send_on_path (cyclomatic 25): Connection::send_on_path 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d593d23ab16622d3e6670872b19a285d425a868efebda034d93bfeb11ace22"}},{"ruleId":"D1","level":"warning","message":{"text":"QlogMetrics::maybe_update (cyclomatic 24): QlogMetrics::maybe_update has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b831b814c0bbf510ba47221c689da439c4aefd6cdfeb0312656d8a7dffcba6ca"}},{"ruleId":"D1","level":"warning","message":{"text":"AppConfig::from_clap (cyclomatic 23): AppConfig::from_clap has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/config.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7971abd039a6fd18ea62590d523b85406d67b73d9329bcdbb06e311eba6e122e"}},{"ruleId":"D1","level":"warning","message":{"text":"IoWorker::gather_data_from_quiche_conn (cyclomatic 23): IoWorker::gather_data_from_quiche_conn 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":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe7a8cd8b4a42f47c8c4380dc07082a4e9de54579328b17edbe776b2c8ac911"}},{"ruleId":"D1","level":"warning","message":{"text":"InboundPacketRouter::poll_recv_and_rx_time (cyclomatic 22): InboundPacketRouter::poll_recv_and_rx_time has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de9d8336bc22115c61f1a6d47b0bde4a80990d16cd7dc6b8556c039a99d97eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Http3Conn::handle_requests (cyclomatic 21): Http3Conn::handle_requests has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44ac7e56d5c701ef90653bb94466f8023e2223b17a94062c6b25c89562d639c"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::write_pkt_type (cyclomatic 21): Connection::write_pkt_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":8220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce891aca4ec0dc1b642b0fc10ca04bfc9fdfbe5a524323c7b1cab3c111a965"}},{"ruleId":"D1","level":"warning","message":{"text":"TransportParams::encode (cyclomatic 21): TransportParams::encode 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":"quiche/src/transport_params.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de337fe402a93de5ed0366aacdb7e7044e947176c22b88b8825bca29bc910dc"}},{"ruleId":"D1","level":"warning","message":{"text":"H3Driver::process_h3_data (cyclomatic 21): H3Driver::process_h3_data 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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d11e100e4cc680aa626d8fd77b89e18a3cd4165a7faf1ebb97ca1216012e99"}},{"ruleId":"D1","level":"warning","message":{"text":"h3i::client::execute_action (cyclomatic 19): h3i::client::execute_action 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":"h3i/src/client/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4ccd32b9dbb3b6aed04f81128b19f9cffd8f80a89b4c4e2f630a601491cc1"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestTableDecorator::visit_element_mut (cyclomatic 19): RequestTableDecorator::visit_element_mut 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":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"186e1b277a61f69d53efd80875e2d0e5a6ac7292efc2edf2d339915a9d587059"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::poll (cyclomatic 19): Connection::poll has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Error::to_c (cyclomatic 20) 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":"quiche/src/h3/mod.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce0b70559b6ba5d0c3331c4fd8f73b433f17ee51bdb72237d7307be75ca3ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Http3Conn::handle_responses (cyclomatic 18): Http3Conn::handle_responses has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"618bcd7e06c9a1e237d2f3816d77b2afc016f64c465ec159dadf74674abba104"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameParser::try_parse_frame (cyclomatic 18): FrameParser::try_parse_frame has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/frame_parser.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedec1aaac2fd6775e3433a2a4d58bebec656666925a1f3b16c48bdc72997f5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Frame::to_qlog (cyclomatic 18): Frame::to_qlog has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/frame.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15aeaa6370bca3711b753483a79a6bbb1d464083d6697c3a23bb0a203bca244"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog_dancer::run (cyclomatic 17): qlog_dancer::run 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":"qlog-dancer/src/main.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ce1267e4a878cfbc2084dfa0f3a7cf8016c77a02d0a07b321e967a0c3b00d"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::do_send_body (cyclomatic 17): Connection::do_send_body has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Error::to_c (cyclomatic 20) 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":"quiche/src/h3/mod.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f8c42aeabcea7e1e4011f950eaa1bc52a4a8354877a7288c332dc5f065cacb"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::do_handshake (cyclomatic 17): Connection::do_handshake has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: quiche/src/lib.rs holds 7 of the 49 functions over the threshold \u2014 including the worst \u2014 and 331 of the 838 points over it (39%), 5.8\u00D7 the next-largest file (apps/src/client.rs at 57). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":8081}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eea5fda5595508d5aac5eac920dff727bfb02e2a355c8b48fae6af089c147f"}},{"ruleId":"D1","level":"warning","message":{"text":"BBRv2NetworkModel::on_congestion_event_start (cyclomatic 17): BBRv2NetworkModel::on_congestion_event_start has cyclomatic complexity 17 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa83ce9f77a46aefc1af2e14afb97661b984543169ed9947d9b76a038478bea"}},{"ruleId":"D1","level":"warning","message":{"text":"BBRv2NetworkModel::adapt_lower_bounds (cyclomatic 17): BBRv2NetworkModel::adapt_lower_bounds has cyclomatic complexity 17 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff5e3d3e42c06c548170cf901342a3ec8dde6da3a3bf60fd7e59c9744a8e2a0"}},{"ruleId":"D1","level":"warning","message":{"text":"H3Driver::process_write_frame (cyclomatic 17): H3Driver::process_write_frame 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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e521015c8891f2ddd36574b0f47dd6b92545b88a7464797b524efe3fdf2407"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog_dancer::reports::events::sqlog_event_list (cyclomatic 16): qlog_dancer::reports::events::sqlog_event_list has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e1190da46b4bfa58dff7bc887641245cc333197bdd2f7142609aac3145a94a"}},{"ruleId":"D1","level":"warning","message":{"text":"Stream::set_frame_payload_len (cyclomatic 16): Stream::set_frame_payload_len 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":"quiche/src/h3/stream.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f3fc99f740e6111272de771a84ace1f1cc0f3bf4f23106551ab1f9e169977d"}},{"ruleId":"D1","level":"warning","message":{"text":"Header::from_bytes (cyclomatic 16): Header::from_bytes has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/packet.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f25f808d91ab1b39ff16bee3a278eadf8d5be19bf0795736219ef1b030de9"}},{"ruleId":"D1","level":"warning","message":{"text":"quiche::recovery::congestion::cubic::on_packet_acked (cyclomatic 16): quiche::recovery::congestion::cubic::on_packet_acked 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":"quiche/src/recovery/congestion/cubic.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bacf4bc8d48cf6264eec024b51c7e3831eed3ef1790cff0f7e181208c1373c8"}},{"ruleId":"D1","level":"warning","message":{"text":"qlog-dancer-ui.redrawByCanvasId (cyclomatic 16): qlog-dancer-ui.redrawByCanvasId 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":"qlog-dancer/qlog-dancer-ui.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b86fb99be7635e850768ba009e9b00f8b58851d395b930c7f9756acb6a3a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::send_single (cognitive 332): Connection::send_single has cognitive complexity 332 (threshold 15). Drivers by points: if/else 114 (250 pts), boolean chains 35, match/switch 9 (24 pts), loops 12 (23 pts) (nesting depth added 162). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8826087e26dd3c3bb1d41758e534b114fa0243e6985e6e32acb0fb3ca337b78d"}},{"ruleId":"D2","level":"warning","message":{"text":"quiche_apps::bin::quiche-server::main (cognitive 199): quiche_apps::bin::quiche-server::main has cognitive complexity 199 (threshold 15). Drivers by points: if/else 46 (145 pts), match/switch 8 (26 pts), loops 9 (23 pts), boolean chains 5 (nesting depth added 131). 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":"apps/src/bin/quiche-server.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4805969f7fe118a6f15ccf81c707f555143eaa7fa2a3493db9a8d34116b3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"quiche_apps::client::connect (cognitive 156): quiche_apps::client::connect has cognitive complexity 156 (threshold 15). Drivers by points: if/else 47 (109 pts), loops 10 (22 pts), match/switch 6 (20 pts), boolean chains 5 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac3126d209efb3f0422547ce1d4fc56231c2345f5208887442c62fca693888"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::recv_single (cognitive 129): Connection::recv_single has cognitive complexity 129 (threshold 15). Drivers by points: if/else 57 (97 pts), boolean chains 14, match/switch 5 (11 pts), loops 5 (7 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"4504cbe7dfbb0aa080ecaf2387a1fdcb12c72b2b02058603069b93d7de2552d4"}},{"ruleId":"D2","level":"warning","message":{"text":"http3_test::runner::run (cognitive 114): http3_test::runner::run has cognitive complexity 114 (threshold 15). Drivers by points: if/else 25 (66 pts), match/switch 10 (31 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/http3_test/src/runner.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2500bebec1925b9d7af956b85d8c16841c4c6f676c7fc2cdcec43ca4702a23"}},{"ruleId":"D2","level":"warning","message":{"text":"h3i::client::sync_client::connect_with_early_data (cognitive 103): h3i::client::sync_client::connect_with_early_data has cognitive complexity 103 (threshold 15). Drivers by points: if/else 27 (61 pts), loops 9 (21 pts), match/switch 5 (18 pts), boolean chains 3 (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":"h3i/src/client/sync_client.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f316cd602b0ddf2db4a3a7ce5ffaaf06fdbc95ab8a139827c99502b4d60c27da"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::process_frame (cognitive 97): Connection::process_frame has cognitive complexity 97 (threshold 15). Drivers by points: if/else 34 (76 pts), boolean chains 9, loops 3 (6 pts), match/switch 5 (6 pts) (nesting depth added 46). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":8343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5cb802b647641dd9f3546ec9ac86ef7042ece17f125c894d8b247531b30661"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::datastore::with_netlog_reader (cognitive 96): qlog_dancer::datastore::with_netlog_reader has cognitive complexity 96 (threshold 15). Drivers by points: if/else 13 (66 pts), match/switch 4 (15 pts), loops 4 (13 pts), boolean chains 2 (nesting depth added 73). 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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48d90ab24e90be95673d4acf520982c0376eaff16593975c90a3fcda15df3dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::process_readable_stream (cognitive 72): Connection::process_readable_stream has cognitive complexity 72 (threshold 15). Drivers by points: if/else 13 (44 pts), match/switch 10 (24 pts), loops 2 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/mod.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3974426b838e697c5e993f2eecbadc5dd1859f7a9db0ab1d4b686e57864d40"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestTableDecorator::visit_element_mut (cognitive 56): RequestTableDecorator::visit_element_mut has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (55 pts), boolean chains 1 (nesting depth added 36). 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":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f6b1ba42d8759666a549ff91ea02de51ec66c026156198366a9dbb31fbbdc6"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::plots::stream_sparks::plot_sparks (cognitive 50): qlog_dancer::plots::stream_sparks::plot_sparks has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (41 pts), match/switch 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09ebf17594032009c79b5956570dca4eafcf564bc9caf41aee29fdfd8390dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::process_frame (cognitive 48): Connection::process_frame has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 24). 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":"quiche/src/h3/mod.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ab4d4d2d7a4c08624901c6d2f3b2bfdd24129d15611672c1bbb100b60bcd06"}},{"ruleId":"D2","level":"warning","message":{"text":"Datastore::consume_netlog_quic (cognitive 46): Datastore::consume_netlog_quic has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 3 (10 pts), match/switch 1 (nesting depth added 26). 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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde6f2b699c0d80d4d3fff5ce973214a26b2af8a4e94f128d76464d848a7c48"}},{"ruleId":"D2","level":"warning","message":{"text":"InboundPacketRouter::poll_recv_and_rx_time (cognitive 42): InboundPacketRouter::poll_recv_and_rx_time has cognitive complexity 42 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6147f655d50e492be9515ebf234dccb6932afcc6b2ac7d0249fc3022ac308"}},{"ruleId":"D2","level":"warning","message":{"text":"RecvBuf::write (cognitive 41): RecvBuf::write has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/stream/recv_buf.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e153e6bce3f7e7000d6d37dc4a4d70576e4536b084c947db3de4c0a14fbefd"}},{"ruleId":"D2","level":"warning","message":{"text":"IoWorker::gather_data_from_quiche_conn (cognitive 40): IoWorker::gather_data_from_quiche_conn has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf931bdf5a364a279d1a266ebf3b074b814408f79e9b0184532dc7e12e1c8295"}},{"ruleId":"D2","level":"warning","message":{"text":"Http3Conn::build_h3_response (cognitive 39): Http3Conn::build_h3_response has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 8 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1b447d839ec632be4cebcf763ee6228b8690e0814d112ce94accdc94fa7567"}},{"ruleId":"D2","level":"warning","message":{"text":"TransportParams::decode (cognitive 39): TransportParams::decode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (36 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/transport_params.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e748162948779e9159366b697868b285ab1f16e7ca382a6f3a6ababa1692b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"QlogMetrics::maybe_update (cognitive 38): QlogMetrics::maybe_update has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31 (37 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd01a31ed6cb1b4b0db989d08c3be66ba183743ac5da1a95d0e91e33eb2dee"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing (cognitive 37): qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 8, loops 4 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c24f953769b1614c44cca58b7627fc01c85aafe28eee171349039fa00dfa46f"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::stream_do_send (cognitive 37): Connection::stream_do_send has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 10, match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":6007}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c23a4c6a077c94b804daeac4953921f733ed227a27c86ac5a0d3f4b15fa21d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Http09Conn::handle_requests (cognitive 35): Http09Conn::handle_requests has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (7 pts), match/switch 1 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c743611ab9bf1cfe28a16d3fd7cac225d5d172b986a627f664be4840815116"}},{"ruleId":"D2","level":"warning","message":{"text":"Frame::to_bytes (cognitive 35): Frame::to_bytes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/frame.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f3defc9b89596823b506b89149b0229ac9f75ab181bfaf3e55286634dbe0ed"}},{"ruleId":"D2","level":"warning","message":{"text":"IoWorker::work_loop (cognitive 35): IoWorker::work_loop has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (9 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2f8897bb4575844895ec027aff78ac55220fdd21689ca3b7782634f18180d4"}},{"ruleId":"D2","level":"warning","message":{"text":"quiche::recovery::congestion::cubic::on_packet_acked (cognitive 34): quiche::recovery::congestion::cubic::on_packet_acked has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/cubic.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d057de450ed41e231c6ffd69f808af18ba097745204b2185eca705247579385c"}},{"ruleId":"D2","level":"warning","message":{"text":"h3i::client::execute_action (cognitive 33): h3i::client::execute_action has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (9 pts), loops 2 (6 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/client/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"425381efae2868e773f7b0ad541d2c784d0ade1d9f26e14cefd9f2226f985c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Datastore::consume_qlog_packet_received (cognitive 33): Datastore::consume_qlog_packet_received has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (9 pts), match/switch 1 (3 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ce41483992ff9c70e9dcf0b470ee87b316609f8aa5c342207c775d03c5f47d"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::run (cognitive 33): qlog_dancer::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/main.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1580c08eb12fd85fe90decef1e5a94a1dcb46a5abf850e02e6242e788a52bcf0"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::reports::text::print_packet_loss (cognitive 33): qlog_dancer::reports::text::print_packet_loss has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c40b34cc29c16eb2ee02421bb16b072723b2df7fcdc12ffd559bdc601d79f"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::send_on_path (cognitive 32): Connection::send_on_path has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 5, match/switch 3 (5 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1923ea51a0b2c69d99e52544fd3572bf9c6a4f1da7a315a130692a78c502bff3"}},{"ruleId":"D2","level":"warning","message":{"text":"Http3Conn::handle_responses (cognitive 30): Http3Conn::handle_responses has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (11 pts), loops 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74fdc91dc4d955140c112711ac913372a42b97c9952fe8d5aadbcd7b9684db8"}},{"ruleId":"D2","level":"warning","message":{"text":"H3Driver::process_h3_data (cognitive 30): H3Driver::process_h3_data has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6342514fd2b875da3011c0e516b4b2f0dea512f07b2bf2145f6f8d4873e72260"}},{"ruleId":"D2","level":"warning","message":{"text":"Datastore::consume_netlog_h2 (cognitive 29): Datastore::consume_netlog_h2 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"7878e5a723a6cbbd5ff1ce14ed3d126a629f322d8e8716afe561616a7d0d11b4"}},{"ruleId":"D2","level":"warning","message":{"text":"H2ClosureTableDecorator::visit_element_mut (cognitive 29): H2ClosureTableDecorator::visit_element_mut has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (29 pts) (nesting depth added 17). 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. This shape REPEATS in the file: one other method here (QUICClosureTableDecorator::visit_element_mut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"375000997ec6cbf8050205609afa21e8f4b160fed335540f2769c925c64275ac"}},{"ruleId":"D2","level":"warning","message":{"text":"QUICClosureTableDecorator::visit_element_mut (cognitive 29): QUICClosureTableDecorator::visit_element_mut has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (29 pts) (nesting depth added 17). 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. This shape REPEATS in the file: one other method here (H2ClosureTableDecorator::visit_element_mut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26e50d8910e2efc9ea50c6744baffd6f0e02f81e173a2b3b1efb512aa25a6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::write_pkt_type (cognitive 29): Connection::write_pkt_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":8220}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebb280769081d80818b72929ad030b0e2c5661056ca5918a38dbaa02eeb5cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Params::with_overrides (cognitive 28): Params::with_overrides has cognitive complexity 28 (threshold 15). Drivers by points: if/else 28. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8827a2b45fb3e5ed190266aa8c26093993a0f2a4c04e583fecd29846e36523c3"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryEpoch::detect_and_remove_lost_packets (cognitive 28): RecoveryEpoch::detect_and_remove_lost_packets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 18). 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":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"425dc91b55fc896d34da3132008b19d3f4aca404bcfaf914ab44787548ff8d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineRangeSet::insert (cognitive 26): InlineRangeSet::insert has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/ranges.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"97afda73893d2e32f7c2bb4554c2f201a42b5c461ab9e7532c0c42b11cbde4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Http3Conn::handle_requests (cognitive 25): Http3Conn::handle_requests has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (6 pts), loops 4 (5 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"375c4966b690b595f313c19e4e117bea25bd41e6dfe985441563a7755f487fff"}},{"ruleId":"D2","level":"warning","message":{"text":"H3Driver::process_write_frame (cognitive 25): H3Driver::process_write_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"0785b247886927c17fcab7df19a3696fe8a62a8853360ffd1a7d6439a5cc0a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"h3i::client::parse_streams (cognitive 24): h3i::client::parse_streams has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/client/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"af70dbd5ed435ad9b6c46d65c48f6272db9da6cedbaafa09de53fc42e4660e07"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::plots::pending::plot_pending (cognitive 24): qlog_dancer::plots::pending::plot_pending has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/pending.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b62775d5a71d3fd2f3928a0411e82c2f038df4f168e425e23cb99244fd3fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Hystart::on_packet_acked (cognitive 24): Hystart::on_packet_acked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 1 (nesting depth added 12). 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":"quiche/src/recovery/congestion/hystart.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffab97e63681f8435d00f2a281f8fc394726303aa3505d72edce4ca90c347df9"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryEpoch::detect_and_remove_acked_packets (cognitive 24): RecoveryEpoch::detect_and_remove_acked_packets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3610fdef27cef2f5a4fbcd31d0bb7ebcc8148a80c779464fd465e62b4e22fc98"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::do_handshake (cognitive 23): Connection::do_handshake has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":8081}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c14e0231b96192f3b9bb51efaeaee930034e849d722b98e5fb92005e0f38d"}},{"ruleId":"D2","level":"warning","message":{"text":"TransportParams::encode (cognitive 23): TransportParams::encode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20 (23 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/transport_params.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb5cc8242227f14fae893e178a282acfba8797553ca54b2da7b7c4c82e08bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamMap::get_or_create (cognitive 22): StreamMap::get_or_create has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/stream/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"953deaf68258eb63a31bade783285d112a6062438d2e9b19b9adcf4f7e34acd9"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameParser::try_parse_frame (cognitive 21): FrameParser::try_parse_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/frame_parser.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b2464ae674c13e1b540ade0a3ac196f333c051f3ba2961b8ed6796f6934678"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::reports::html::table_cell_value (cognitive 21): qlog_dancer::reports::html::table_cell_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca2ccb95ac791b03788c8d1567b17bf527743f7a4152db4bab7b56479b9fe6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::on_timeout (cognitive 21): Connection::on_timeout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: quiche/src/lib.rs holds 8 of the 78 functions over the threshold \u2014 including the worst \u2014 and 580 of the 1975 points over it (29%), 3.2\u00D7 the next-largest file (apps/src/bin/quiche-server.rs at 184). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":7121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b491b9d5b34306524dee4a128d304579e04d140dc1a56d2a9c3daea1b6c132c"}},{"ruleId":"D2","level":"warning","message":{"text":"BBRv2NetworkModel::adapt_lower_bounds (cognitive 21): BBRv2NetworkModel::adapt_lower_bounds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 6). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"431eac1cf9bcf4ee15cacafc4c637d1f8dc827aa920f3f561d6d158bce86ace5"}},{"ruleId":"D2","level":"warning","message":{"text":"HmmDetector::on_rtt_sample (cognitive 21): HmmDetector::on_rtt_sample has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/rtt_jump_detector/hmm.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde5cf811be8b7c19e84e11db8dbf56b69bc12761c0207340690e4ea5c3d4511"}},{"ruleId":"D2","level":"warning","message":{"text":"RecoveryEpoch::detect_and_remove_acked_packets (cognitive 21): RecoveryEpoch::detect_and_remove_acked_packets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"add17b9cda258c5419703b0d5994dcf631d8575394bc77f6122362893e01d44f"}},{"ruleId":"D2","level":"warning","message":{"text":"Http3Conn::with_urls (cognitive 20): Http3Conn::with_urls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be6bcd52034b3ac9a7f2fc3d820eb58a93dd5db09192c5982e0ea3fe488d117"}},{"ruleId":"D2","level":"warning","message":{"text":"Http3Conn::send_requests (cognitive 20): Http3Conn::send_requests has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 4 (7 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6204d12ae1d5f3108e17a233d9711dfa61e6e7978fbc4ddbc72ba664d002c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::do_send_body (cognitive 20): Connection::do_send_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, match/switch 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":"quiche/src/h3/mod.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"221df8b4dc36456c577adcf29282187b2dc1f7fcfb38ffe9db27eaa8c6d1a4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream::try_fill_buffer (cognitive 20): Stream::try_fill_buffer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/stream.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"1368b57b001097c948524f7424388434e374a5130084fa9b506a76f8da00eda0"}},{"ruleId":"D2","level":"warning","message":{"text":"BBRv2NetworkModel::on_congestion_event_start (cognitive 20): BBRv2NetworkModel::on_congestion_event_start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2 (nesting depth added 3). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4db39634ea8b1f1d2aa6b8781ba139fd98b25d2f00e6e1ef9f6b251a22c945c"}},{"ruleId":"D2","level":"warning","message":{"text":"H3Driver::process_writable_stream (cognitive 20): H3Driver::process_writable_stream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f7c064c2ef46786bbc337515da7fa54b7a55c43fc4cc19b9c39d4d3005e1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Http09Conn::handle_responses (cognitive 19): Http09Conn::handle_responses has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 2 (8 pts), if/else 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ade5378b3950b1629ad442afe5030fab4618c7c0372ee0f4e6cd941a98578"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::reports::events::frames_to_string (cognitive 19): qlog_dancer::reports::events::frames_to_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e61e731de8d11911987e847272c74f783b2d3e677c2b86502c767d935fe7296"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeBW::update_probe_up (cognitive 19): ProbeBW::update_probe_up has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2 (nesting depth added 8). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/probe_bw.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3a90977bec8f5c4e572212c48781aab95af842718f25166c72e3f6966b56eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Datastore::consume_netlog_h3 (cognitive 18): Datastore::consume_netlog_h3 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1acb5609b434ed37fe8b4b0b2bf464d51b6d106615c4caccc20f1418394518c"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesStore::packet_sent (cognitive 18): SeriesStore::packet_sent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4023a8162dfc0d27c1574f7c9411872a46de02174c9c19ad7655d6f317e0e81e"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::wirefilter::stream_ids (cognitive 18): qlog_dancer::wirefilter::stream_ids has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (6 pts), loops 1 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/wirefilter.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7899c0a5c7cfbc16e78a40bd70b5ab86ebdac8999e84a2fe3c00100605563bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"qlog_dancer::reports::events::sqlog_event_list (cognitive 18): qlog_dancer::reports::events::sqlog_event_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (5 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":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1b681440d4a83a438e20b8176f7b07c67de2035d230fa7dfd1e068a2249e18"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream::set_frame_payload_len (cognitive 18): Stream::set_frame_payload_len has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/stream.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a936ec4003cd3676961e46e740934872492100b6dcf45261224bcaf1c313038"}},{"ruleId":"D2","level":"warning","message":{"text":"AppConfig::from_clap (cognitive 17): AppConfig::from_clap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/config.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4f85e6b46de7e190703bb10c9af6e3782712c9c0c64ac88320993ac4212429"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionIdentifiers::new_dcid (cognitive 17): ConnectionIdentifiers::new_dcid has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/cid.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"8156b7b6690407c37213a55586da3b0d039cd4cc784e85c6602e02ef96fbfc34"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::poll (cognitive 17): Connection::poll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/mod.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aa5c473001818e54ee0e7e6043831bcbafd7cc2db038bcfa3cba897584ac5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder::decode (cognitive 17): Decoder::decode 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":"quiche/src/h3/qpack/decoder.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c391cea28499ad72c0b3f832066b9601a5fc6c5c324887d396577a8c55f1c342"}},{"ruleId":"D2","level":"warning","message":{"text":"SendBuf::retransmit (cognitive 17): SendBuf::retransmit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/stream/send_buf.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29a167822d618d8cc038d675e15d99703f2993b6789d41cca834fa381184128"}},{"ruleId":"D2","level":"warning","message":{"text":"Http3Test::send_requests (cognitive 17): Http3Test::send_requests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/http3_test/src/lib.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12f82a77ad460321f4a7d1ff6252992e4fea49120ec4278ccc202783041434a"}},{"ruleId":"D2","level":"warning","message":{"text":"quiche_apps::common::dump_json (cognitive 16): quiche_apps::common::dump_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2392d99983b0f90fcf3462e18c10c0692521d23c0e7bc9e2984630fc0cf4301b"}},{"ruleId":"D2","level":"warning","message":{"text":"Action::from (cognitive 16): Action::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/recordreplay/qlog.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"801328de0dbd59aec8c4f72488fd69dae16d0becc23a0724586fa5b1f24f214e"}},{"ruleId":"D2","level":"warning","message":{"text":"Path::on_loss_detection_timeout (cognitive 16): Path::on_loss_detection_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/path.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e00e25553caa9e9cfc51326182cdf4a7543c4ddda44e9cb22313219b03309e5"}},{"ruleId":"D2","level":"warning","message":{"text":"quiche::recovery::congestion::cubic::on_packet_sent (cognitive 16): quiche::recovery::congestion::cubic::on_packet_sent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1 (nesting depth added 8). 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":"quiche/src/recovery/congestion/cubic.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11b8376945d0d2b8643200fd767b51bf1fc976a57979aa6fe7fe1ad7e6bcf1e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Connection: ClassTooLong \u2014 3422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 141 methods, 3 blocks, lines 1323-9381. The bar is 400 significant lines; this is 3022 over it, 8.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4fc7a07ae75f5eebf803b4ce10626117c2a2a0992db8266121c5fe99c95acb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3957 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Connection (3 blocks, 1323-9381). The bar is 500 significant lines; this is 3457 over it, 7.91\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5eab48c3dfda9811501f3c1e0157f8c862b0fce558b73dde2cb2fdc097e4cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.send_single: MethodTooLong \u2014 send_single runs 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 645 over it, 7.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cf63cf7c5a71adf2c3a2a211b764d662cf5e2aae004b58bbaed56823319bc2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Connection: TooManyMethods \u2014 141 methods. The bar is 30 methods; this is 111 over it, 4.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba707c92fb028e5dfee9daa0a4ca6e5a88d1761a0ff591fc641c768184892aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.recv_single: MethodTooLong \u2014 recv_single runs 450 significant 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 350 over it, 4.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":"quiche/src/lib.rs"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6827e2c6551cdfc9f858ac1ce71971c9fe5b1f23fc5ae88ccccb270fb13299"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: qlog_dancer::plots::stream_sparks::plot_sparks: FunctionTooLong \u2014 qlog_dancer::plots::stream_sparks::plot_sparks runs 367 significant 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 267 over it, 3.67\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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1171970334c06060135dba460773f7421c07169681c3be66bae02de5ed3610c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: h3/mod.rs: FileTooLong \u2014 1733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Connection (2 blocks, 997-3356). The bar is 500 significant lines; this is 1233 over it, 3.47\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":"quiche/src/h3/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cb7ada8fc1496fc54397c99e161857e21aabfb7aa192ab9e97118b4a8fb83d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: quiche_apps::bin::quiche-server::main: FunctionTooLong \u2014 quiche_apps::bin::quiche-server::main runs 341 significant 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 241 over it, 3.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":"apps/src/bin/quiche-server.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aad9f95391a04927d12238731385fd0c4c319f588bdaa8a1d04a4e6e184e886"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: quiche_apps::client::connect: FunctionTooLong \u2014 quiche_apps::client::connect runs 310 significant 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 210 over it, 3.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a1c99d550f48e06e53f0bdc61db80306f10ae416449e8b6ec3fad0f3504689"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Connection: ClassTooLong \u2014 1181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 2 blocks, lines 997-3356. The bar is 400 significant lines; this is 781 over it, 2.95\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":"quiche/src/h3/mod.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dde4a4417a7b9b9bbaaab63ab833fde1b39583e6788051ea8b7c0ad1482378"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Connection: TooManyFields \u2014 87 stored fields beside 141 methods. The bar is 30 stored fields; this is 57 over it, 2.90\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53a2fc23a7f1231f21f34fd12dd4a539786100510fbbb2e27b83d49df05c6be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ffi.rs: FileTooLong \u2014 1446 significant 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 151 free functions. The bar is 500 significant lines; this is 946 over it, 2.89\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":"quiche/src/ffi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f7827778aec56939283703070d4d0c6d966f0114b727ce0a3dde4d89ff2a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.process_frame: MethodTooLong \u2014 process_frame runs 278 significant 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 178 over it, 2.78\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":"quiche/src/lib.rs"},"region":{"startLine":8343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7504396a0c9862cdcd589939807abccf9eecdceff7c3e657ee129b15e2477cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing: FunctionTooLong \u2014 qlog_dancer::plots::stream_multiplex::plot_stream_multiplexing runs 260 significant 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 160 over it, 2.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65c0c0437a0de1d1d1c49a66b62abef2ebec3505d010e1cd564d2c88e142dc7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Datastore: TooManyFields \u2014 74 stored fields beside 20 methods. The bar is 30 stored fields; this is 44 over it, 2.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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a219ba753e9163367ac6b2e757b12f7c9297a13898982f24b5abb49f2899911"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/datastore.rs: FileTooLong \u2014 1214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: Datastore (2 blocks, 246-1702). The bar is 500 significant lines; this is 714 over it, 2.43\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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dcc92fe5fe28f81a72b8800909b130f2e090616a70f35e058351aa39e646ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppConfig.from_clap: MethodTooLong \u2014 from_clap runs 241 significant 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 141 over it, 2.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":"qlog-dancer/src/config.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda760c24a1fcc50375757044ec79d91143fd7f122b70dbae86adfaea9bc3b1d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Datastore: ClassTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 246-1702. The bar is 400 significant lines; this is 492 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9b76a9645af3e09324822419e84fa70e6f1efdabaf42c4c5fa7d777419833d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: http3_test::runner::run: FunctionTooLong \u2014 http3_test::runner::run runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/http3_test/src/runner.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"661f39b275b8b9c0542b703b6ebf328a57560b608cee7da37880f705914d0e4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.process_frame: MethodTooLong \u2014 process_frame runs 209 significant 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 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/mod.rs"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a33be4fbfc210a0180d2ad4d9f20535a7850f9f087ab863550446d733eb03b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: h3i::client::sync_client::connect_with_early_data: FunctionTooLong \u2014 h3i::client::sync_client::connect_with_early_data runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/client/sync_client.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7854e596f93d2e28a118cb8741661f8abc51c480c9f09bd804af8e69267d46c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SeriesStore: TooManyFields \u2014 60 stored fields beside 43 methods. The bar is 30 stored fields; this is 30 over it, 2.00\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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c007b1c068826fad06829fee97de49b8bcfc4240ef3e25746e99c3478b032141"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/common.rs: FileTooLong \u2014 998 significant 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 498 over it, 2.00\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":"apps/src/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07752e43d8134e33f545867b448177e2f18c060460a90c8b3c4dc5adc6986db3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.process_readable_stream: MethodTooLong \u2014 process_readable_stream runs 194 significant 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 94 over it, 1.94\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":"quiche/src/h3/mod.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"627c0a38197ebf53deb96aa2ad4036996c00390c70fcc7fd655cd3ac0dc76a21"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Frame: ClassTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 3 blocks, lines 58-1257. The bar is 400 significant lines; this is 372 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/frame.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ee0d4eed2d30e3459ccb5a69c2ef08a2932b7ae750c3d0089c33b4982f3deb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: h3i::config_from_clap: FunctionTooLong \u2014 h3i::config_from_clap runs 193 significant 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 93 over it, 1.93\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":"h3i/src/main.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd18d840e3cae2bc73a1e4c15df10072c65fe2a9fa49632a1c71a47bc0ddec8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Datastore.consume_netlog_h2: MethodTooLong \u2014 consume_netlog_h2 runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0dbebd65381c3f065d4e5de3ffa3f385026a16651a0a7a93aa3df0f2d2a162"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plots/stream_sparks.rs: FileTooLong \u2014 915 significant 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 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c086b83b3f2a169f7cae0cd54876de700ce10973172530fbf36d380176dbf3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.with_tls: MethodTooLong \u2014 with_tls runs 183 significant 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 83 over it, 1.83\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":"quiche/src/lib.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a994393b060bda6e6f647d34081fc3c050ddbdd8be589b1e9ec8cce59718fb8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StreamMap: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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":"quiche/src/stream/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a032bd8eb96e233107756d4d80ef470a295e13dd326bc086472af09eb1f556d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: qlog_dancer::reports::events::sqlog_event_list: FunctionTooLong \u2014 qlog_dancer::reports::events::sqlog_event_list runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b711cd131f11a35f0ab78f9360b6dbefd861778c6aa627ce065e0c07073a664e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Frame.to_qlog: MethodTooLong \u2014 to_qlog runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/frame.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"676932f3c746d2496420226bb5be3c1945491c6132d4426c856437738648c015"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/frame.rs: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Frame (3 blocks, 58-1257). The bar is 500 significant lines; this is 382 over it, 1.76\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":"quiche/src/frame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b980813196a6a5d7e3e5dc6d53dfd6719ea182ed70a629015b8f52b5c46ece7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: qlog_dancer::run: FunctionTooLong \u2014 qlog_dancer::run runs 175 significant 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 75 over it, 1.75\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":"qlog-dancer/src/main.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e2e1cf365a088a1c207dcf0e0a20315d88145190a64c1a52c5c5d7c9d47cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d19c55bebb2d9eb0e10f11df9973f59890dce6c0c409289a98ffae0660dfcf4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Datastore.consume_netlog_quic: MethodTooLong \u2014 consume_netlog_quic runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a418cb7424f43beeafeaefc0b41fa583ceda38182aceb432eade702416b117b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: events/quic.rs: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog/src/events/quic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc8875ceb3b135176f602f812e02b2b0b1c3250bb0ee2c20dca8457534d6f64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: driver/mod.rs: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: H3Driver (5 blocks, 363-1447). The bar is 500 significant lines; this is 296 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e704c26b9a305c7a75cb07838bd474ef16115f1b067eb95bd899ec078b695c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BBRv2NetworkModel: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc36407a1c163d15eaa2c70b436c795a847cc64c7a06d2dad7b2b1c8f4450188"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: QuicSettings: TooManyFields \u2014 47 stored fields beside 25 methods. The bar is 30 stored fields; this is 17 over it, 1.57\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":"tokio-quiche/src/settings/quic.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e0c8b8318aed1046cf336b9ef29d6175368ff54959b80ea2988be16ef4f18e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Params: TooManyFields \u2014 45 stored fields beside 1 method. The bar is 30 stored fields; this is 15 over it, 1.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc2c8ffdcf962c0247a0cc6dcfa7b7ca7602d05cbea120e344f07f03063e96c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Frame.wire_len: MethodTooLong \u2014 wire_len runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/frame.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"1711afde88212418f7bc1d47ea4eb54422432da7881e33431684b1b42ca430fc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: H3Driver: ClassTooLong \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), 23 methods, 5 blocks, lines 363-1447. The bar is 400 significant lines; this is 190 over it, 1.48\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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98013121b123b315025c9d65bdc455c9e762b2514e60ac1d33f385b5e4b3316"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gcongestion/recovery.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: GRecovery (4 blocks, 458-1261). The bar is 500 significant lines; this is 228 over it, 1.46\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":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a462fd734f5eb87b6a19cfeaa896b4f415338e2175bbdfb03f5fe2ca257fad3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeriesStore: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d490f33a55326a6a6db7dd114565a160ff3e11057e6cfa26c7627a05fe2b8a3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: h3i::client::execute_action: FunctionTooLong \u2014 h3i::client::execute_action runs 143 significant 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 43 over it, 1.43\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":"h3i/src/client/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03b2c273e98d22d984c4574bb90719d296ac8d7fd16106266cb00c934a80edb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Frame.to_bytes: MethodTooLong \u2014 to_bytes runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/frame.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9cf961f3e94cc7b73d3ac3a1956b911be91dbb6e68d77cd74392f8c905effb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/worker.rs: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: IoWorker (5 blocks, 293-1292). The bar is 500 significant lines; this is 199 over it, 1.40\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":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"423b42cacda02d025624963face5249a1db2cd97a9bf02d95d2f8e7a10c7d1bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Http3Conn: ClassTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 758-1671. The bar is 400 significant lines; this is 156 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"858d2fffed3d633364f9980a76fcbd01bfd091abd4e8963425aa871434e7bc65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tls/mod.rs: FileTooLong \u2014 684 significant 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 184 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/tls/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae89a6d0d323504533ad0460802ea7e1adc307f983d3a2493f9251fb93d4f39c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Http3Conn.build_h3_response: MethodTooLong \u2014 build_h3_response runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f002095a3626940b503835e351d5489ba9c4b88c41e0a6394b663a333c50ebda"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SparkCaption.draw: MethodTooLong \u2014 draw runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f31ebab5b1de6cf3eb63b0606ca72dfb1d7944dc1f62efc044c01d835320ee2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IoWorker: ClassTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 5 blocks, lines 293-1292. The bar is 400 significant lines; this is 113 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d79dbf23201fdcca3669a6435c521ed8ca68d1747be1bb8dac3635eb7a0c44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: netlog::h2::parse_event: FunctionTooLong \u2014 netlog::h2::parse_event runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/h2.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f63f3914e092fdbce5256e0f73a22022d7dce28b5e0db4103ad18f207c088de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Handshake: TooManyMethods \u2014 38 methods, declared across 2 files: tls/mod.rs (29), tls/boringssl.rs (9). The bar is 30 methods; this is 8 over it, 1.27\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":"quiche/src/tls/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ad158bdbd69577529b2c2f983a42c9f276f990168362914189c6eb2545f5e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: qlog_dancer::datastore::with_netlog_reader: FunctionTooLong \u2014 qlog_dancer::datastore::with_netlog_reader 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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eef9715ec9786413646190845a8d793f9eca740d041095a01faa9626dad1d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InboundPacketRouter.poll_recv_and_rx_time: MethodTooLong \u2014 poll_recv_and_rx_time 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":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c4fc1cfabaab4f0d689c6e935c9e5fcd7bc25e007595b0933ebcf09e17a1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SerializableQFrame.serialize: MethodTooLong \u2014 serialize 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":"h3i/src/frame.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d218c027f69cf0844cacddc7cb91d7ef5609788b81b10509cc18061a804b8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Http3Conn.handle_requests: MethodTooLong \u2014 handle_requests runs 122 significant 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 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2583ba54400e31bd3f61a6d36a46666cbb9a68d4c03315973510e4cb38e2dff8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransportParams.encode: MethodTooLong \u2014 encode runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/transport_params.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ff279097eafc9d727da940e13e89e2db39c2c2ebdfd0dda87874c17e7b3c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: congestion/recovery.rs: FileTooLong \u2014 595 significant 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 95 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce8c240fdb1a3bb1bae1faabc10b7793ca9a93c1aa8d84ae3781222a6a05352"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Frame.to_bytes: MethodTooLong \u2014 to_bytes runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/frame.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"818444ab256fb9da6460c8ef377058f3d2a2d2678a6c50043f6b4747d4a3bb8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OctetsMut: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"octets/src/lib.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9b7e3249dd4c3ba42928e112071dd9992ef2ad3b48b3de04acc90083b72d9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Connection: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/mod.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d81db2627a35bf8f0c5a2ff24998d19874ad5349ceb46953705eb5bd234938"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Constants: TooManyFields \u2014 35 stored fields beside 1 method. 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":"netlog/src/constants.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"386e5cc88d042babe5739dd9821d20bd5781ec992b14f26f081b96ca13c13a10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/packet.rs: FileTooLong \u2014 583 significant 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 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/packet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bd86417cba0c9aa353a5014c2d8f3255214573b82273bbb1db85dfc18a1653"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Stream: 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":"quiche/src/h3/stream.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95c095809fab7ee9d78e3338ef3443525fae07d9d9c2fcf0e1db8db1e5ff673"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HttpRequestStub: TooManyFields \u2014 34 stored fields beside 10 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/request_stub.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5713b4d8be5df9cd3225bff298c6d4990b8e7f5c22ae7726f568f661200a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/web.rs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: QlogDancerWeb (2 blocks, 244-851). The bar is 500 significant lines; this is 66 over it, 1.13\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":"qlog-dancer/src/web.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f55d34c55635e5cd4b4973d5b3903e6c8c4128dfdd22d3d193d7f38f2d763"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GRecovery: ClassTooLong \u2014 448 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 4 blocks, lines 458-1261. The bar is 400 significant lines; this is 48 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d223b4fab3ea0645f5d528a7b97034967d48e22ca41fe669553563d36f2138"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Frame.fmt: MethodTooLong \u2014 fmt runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/frame.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2695806d6d07f4e5951f992ca0f1dca2396588fdfe670fe31a7b5af40f7031"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/path.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cd060e206d73d14d73828a419633592d35e39ef2923a9fff473d47c17ed172"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: qlog_dancer::plots::pending::plot_pending: FunctionTooLong \u2014 qlog_dancer::plots::pending::plot_pending runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/pending.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0720014644030a5f09cf776b8657f80165828b3f5f1ec729454667444738743a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QlogMetrics.maybe_update: MethodTooLong \u2014 maybe_update runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85afa5be6f4e0f55d33219538854ec55bb0ec983f36a11afb619106e8557dde"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Frame.from_bytes: MethodTooLong \u2014 from_bytes runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/frame.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c771f5fa300c654cdfe895024a16a0a2296f291cbad912ae0be4e732c9a3e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SeriesStore: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 2 blocks, lines 38-773. The bar is 400 significant lines; this is 25 over it, 1.06\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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"921395b98869a564bcaf3ac2edc8de54b0696e31e7b3232a32722ee3b366d96a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventType.from: MethodTooLong \u2014 from runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog/src/events/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40d30778c0a8911f0f12ba1d53089320ba5051e94ed0bcbe289973847cf7bac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: router/mod.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: InboundPacketRouter (4 blocks, 145-821). The bar is 500 significant lines; this is 21 over it, 1.04\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":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd10b7c42ddf27c293d3daa5dc932c8cc1a0c95bb48487d37626dfd28724e4f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnectionIdentifiers: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/cid.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e040ec968649912e66baad7571ab3aea48d0f2384f2ee3150cab36922602afb2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Path: TooManyFields \u2014 31 stored fields beside 27 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/path.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"90500e050efddbf5dbba6871b35fbb975c5ed92dcbb39d5e74eb4de9b0a762d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InboundPacketRouter: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 4 blocks, lines 145-821. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d45f66c12cbffab318f4baefa3e9f115c37559b0899388bf10aed191d6ac63"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QlogDancerWeb: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 244-851. The bar is 400 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/web.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"84642f78e1fed4a5916e551c0d754cc76d0386c8d7807d3530098f0751446689"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): qlog-dancer/src/web.rs:408-435 | qlog-dancer/src/web.rs:443-469 | qlog-dancer/src/web.rs:477-502 | qlog-dancer/src/web.rs:662-693 | qlog-dancer/src/web.rs:700-728 | qlog-dancer/src/web.rs:735-765 | qlog-dancer/src/web.rs:772-803 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/web.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c58965244a6666ffa48b7650b571effe9882805d9665061a51ec47ba381779"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): qlog-dancer/src/plots/congestion_control.rs:43-91 | qlog-dancer/src/plots/conn_overview.rs:346-391 | qlog-dancer/src/plots/conn_overview.rs:396-439 | qlog-dancer/src/plots/packet_sent.rs:299-369 | qlog-dancer/src/plots/rtt.rs:75-115 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/congestion_control.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9eef8f88d9a3c9c62fee0d6e0687ef2e169094099750888e31e42e9cc00c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2): quiche/src/recovery/gcongestion/bbr/windowed_filter.rs:88-154 | tokio-quiche/src/quic/io/utilization_estimator.rs:305-371 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/io/utilization_estimator.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"151146d887151335015004b97f4abde9012a420d64704bf459517f5200435613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201343 lines \u00D7 2): qlog-dancer/src/plots/stream_sparks.rs:347-389 | qlog-dancer/src/plots/stream_sparks.rs:427-468 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca5c4fbd7f971c2fd519931e5ccf6df48adef2a895fc6f6a4d54029d6610549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201340 lines \u00D7 2): h3i/src/client/mod.rs:165-204 | h3i/src/client/mod.rs:217-254 \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":"h3i/src/client/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac13aa7c1bf8eb36c8ef2b8f601b9449536bdcd0c760a50600a29edd22912602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): apps/src/client.rs:335-364 | apps/src/client.rs:554-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d1cff1574c840da3d2d53076c256e1a0ddfe64add3640cc1f70c4b3343c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): h3i/src/prompts/h3/errors.rs:96-120 | h3i/src/prompts/h3/errors.rs:125-152 \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":"h3i/src/prompts/h3/errors.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f66175a37806d0cf3821f3b5f94e32d8386aeca3ec3097dffcf595a6c8a2fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): quiche/src/lib.rs:8433-8459 | quiche/src/lib.rs:8606-8633 \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":"quiche/src/lib.rs"},"region":{"startLine":8433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff9f75ada8a6af67bd0ef16b6c7b8547561e3d74f2341a34ca589f9f209651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): quiche/src/lib.rs:6321-6343 | quiche/src/lib.rs:8531-8554 \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":"quiche/src/lib.rs"},"region":{"startLine":6321}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b921e46628fce31523189ff83520b11718bccaaf88f290c7dd8136eceb3556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): h3i/src/frame.rs:387-409 | h3i/src/frame.rs:412-433 \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":"h3i/src/frame.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d39c9eac3acb30f92dfac3a8a83f0119ff5c649f51ba2a6fc2fd75c412ebee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): qlog-dancer/src/web.rs:507-529 | qlog-dancer/src/web.rs:591-613 \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":"qlog-dancer/src/web.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0d474ef1944d0b97b40d485df2ae0d60240ec3bcf6b1f2baef4194c9726118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): tools/http3_test/src/runner.rs:293-315 | tools/http3_test/src/runner.rs:334-356 \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":"tools/http3_test/src/runner.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7698833d00b11af9e2b813efa3507e4ae6ea9cc1793cfb96790cedca57e86559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): qlog-dancer/src/web.rs:119-140 | qlog-dancer/src/web.rs:148-169 | qlog-dancer/src/web.rs:177-198 \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":"qlog-dancer/src/web.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc5a12870bda46b17f66b109017f8edcd0e6b2ed7450914fb0c87232ebadf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): octets/src/lib.rs:218-239 | octets/src/lib.rs:520-541 \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":"octets/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2a56c52152d5abf171ec3afdd775f047ed3663c9c9e3077558082ebd658ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apps/src/common.rs:177-197 | apps/src/common.rs:204-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5013bae7dea9d718752d0d1a198e8e92b16e83dec6105b81868887750a4451e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): qlog-dancer/src/wirefilter.rs:114-134 | qlog-dancer/src/wirefilter.rs:136-154 \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":"qlog-dancer/src/wirefilter.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2717f193f34f251dea98dcbd5a038500176272e9d40ba931586136e5b09bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 3): qlog-dancer/src/web.rs:410-429 | qlog-dancer/src/web.rs:445-462 | qlog-dancer/src/web.rs:479-496 \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":"qlog-dancer/src/web.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a99df423a4d8f4a2f3e11e7005ca0c2b3fefbe3b51082232d5c473aab39b35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): buffer-pool/src/raw_pool_buf_io.rs:57-76 | datagram-socket/src/datagram.rs:79-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"buffer-pool/src/raw_pool_buf_io.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0af67b0b026c5c4621a1efd7ea92919ef9aaf9907f0dec5b2b793d9b320160a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): quiche/src/h3/stream.rs:614-633 | quiche/src/h3/stream.rs:667-686 \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":"quiche/src/h3/stream.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fa9a97542fe6421e42d7b91db87ea6208c5435c85dd9ed2048e3f1b57f50d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): quiche/src/lib.rs:8494-8513 | quiche/src/lib.rs:8673-8692 \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":"quiche/src/lib.rs"},"region":{"startLine":8494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a351edd241ef8386046c590a67b377a24cf3d05dedb62f294465b3c87f19fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): quiche/src/recovery/congestion/recovery.rs:771-790 | quiche/src/recovery/gcongestion/recovery.rs:924-943 \u2014 \u0060quiche/src/recovery/congestion/recovery.rs\u0060 and \u0060quiche/src/recovery/gcongestion/recovery.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aff26abd44278c47c838906c70bbf20d7a5e5ab619b56024864d7b7afab970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): qlog-dancer/src/plots/packet_received.rs:48-66 | qlog-dancer/src/plots/packet_sent.rs:377-395 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/packet_received.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d323c8bae77594026af6f9708d45d5a1e75fed5cd4aa6746083b2afadcba1fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): qlog-dancer/src/plots/stream_multiplex.rs:177-195 | qlog-dancer/src/plots/stream_multiplex.rs:225-243 \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":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7437d68891df95b57a6bbf495d0e1fea4809f95f57be40d974e8bbbccde3e60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): qlog-dancer/src/reports/text.rs:433-451 | qlog-dancer/src/reports/text.rs:460-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"49303962504d56dcbea85012eefd3aa99df616631e716cb068ec7942350f73bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): quiche/src/recovery/congestion/recovery.rs:136-154 | quiche/src/recovery/gcongestion/recovery.rs:186-204 \u2014 \u0060quiche/src/recovery/congestion/recovery.rs\u0060 and \u0060quiche/src/recovery/gcongestion/recovery.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"febbeeef037e799a80c543797a78f1bfe3249c059f9070c7f8c61fd234b27941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): quiche/src/recovery/congestion/recovery.rs:511-529 | quiche/src/recovery/gcongestion/recovery.rs:667-685 \u2014 \u0060quiche/src/recovery/congestion/recovery.rs\u0060 and \u0060quiche/src/recovery/gcongestion/recovery.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"96929d7aaa09c0c79abbe612f254d9df1d376bfc2a936944e572c8c6b593dba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): qlog-dancer/src/web.rs:664-681 | qlog-dancer/src/web.rs:702-719 | qlog-dancer/src/web.rs:737-754 | qlog-dancer/src/web.rs:774-791 \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":"qlog-dancer/src/web.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"38310c67d1bea8b921ebaacc6982a555bb5f2b296f1ac2b75aa605535aa8f974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): quiche/src/lib.rs:3625-3641 | quiche/src/lib.rs:4183-4200 \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":"quiche/src/lib.rs"},"region":{"startLine":3625}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc6821b88ef180d5881da09e1d750c5da3378499b6dc60182d0a42cb0b1a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): h3i/src/prompts/h3/mod.rs:420-436 | h3i/src/prompts/h3/mod.rs:443-459 \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":"h3i/src/prompts/h3/mod.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f644441c3719f64c82ab8223090da0d5ba9c9ed9d6f46c05e2bc57368b4d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): qlog-dancer/src/plots/conn_flow_control.rs:202-216 | qlog-dancer/src/plots/conn_flow_control.rs:237-253 \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":"qlog-dancer/src/plots/conn_flow_control.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e326994930fe1c24aa517f98a490a063f35a895a3323faf62fc404ee0d2ca14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): qlog-dancer/src/plots/stream_multiplex.rs:339-355 | qlog-dancer/src/plots/stream_multiplex.rs:357-373 \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":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7d092f3ddb3604908797b6642b6e48b3d643f4263a098447dad554cecf5438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): qlog-dancer/src/plots/stream_sparks.rs:184-200 | qlog-dancer/src/plots/stream_sparks.rs:272-288 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"082b97d2d53f5ba7e7fffaa5014d5056d804a26903a90142d4603cba0eb0ae12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): qlog-dancer/src/plots/stream_sparks.rs:407-423 | qlog-dancer/src/plots/stream_sparks.rs:493-509 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc215c2e30901dc104e1aeb22cbb64ca0966d3eb27edd81091641356b68e200b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): qlog-dancer/src/seriesstore.rs:621-636 | qlog-dancer/src/seriesstore.rs:653-669 \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"327ef5ed619dc5cd6df8cf7cbd9f1e55ad089e28254c0ee92edd916f8150bd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): apps/src/bin/quiche-server.rs:284-297 | apps/src/bin/quiche-server.rs:322-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/bin/quiche-server.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf77e4215f40343ac3e669fbd5b5626fb8e043b809eb3cd7ede5d4318a2bd078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): qlog-dancer/src/datastore.rs:893-907 | qlog-dancer/src/datastore.rs:977-991 \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7edbd19ef18d84490b9d24ae81543a18553131c882d233b8a8c3d567ebff57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): qlog-dancer/src/plots/conn_overview.rs:355-369 | qlog-dancer/src/plots/conn_overview.rs:405-419 \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":"qlog-dancer/src/plots/conn_overview.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d81b8a504ddbadc34891c90eed88dd0d8623df07bee2802ded6da1176e044e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): qlog-dancer/src/trackers/stream_buffer_tracker.rs:65-79 | qlog-dancer/src/trackers/stream_max_tracker.rs:62-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/trackers/stream_buffer_tracker.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d015ed2384587672e9d3f64e6d24ee71f1705e968a5e31b881a6cf4bd07e5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): quiche/src/h3/mod.rs:2033-2047 | quiche/src/h3/mod.rs:2433-2446 \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":"quiche/src/h3/mod.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"47115f7afe765857d15f4c1eaea30b80b156733f612d90a95f245dc76650366a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): quiche/src/tls/mod.rs:782-796 | quiche/src/tls/mod.rs:831-845 \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":"quiche/src/tls/mod.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea38a6138bb63008d64b5c8e231837628039b76c0445b17eea47eeefbfdd373c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): h3i/src/client/mod.rs:181-194 | h3i/src/client/mod.rs:233-246 | h3i/src/main.rs:402-415 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/client/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b885eb2d4ea2468d6b457cb9380a4996cb6cd66f6b08bd260902a550a8bd2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): qlog-dancer/src/plots/congestion_control.rs:101-114 | qlog-dancer/src/plots/conn_overview.rs:489-501 | qlog-dancer/src/plots/rtt.rs:125-138 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/congestion_control.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"90770ff83a8970c6f7d1119a7c599fb332f21e93ef157cfb97e092bae97580af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/src/bin/quiche-server.rs:116-129 | apps/src/client.rs:118-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/bin/quiche-server.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f323ec6fccefd7360367f25488819a073de9c41ebb3a2499dd0947d9642b44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/src/common.rs:701-714 | apps/src/common.rs:1657-1670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d362325cb31c16222161b484d5f0429285e24949fdf24ffb62bdc15579bf1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): qlog-dancer/src/plots/stream_multiplex.rs:305-318 | qlog-dancer/src/plots/stream_multiplex.rs:322-335 \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":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea56a4f912c29d06c9b22e44bc5ae3b5a01c6978d6f59727f0132b39bb4e85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): qlog-dancer/src/plots/stream_sparks.rs:902-909 | qlog-dancer/src/plots/stream_sparks.rs:943-956 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4f2f31fe1920e14e8ef581753bd456110e430d0aa23e227d4c638bfefb3ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): quiche/src/lib.rs:9305-9318 | quiche/src/lib.rs:9330-9343 \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":"quiche/src/lib.rs"},"region":{"startLine":9305}}}],"partialFingerprints":{"codehealthFindingId/v1":"585a1a61da25ce869687c9b22fe3ce3f91f4860653e8b1bbb831b8d222debd52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/http3_test/src/runner.rs:219-232 | tools/http3_test/src/runner.rs:411-424 \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":"tools/http3_test/src/runner.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bc4b7e358ef646949e3219ab5f9e7c90c3a536c223747ea34a68cafffe80e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): qlog-dancer/src/web.rs:409-421 | qlog-dancer/src/web.rs:444-456 | qlog-dancer/src/web.rs:478-490 | qlog-dancer/src/web.rs:663-675 | qlog-dancer/src/web.rs:701-713 | qlog-dancer/src/web.rs:736-748 | qlog-dancer/src/web.rs:773-785 \u2014 all 7 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":"qlog-dancer/src/web.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a87170b6b44c78715555d57b6a66f48ad3ebd4181f3c227cd0b6f10a7d9547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 5): qlog-dancer/src/plots/congestion_control.rs:80-91 | qlog-dancer/src/plots/conn_overview.rs:379-391 | qlog-dancer/src/plots/conn_overview.rs:427-439 | qlog-dancer/src/plots/packet_sent.rs:357-369 | qlog-dancer/src/plots/rtt.rs:103-115 \u2014 before extracting anything, compare \u0060qlog-dancer/src/plots/conn_overview.rs\u0060 and \u0060qlog-dancer/src/plots/packet_sent.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/congestion_control.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f927d72675292b7ac32ada2fd35ed4d0a125d78768adb447b05868fc04ecbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): qlog-dancer/src/plots/conn_overview.rs:329-341 | qlog-dancer/src/plots/packet_sent.rs:147-159 | qlog-dancer/src/plots/packet_sent.rs:220-232 \u2014 before extracting anything, compare \u0060qlog-dancer/src/plots/conn_overview.rs\u0060 and \u0060qlog-dancer/src/plots/packet_sent.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/conn_overview.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f7a891aace6a123500e350ac79603640bf6cfb0b995a9f753b458642cd1f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): apps/src/client.rs:69-77 | h3i/src/client/mod.rs:579-591 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae957553a6a77deb6bbaf434bb32ba9c2701ccabc7eb96d5454210c740fc557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/src/client.rs:503-515 | h3i/src/client/sync_client.rs:431-443 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b826b2e508ba3dc86107f790d41446f5370cffc1dd77461f7ba732101cb6f613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): datagram-socket/src/mmsg.rs:58-70 | datagram-socket/src/mmsg.rs:118-130 \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":"datagram-socket/src/mmsg.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"02eb11e977bd56b5cdab1a1e2cb6c86ac3a3914ad1814761cf5500fbe8aaef6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): qlog-dancer/src/seriesstore.rs:533-545 | qlog-dancer/src/seriesstore.rs:565-577 \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"77360446151da22e2da728e33bedab402bf80165434b951914a13356066d29d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): qlog-dancer/src/reports/html.rs:477-488 | qlog-dancer/src/reports/html.rs:529-540 | qlog-dancer/src/reports/html.rs:581-592 \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":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"507cc24f462ce32672301d6cd218f0349fecc4f0ae09e4f2d161749ca5e9f32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): qlog-dancer/src/plots/pending.rs:166-177 | qlog-dancer/src/plots/pending.rs:189-201 \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":"qlog-dancer/src/plots/pending.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6b4c2289180e1755cfad979b9e972057fb9edc91e5b4a8b10411aef64e3ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): qlog-dancer/src/plots/stream_multiplex.rs:298-308 | qlog-dancer/src/plots/stream_multiplex.rs:393-404 \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":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ee67f9c419eb3a85b712709d800e27919b22281a5ec6e5724ac700559ebb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): qlog-dancer/src/reports/html.rs:146-157 | qlog-dancer/src/reports/html.rs:205-216 \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":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e166a9c44d8ee6379205e983da9b3a8076310eec5eeef833245e228a19d905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): quiche/src/ffi.rs:548-559 | quiche/src/ffi.rs:652-663 \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":"quiche/src/ffi.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d866ae68370f00c20cc539fb0ac9f7ef46855731bf731fec16023ba81e3a4659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): quiche/src/lib.rs:3073-3084 | quiche/src/lib.rs:3137-3148 \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":"quiche/src/lib.rs"},"region":{"startLine":3073}}}],"partialFingerprints":{"codehealthFindingId/v1":"53be54201212b5578267b78a72ab48f7d855af98d454725e2f70bb632d972642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): quiche/src/lib.rs:5013-5023 | quiche/src/lib.rs:5029-5040 \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":"quiche/src/lib.rs"},"region":{"startLine":5013}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8a4cd1b2715639955671b8b3cfcd04f481b16c8cfd63ef6a4aa9070f27aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/src/common.rs:1374-1384 | apps/src/common.rs:1576-1586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0206a097d074abaeee6fa200859077bbe8d8ea241dbd83e3e3ebb6ea19c323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): qlog-dancer/src/datastore.rs:1533-1543 | qlog-dancer/src/datastore.rs:1573-1583 \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"68387b3c8b9e8be6441b2b1553c90ba68c0deb23769ec1c778a951fa93d17010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): qlog-dancer/src/datastore.rs:1604-1614 | qlog-dancer/src/datastore.rs:1642-1651 \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"058ae6d9e0df7f0a9b480f74db9782a011fc585d619d02e8ce98aacde1fe7e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): quiche/src/ffi.rs:662-672 | quiche/src/ffi.rs:723-732 \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":"quiche/src/ffi.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"663bf7c02e48bbc6c7d741891e516ae9e5505ebe448efffefc951e79a2d18dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): quiche/src/lib.rs:3671-3681 | quiche/src/lib.rs:3727-3737 \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":"quiche/src/lib.rs"},"region":{"startLine":3671}}}],"partialFingerprints":{"codehealthFindingId/v1":"678bb315dc25a25642c8a062f41996fc134f6f68d94dc70effb9b8b2f35e61b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tokio-quiche/src/quic/io/worker.rs:323-333 | tokio-quiche/src/quic/io/worker.rs:1146-1156 \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":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"78531d569f79977995f71a4a3d69d08ab6f08000e03b06aee77a84bf860a31b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): qlog-dancer/src/plots/stream_sparks.rs:710-719 | qlog-dancer/src/plots/stream_sparks.rs:721-730 | qlog-dancer/src/plots/stream_sparks.rs:732-741 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aef0f53848eb8d1ec0c171b0f82fbf6f9963bcbd06a6016ad386950f04eb6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): quiche/src/ffi.rs:547-556 | quiche/src/ffi.rs:651-660 | quiche/src/ffi.rs:707-716 \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":"quiche/src/ffi.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c14cfd198eb7b6dc23250fbcca5aca2173b50e6a42aae6237dc738393ddf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): qlog-dancer/src/reports/events.rs:372-381 | qlog-dancer/src/reports/events.rs:383-392 \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":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"8175740c79962dbc287399a9d4ef56dc50e150c49d92c02542bb99a642269167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): qlog-dancer/src/seriesstore.rs:429-438 | qlog-dancer/src/seriesstore.rs:460-469 \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6936a588589c5ddcdcc5b70588e9577ace655791b6262dbb6366e73b38f5dbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): qlog-dancer/src/plots/mod.rs:198-206 | qlog-dancer/src/plots/packet_received.rs:40-48 | qlog-dancer/src/plots/pending.rs:67-75 | qlog-dancer/src/plots/stream_multiplex.rs:123-131 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2a58c7888cec7a928f61883748877753635487265d4651cbc0afc1e2f80670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): apps/src/client.rs:523-531 | h3i/src/client/sync_client.rs:450-458 | tools/http3_test/src/runner.rs:389-395 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fabae2411fe4c17a03d4e78b9be9cb971a93b941028b4aedca53fcaded34b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): qlog-dancer/src/reports/html.rs:512-520 | qlog-dancer/src/reports/html.rs:564-572 | qlog-dancer/src/reports/html.rs:650-658 \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":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10442bacf59fbd48ede87b5950ddadbda8b73b56ab8eb3ea7959ffa927010c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/src/client.rs:77-85 | tools/http3_test/src/runner.rs:73-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"275da86acbf092abd3fc1bf6f49d1ab18fba74c2bfcec86c1aeebe3b8240885a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/src/common.rs:242-250 | tools/http3_test/src/runner.rs:431-439 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/common.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e2e4b35c1e8787fe1bc08c96e8ad483a66e8f3fe6012008196932a036061e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): qlog-dancer/src/plots/stream_sparks.rs:911-919 | qlog-dancer/src/plots/stream_sparks.rs:921-929 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37626524f43ec1890e7cbcf52dd5a0b6df4445132006eb4988fc3c86f83eb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): quiche/src/ffi.rs:501-509 | quiche/src/ffi.rs:511-519 \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":"quiche/src/ffi.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7b7f34b66a2c40c74575a22c1f6c333d6a1bcbc3f71a3eba3444ac333ccbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): quiche/src/lib.rs:5887-5895 | quiche/src/lib.rs:6170-6178 \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":"quiche/src/lib.rs"},"region":{"startLine":5887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83150a7499fece125a5dc81f21c486ab60e431fc2cd66210fb8ab1fde4c9c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): qlog-dancer/src/plots/stream_sparks.rs:710-717 | qlog-dancer/src/plots/stream_sparks.rs:721-728 | qlog-dancer/src/plots/stream_sparks.rs:732-739 | qlog-dancer/src/plots/stream_sparks.rs:743-750 \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c7cc90b8d02bb7e468d41cc697aa4dfddf32e3df9dd9bae0d9c1fe2f3a5c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): h3i/src/frame.rs:308-315 | h3i/src/frame.rs:438-445 \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":"h3i/src/frame.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14bf226440473329bb96165e267c5ece05392c66f5c24a3707a47851d12d559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): qlog-dancer/src/plots/packet_sent.rs:169-177 | qlog-dancer/src/plots/packet_sent.rs:306-313 \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":"qlog-dancer/src/plots/packet_sent.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f8e583a8f098cda17d2d16af33f50b0d79551235d21c9794b54b2464e34b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): quiche/src/ffi.rs:791-798 | quiche/src/ffi.rs:812-819 \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":"quiche/src/ffi.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1080270f0f5f99f4351a62f25034c9655f3ad765a57cb14a4d6917c78d8610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): quiche/src/recovery/gcongestion/bbr2/mode.rs:226-233 | quiche/src/recovery/gcongestion/bbr2/mode.rs:236-243 \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":"quiche/src/recovery/gcongestion/bbr2/mode.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7244abb3b5ea22da700139b88a61ac8809db6ffa767512de795b1d343598ab04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): qlog-dancer/src/reports/text.rs:255-261 | qlog-dancer/src/reports/text.rs:279-285 | qlog-dancer/src/reports/text.rs:303-309 \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":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1f82e31fb17e51e5edd758ed5bd7822371e616df2a3fc34f919f5b3e78b3a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): h3i/src/client/connection_summary.rs:486-492 | h3i/src/client/connection_summary.rs:512-518 \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":"h3i/src/client/connection_summary.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"26de02a692d11858a038154612ce6b31cf49daa585c77862c73bbf5fb732a98a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): quiche/src/crypto/mod.rs:368-374 | quiche/src/crypto/mod.rs:377-383 \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":"quiche/src/crypto/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2460d55ea0e617453dcb6613e6846389f6e563db074736ef1df104ba4543b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): qlog-dancer/src/reports/text.rs:262-267 | qlog-dancer/src/reports/text.rs:286-291 | qlog-dancer/src/reports/text.rs:310-315 \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":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e18bb32d6e80812dd81353d046a12146f441e5bb45636bfd6f9cafc8ba0c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): qlog-dancer/src/reports/html.rs:160-164 | qlog-dancer/src/reports/html.rs:219-223 | qlog-dancer/src/reports/html.rs:411-415 \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":"qlog-dancer/src/reports/html.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a5df99d071abf85d71c54171d6004f16c8da64759d1c80e8fad57acce5bd45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): qlog-dancer/src/plots/conn_overview.rs:52-61 | qlog-dancer/src/plots/packet_sent.rs:46-55 \u2014 before extracting anything, compare \u0060qlog-dancer/src/plots/conn_overview.rs\u0060 and \u0060qlog-dancer/src/plots/packet_sent.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/conn_overview.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b9615773c2cbe7b9c9ca477c585d778aa8788dd7771e2b8034a39622bd4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): quiche/src/recovery/congestion/recovery.rs:1073-1081 | quiche/src/recovery/gcongestion/recovery.rs:1225-1233 \u2014 \u0060quiche/src/recovery/congestion/recovery.rs\u0060 and \u0060quiche/src/recovery/gcongestion/recovery.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 67 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcd7bc984c504bc64018e2da50df9510ca521a25688ce69bb214c5ea77567e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): quiche/src/recovery/gcongestion/bbr/windowed_filter.rs:59-66 | tokio-quiche/src/quic/io/utilization_estimator.rs:288-295 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/io/utilization_estimator.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fdf7fd4f5ff41bae3211f85f2d0576f4110cc5cbaf755a29c05f870dd22f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): quiche/src/recovery/gcongestion/bbr2/drain.rs:110-115 | quiche/src/recovery/gcongestion/bbr2/probe_rtt.rs:64-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/bbr2/drain.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef60069c3b7f0018e82f108a8b47739a16009c8597f3bc528356feefb7d7f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): qlog-dancer/src/plots/packet_sent.rs:181-194 | qlog-dancer/src/plots/packet_sent.rs:317-333 \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":"qlog-dancer/src/plots/packet_sent.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"020c3c8d49849877a32e06f14dcc5c7c1eeec9106bc10692b54685f9bea13e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): quiche/src/h3/mod.rs:3248-3264 | quiche/src/h3/mod.rs:3317-3333 \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":"quiche/src/h3/mod.rs"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d8f722fa51373bdeea31edc1b5bf6579fcfc7d0dc117e0e3670f2f4acd9927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): qlog-dancer/src/plots/packet_sent.rs:241-253 | qlog-dancer/src/plots/packet_sent.rs:307-320 \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":"qlog-dancer/src/plots/packet_sent.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b06e047ed688f6c8485407bc99719a250409868a4c20537ec23f26acea81499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): quiche/src/h3/frame.rs:372-383 | quiche/src/h3/frame.rs:397-409 \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":"quiche/src/h3/frame.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff37c2cb0804f42a787950de3ca79a73b2d4ced0e55af59a6d3c21e00a6ce10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): qlog-dancer/src/plots/conn_flow_control.rs:248-259 | qlog-dancer/src/plots/conn_overview.rs:301-312 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/conn_flow_control.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9eb0e718b69f7f5afa2fee0a1b2cab533931a7f4f4793ddd3942b35aed9878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): quiche/src/h3/frame.rs:370-378 | quiche/src/h3/frame.rs:386-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/h3/frame.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f9bddd16c3911b387719eceda40d2b0fe567fb46f4f833cd6ff0ca21f9d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): qlog-dancer/src/plots/conn_overview.rs:446-452 | qlog-dancer/src/plots/packet_received.rs:38-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/conn_overview.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e31f54a2684bea0b6801c9b0e13fc36b62ffec25a1d0ab36848620bf857b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): quiche/src/lib.rs:9285-9290 | quiche/src/lib.rs:9295-9300 \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":"quiche/src/lib.rs"},"region":{"startLine":9285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b271b3479038c3417df2d72640162e25654f797e3f791f1da663163ce25fd326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): quiche/src/h3/mod.rs:2387-2391 | quiche/src/h3/mod.rs:2415-2419 \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":"quiche/src/h3/mod.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6f4b65dab2622350755a933f6897aad68ce37e713bfbc13f42447fd1b1cc14"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project tokio-quiche: tokio-quiche has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3d5741ba631d0ac63a697a6b83323b9d1a731e52b7bd05f211434369e055d21d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: netlog: netlog: 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":"4942807e89df300840ebe5a2a23d594c360d8ac50e6a9a9f0a50081866ea637e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: task-killswitch: task-killswitch: 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":"990cb9557561a46ec1dcdebd7e4942104b1516636ffcddd6a2ae6134a1f7201c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: qlog: qlog: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2a66f4132000fe81e47f30f14d4c76ed44127d9b23d87a89d771909ebd54e89"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: octets: octets: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6386c62d2d1899f1de9f53b101862897f0e1cc79e7714b68f1998751e6c275c8"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de9bd3a4f729cba958812c7ba130d398d6e192b41c450b6615dc2afedd25cc6f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55f6dd784d24631b227d94d3dd00efbaeeae1e6b749c9c2d1b58eb6d2267a9e2"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29218b54077e6bddd4a5bb65a0daaa51838ab57a18e6915a86c17eafc933bada"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: quiche/src/lib.rs: quiche/src/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 180 in Connection::send_single at line 4123. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- quiche/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":"quiche/src/lib.rs"},"region":{"startLine":4123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1d64e439a63bf57104bedfe13a864ce7e2e00b81ce31b6719c0b8c941d75d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: quiche/src/h3/mod.rs: quiche/src/h3/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Connection::process_readable_stream at line 2594. 2 of those changes were fix/bug commits, 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-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- quiche/src/h3/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":"quiche/src/h3/mod.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2ff5ad6818be9dd82826662246134aef8e3e5b665fe8e7765b44686197eb5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/src/client.rs: apps/src/client.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in quiche_apps::client::connect at line 47. 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-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- apps/src/client.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/client.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f3a7afc06d9566f752401babc580b49072451fb1daae46384241a727a8e35b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tokio-quiche/src/http3/driver/mod.rs: tokio-quiche/src/http3/driver/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in H3Driver::process_h3_data at line 504. 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-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- tokio-quiche/src/http3/driver/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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d983aa9a88d36e36f11caf5866bf41c08cb63645b5575adcfb9ebe593d1c654"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: quiche/src/h3/stream.rs: quiche/src/h3/stream.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Stream::set_frame_payload_len at line 446. 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-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- quiche/src/h3/stream.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":"quiche/src/h3/stream.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a258882e58dd55d7c2c432571be783a142e414678cc8dc85d545d833826f7195"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tokio-quiche/src/quic/io/worker.rs: tokio-quiche/src/quic/io/worker.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in IoWorker::gather_data_from_quiche_conn at line 578. 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-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- tokio-quiche/src/quic/io/worker.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":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1ef10b54e38c8132791c2190e5f30415a799ac2809992ce6e644300cc0c67b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: quiche/src/stream/mod.rs: quiche/src/stream/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in StreamMap::get_or_create at line 271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- quiche/src/stream/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":"quiche/src/stream/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7336b22afe8897d41f9dbca18b5b3ac2c090eea77688580df79e57d1596b7dbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: quiche/src/recovery/gcongestion/bbr2.rs: quiche/src/recovery/gcongestion/bbr2.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Params::with_overrides at line 222. 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-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- quiche/src/recovery/gcongestion/bbr2.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":"quiche/src/recovery/gcongestion/bbr2.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca581f7960e49e42a1a094f4edb5e9c042efa58ba93325d533eee58a4d17ad9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: quiche/src/recovery/gcongestion/bbr2/network_model.rs: quiche/src/recovery/gcongestion/bbr2/network_model.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BBRv2NetworkModel::on_congestion_event_start at line 318. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-23..2026-09-21, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-23 12:54:21 \u002B00:00\u0027 --until=\u00272026-09-21 12:54:21 \u002B00:00\u0027 --full-history --no-merges -- quiche/src/recovery/gcongestion/bbr2/network_model.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":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cc0bfde140f4047aeb54d7d15d20a5b16dee2a343332bbf8da772969bd012a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: qlog-dancer/src/request_stub.rs, qlog-dancer/src/reports/text.rs, qlog/src/events/http3.rs, qlog/src/testing/mod.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a95cb242ff4d5cd284c942478145ae19a052e8c918faa8873c8dc32a84193fd4"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (9 single-owned of 163 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 163 of the 180 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: CLI/qlog don\u0027t support passing close trigger frames at the moment \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":"h3i/src/main.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"013bc4bfa2c6f46859ed484e0137365f060433a60c908a7fe210c0b28b12196e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(evanrittenhouse): we could theoretically hand-roll a \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":"h3i/src/frame.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbdf6f3f25e1473b366001bde0e8e850cd134b80ed51088adaa6a36783d9568"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the wait period could still be larger than the \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":"h3i/src/client/sync_client.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0117268fe2b18e768b7b7e7f4bf2dd70a050f413227fb11f4d274fe6e1aef8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make serialization smarter \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":"h3i/src/client/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"882e1d9e13702edd0cda8b5a8f2050369fa0b8d5a535d4619ab46a1614160f00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make serialization smarter \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":"h3i/src/client/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfa19aab9e8379ce02341634c652c402b7826b875c4483cde4129b5698112d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - consider storying result in ConnectionSummary too. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/client/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f782374ef599abbb734bc75a62d1e1e3e2ab1c830145a629fb7d5e1088da70e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ignoring control streams \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":"h3i/src/client/mod.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3442ddd1a72d0e803bcaba7274a6d0914a05a25594a757aa9dccd0805c6fd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: customizable close trigger frames \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":"h3i/src/client/async_client.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cea0f6c3dba93e58e6f70c28488f072385b1f3816a6d4b554033b923d908412"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(erittenhouse): exploring generating prompts at compile-time \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":"h3i/src/prompts/h3/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c99cfc1a031e35405fc1c24d1a13e5e7dfe4145f6017ff211541a7348f854a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this an enum to automatically pick up new actions \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":"h3i/src/prompts/h3/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2bc64e4591ea33be9bd5e49a6d4bb6a03e7f80ab6e64d080191e7bd02f1de4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we want to rely on the qlog enum here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/prompts/h3/errors.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a222f95a8dc03da0e3197b65e9cdc567a73736cbd47dd3f98b48f7a88f76efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add these \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":"h3i/src/recordreplay/qlog.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c139d6e49cfff1c463fed2c582db859debd4a56fca591d1b11ecf6b8d6e50335"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove unwrap when https://github.com/cloudflare/quiche/issues/1731"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"h3i/src/recordreplay/qlog.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9584380281ec3fa1c8ba2a1852799b80782e69b75c1b33d6e055fc3011366f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should really be done using serde, not hacked like this. What \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":"netlog/src/quic.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb26c998f901b6b82c72c7ffe14625f012215b07fdecc7db77226d8086d7ec48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/quic.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce23168c038b002986be09884136996c8a6aceaf7b86d17548eef4f7418a39dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/quic.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ed104a63e05c4569810665d89e10e208ae3266309111dff85c987e6a851a7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/quic.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb27f58969549b6ac9010e65e37eb871ab7cd1361584269d0dd1447fa00938fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/quic.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"0516373272114bfc53a6d87ecfeb7a3743889ade3f0bb492ea729e29d3b5bace"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/h3.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b555c6549e04c654b70c26854a88f55192ce8c95b243fba981dd1a3e2e2df0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netlog/src/h2.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd50cf5ef94fd6dcafafbb54d1f4b542adc597599be63ebdeed2c928ed063443"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3756339ac589625b19c411bd7aeb0f6ea2418c22f7b01a270db4e3450cd6298c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog/src/events/mod.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c467e2074340dd5cc2d765913ba6fa9e54620d69db4af5e14e7014ebb7467"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/lib.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77ffe98c4b103a4712fce5dbb6e1b03b3c9e7bde940db250cbf3cdc227a02e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dc63f613fbd8455b878ed392e9a9bfed593bc0b1a364e208e97f1851be4915"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93ec79267c08b85cabe5ebad2d738d5afbe1731fff6632b18a0af2e8ba9cd24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ignoring unknown settings but could capture them \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":"netlog/src/h2.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be6604281e51e9718c6b160ce648fbeb7df5f1a5fa9d2f58622a6620ac53865"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace with \u0060next_multiple_of(8)\u0060 when stable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"octets/src/lib.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2c5a43828df13ca0cf8e10cd86cb3126b07af66515286d824588e048b5fbed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try and fuzzy extract stream id \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":"qlog-dancer/src/wirefilter.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f807b09145cc33b1803f3b5bef9a47d7cf5a86fb1d7acfdb09687ea234e86840"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: smarter filtering rather then drain / recreate \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":"qlog-dancer/src/wirefilter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47576f8c3a592df87fb92f425e581f73a40f9315796075bec1688b492ad14c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: clone needed to appease borrow checker \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":"qlog-dancer/src/web.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aa00b2255db1b1e5ce61414d6d268187ccd390141559b1297a018b6b57a9ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: support other log formats \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":"qlog-dancer/src/web.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f2cdc8261da41d1b2729114184a899f02deab1f53d23c5f14dbaad708e870"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: example of accessing richer data from a parsed log \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":"qlog-dancer/src/web.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03cdc8ea28ebccfdb594f34fc2473d9b5c3506f5bf3469959f74feeef48fa11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Gather these counts during recovery-metric processing. \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f70b1337f6d85c838986613e8a3c46d9a40fe2c5480ea4c72b3cbbccdab6d56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: netlog produces an array of missing_packets by packet number. \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf2b0dcf0a6c90aead900f4a90d20d3b9ab10a566d8c67d39cdca5bd439df0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rewrite to avoid copies \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fc92fb156f7f05746c607ba5183bc721043226f4a4de78df0097e053de48a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: hack. Initial window size can theoretically vary through \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce84adfd0e4ef62cf052961047d1a3bf53177b5f46e3c12a744bf32e7dab790"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid copy-pasta with h2_fc_absolute \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":"qlog-dancer/src/seriesstore.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed2071b25f2c04b8645ac3c4f1cbe117959e02de5de89a5a76a678ef2af449b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO, Option\u003Cu64\u003E \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":"qlog-dancer/src/request_stub.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaab55f44c0bb00d4ac878193cf238d579c7fcb60e9af7657ad29f21542f7066"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: case-sensitivity for HTTP/1.1 \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":"qlog-dancer/src/request_stub.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c4ecd8774f7c4d207c6f357808faa140dbaba68621229b6dfac9249d0f899e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: case-sensitivity for HTTP/1.1 \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":"qlog-dancer/src/request_stub.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91039fb14dee9dc7e4a368a5ae4a02fe9e39b1d0e765d0834475dd3fb8dccd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support more than one trace in a file \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":"qlog-dancer/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa59f3d19aae159e6da94f70fdbe911bcd56cf64b48280747e82d755510a9b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: netlog packet sent happens after frame, so we can\u0027t detect the \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"33beb8d49b7e8516755d20756c4d0edf30eb81bc9d25e70a16db43dbd574a4af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is reception of headers frame, before the field \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fc3b8f2e6f01f8c90fd13e1f7b2f6e85c8beeb4a74b2b7e91f76926fb5b183"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add support for logging HTTP/2 sending \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"115e552ac53cde476631ef04d42a6b6d2956b3f8e5229ddb3098710930b38dff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check ack ranges and rust \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226b5aa9b6578d48b859b0a08d7445ab7066d45f43caa4da80e2e804c1079c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is default length sensible here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0f8dbb6eafb87c8cb6df68335d32e1d8910751b120d87651c8c2acb3359045"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo replace vec with map? \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":"qlog-dancer/src/datastore.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d0c2b6159f13fbfac56f013aa792efcd13daf664576bfcef1eb7dff2f71d4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this seems to be required to overcome a transient error in nightly; see \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc7f32f34a0876ce7231e15936600100d2d9f01c422bb825f1250fe49ca8467"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only considers vert layout, needs to consider grid layout too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91c07295c3f04f702a4ca317a5b68ada44157519ed72f127cc32495a7ac8c7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace with div_ceil once stablized- https://github.com/rust-lang/rust/issues/88581"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f81f2f24e65b81596aa3539e0f0aea14d67d925c851ff4f5cde8795f52f9437"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO upload window \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5f3ce53e23b32c46d1f1e61b9e7c024169161e08682fb88142bf91cb238297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a hack because the underlying chart types make \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":"qlog-dancer/src/plots/stream_sparks.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca394e291dbbc81e199a2c6950429152eef042dcea56989fda98db8346386da4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this calculation with \u0060div_ceil\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/plots/stream_multiplex.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a15d61de1d95fd70ef1e4bcd88262b82d0af33bee95757590962127ecb0f60b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO set minimum \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":"qlog-dancer/src/plots/rtt.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2691e5fd3079b8ed09ec5f6c50e1dba818bcc26100b8174e1225ba785421d279"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO set minimum \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":"qlog-dancer/src/plots/congestion_control.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2545f0e0069d28c8e56e6077bc62cff74a21af4df92420e1ebc20ce2776bcd52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: put some stuff in series store \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":"qlog-dancer/src/plots/pending.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199304962c774f6d539f898c993fc2120cfcfcbaf952a49971edc019fd6eee3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: bizarre! From the docs, state the correct way to do this is to set \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":"qlog-dancer/src/plots/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed1701af4de10962bfa07689016911f553b794ceefcf89c5ba6e4a6d390b587"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8fb8c8711100b8727ae7336c85f66cd04677e9a1604bf01c84f5fdf970e662"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/packet.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"40451021fd3859ac2c10d27a5b0be5eb29b46b94af20e91d01bf5f082d99c11b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this a proper table \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":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc718be0ff72478e3132cac332da16d825240c257c805df30d259316f9784f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this a proper table \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":"qlog-dancer/src/reports/text.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"93874c70bc3ecc4f91c3110764ea2ab22415eaf6f7b710f4127055315fee626a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this more configurable \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":"qlog-dancer/src/reports/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6695f3c3c02418ed621a9a612c03e2d16a397e94ba17c233e65afd482c519f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: v.unknown_parameters \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":"qlog-dancer/src/reports/events.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d36dea08c0ab76dc2903af53427d6dffb420fd376a4bf375f962bd0a68f2d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use event loop that properly supports timers \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":"quiche/examples/server.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd773a4dc08aaf3dba978ef3751062151cf0909e8ed25e87e0998b6fbf2cbfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use event loop that properly supports timers \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":"quiche/examples/http3-server.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85e8a2e4fe787d7c08b1bad9a2f6d58b7fa39f987d911b164bf2d029f7bac76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parse params from file name. \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":"quiche/examples/qpack-decode.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80b347178122f0fa4769a1900a5f86ba47d7c2d574a42cc5c0b4ff9acc2f48c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sanity check h3 connection before adding to map \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":"quiche/examples/http3-server.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c66d1dac419643eb213b8d0ffde3acdbf13010120c1fded2552e6ba506632a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: decode preferred_address \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":"quiche/src/transport_params.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1974835077db5174b18abe51d33fc9dda4644b3f37f6643be830da727a154143"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: encode preferred_address \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":"quiche/src/transport_params.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b40a16f417277b67f56a6aa7535eee927f9a7528c11dce42b2328000a93cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO fix \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":"quiche/src/tests.rs"},"region":{"startLine":8587}}}],"partialFingerprints":{"codehealthFindingId/v1":"96face4ebf6af32c4ec1526b21f2472c0bb8955ac4e725d91fecdab2cdbf6503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use RangeInclusive \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":"quiche/src/ranges.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48835d7ee907fe1c57c06aa6cb39722339ce24c3187e9dd98b6faa8408ef7d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should check that there is nothing in the sent queue. \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":"quiche/src/path.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7736878c609293008897d3c1bd659e140f40abc9498d0b6030f4372f24931a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also consider unvalidated paths if there are no more validated. \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":"quiche/src/path.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d8ec607d58de0ef878b96bdb2487d5600acde089c1f0687c0f5428171ce5c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should iterate over all active destination connection IDs \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":"quiche/src/lib.rs"},"region":{"startLine":2941}}}],"partialFingerprints":{"codehealthFindingId/v1":"094bf2737cff9254734f5d35f3416464408174073b8f5831aed803beb7379680"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: in the future we might want to buffer other types \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":"quiche/src/lib.rs"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"264019afae6f382f7f02e62108513d161113b4101bb071305176eebce4db4f9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ensure that data is unique over paths. \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":"quiche/src/lib.rs"},"region":{"startLine":4703}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bb9a755243d8fc71a8f195cf3654695cef501472669d04327bdc9e70a49fc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO revisit computation if in the future multiple paths are \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":"quiche/src/lib.rs"},"region":{"startLine":7939}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded02c7df3c27fde48117d864a9dab1e1db31d04d76bd442855197ef34df9f48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement stateless retry \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":"quiche/src/lib.rs"},"region":{"startLine":8598}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e8af6c07d5acf272fc0473ae018c8e935b0a47dc47d01ff6c697a9c0647520"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: We do not remove unused paths now, we instead \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":"quiche/src/lib.rs"},"region":{"startLine":8824}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e857d3c6ae8005e3db64a810ea4ced6c02a4c9ffab493b944371f8519338cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reset congestion control. \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":"quiche/src/lib.rs"},"region":{"startLine":9071}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce6d30cfe0866e89b06fd4cbb50921959b298aaa6f7ad0d99ea8b12e511de79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: select more appopriate connection_code and application_error than unknown. \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":"quiche/src/lib.rs"},"region":{"startLine":9317}}}],"partialFingerprints":{"codehealthFindingId/v1":"05716a1b1068e91e616e873a898d4021d2dd1cce78d4c5e827c5dd385022b043"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: select more appopriate connection_code and application_error than unknown. \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":"quiche/src/lib.rs"},"region":{"startLine":9342}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8904a9300815e4a50664472c5338b6e882a07eff97e9e9fa56d44ec0574806"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pick the token type some how \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":"quiche/src/frame.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0aecd22a68af5459394236adf049673143b1348b1e53bc130998f58f23bcfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use actual variant not unknown \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":"quiche/src/frame.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b2c5a40f342e35f8561b2a4f1b631b0099ab42b8b141468a00b5960e2ff355"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement Instant conversion for systems that don\u0027t use timespec. \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":"quiche/src/ffi.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80473946fbd906ea7dbee0d688342a4107c7f4daf29fa795b0fd1b70c0c75b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement push ID. \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":"quiche/src/h3/stream.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b501fc82ed2fd1cb46a939b0d9a13b0f2d6bf2fcdc6d7bbb09b83707239c1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: properly propagate frame parsing errors. \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":"quiche/src/h3/stream.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa7a1aac2289a6978ae7cabaffaa9939a4a3e51860d0b6cf7e1c5971103344b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if stream is completed so it can be freed \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":"quiche/src/h3/mod.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"35084eaf62c0f52abeddfc6918e79ef470fd17978558e0d8c70bfca8ec1338f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: server push \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":"quiche/src/h3/mod.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"14beb3c8bd0998d14f257fd56b499625f17fb5b0dd731bbaffe562522635460a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: server push \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":"quiche/src/h3/mod.rs"},"region":{"startLine":4944}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb27301ddf4e50d4db2e6ab7b206cd2eabdf4abfbc853362e7a2596e7ab5974"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Server push \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":"quiche/src/h3/mod.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"082941e296105de0fa0510414a4492b2f238ecb0ef005f84c7cbf76c559abef3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we MAY send STOP_SENDING \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":"quiche/src/h3/mod.rs"},"region":{"startLine":2732}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe0114ed9e35fb76b61cfb9ee53f259ef4e4812a2499c3f66c7fa5738b32fd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement more checks and PUSH_PROMISE event \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":"quiche/src/h3/mod.rs"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef5dea587d23e98eeba587ec11da5e1207884e8b2698b05d507953e11a6171"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement CANCEL_PUSH frame \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":"quiche/src/h3/mod.rs"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef013dd10524ca26241d13c7f6c867b2ba1c1b7576118803ccf6642d46fd58b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we only implement this if we implement server push \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":"quiche/src/h3/mod.rs"},"region":{"startLine":3335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c9eae891c630eeffc97e39bd015d0bd920afbd384cd97883a2004d9310c991"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: QPACK instructions are ignored until dynamic table support is \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":"quiche/src/h3/mod.rs"},"region":{"startLine":5819}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f6b91cdd5e78d43cc9c7be308ddc15f240ffc0dd24b8c452822a6700e2ac59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need to notify resets better. \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":"quiche/src/h3/mod.rs"},"region":{"startLine":8529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bfc5ee31c0a54dffd3197e6d532611c0d40814219e47b564ad177efb297c29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handling of 0-length frames \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":"quiche/src/h3/frame.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"863d9c4e0cba532de847120db279201d04f3b85442e3adf6165e65914f73b430"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: process control instructions \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":"quiche/src/h3/qpack/decoder.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e39316eaeed167c420ba8b80a7f22cb2d30996b2d07bf142b5e2e58fac5d7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement dynamic table \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":"quiche/src/h3/qpack/decoder.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae9d6e4236b9b8ab556522617cbe2de0bc04f4f8e112690189a1b7b714f40c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement dynamic table \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":"quiche/src/h3/qpack/decoder.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36612547963aff5f7985d76086d518362db17da5aed79105855fa4068f9efca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement dynamic table \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":"quiche/src/h3/qpack/decoder.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1dea6be37bdd9eeb627551a2d617c5b140eccd2ec1e24851dc967fe41f8cdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement dynamic table \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":"quiche/src/h3/qpack/decoder.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"27944e05b0d419b7eaa8988e5c3e46c20c732ea888c8c181d9eeb74399a9650f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should run agains both \u0060congestion\u0060 and \u0060gcongestion\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/mod.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2fe4f429a557b345844832d855252d711285992e818d7719f46de2e33c4ea3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u0060enable_relaxed_loss_threshold\u0060 and enable this test for \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":"quiche/src/recovery/mod.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a0c39968ccfcb6b86213745f7ca70c367054c3d237588eab9a3041131ad583"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement \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":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"01efbad5ede06ed1b5484d5f29751644c026d7f6a2febc9ac9ba2c9a20e2ab49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only used by gcongestion \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":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b27f32b5b2f57760358e03195857fb5833f6a81a222118ab400c1ad12819104"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only used by gcongestion \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":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8d1eb7571fd54298583e65c481474c734237eafad27e56e97d4d8755a0f86d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only used by congestion \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":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0381fca1cbef7f0d224ab3239c60d5b424a761bc492e528a5934b6d41b39f66"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only used by congestion \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":"quiche/src/recovery/congestion/recovery.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"2195fa994565be2e0a31eb71acbb67ea2f5463420119a07a062d5a1089258edf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only used by congestion \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":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cdf6f70b2119f59c57b5f6d437bfdcbca8badcbc8a585817e2f0533b882d50"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME only used by congestion \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":"quiche/src/recovery/gcongestion/recovery.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a04e5564a6b366fbbde992e5cc2ea660169b532ee2035c8e49bd6e200608ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): \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":"quiche/src/recovery/gcongestion/bbr2.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f248153b27431321fb38d0f58761ec18c40d1a7e8e5ffccd20cf3db044de499d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): is this true? \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":"quiche/src/recovery/gcongestion/bbr2.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee9d4fe1fb2f2aaf1aa1b7875f1f979b15c4f2ac223b9f16cff265dfb3efe67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): Choose a probe wait time. \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":"quiche/src/recovery/gcongestion/bbr2/probe_bw.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8000339581c8201b2b783bdd2a92c27f1fa7ba720a023eaa35b68e0109a8ea49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): use BytesInFlight? \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":"quiche/src/recovery/gcongestion/bbr2/probe_bw.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55a264b90058b0175fd626f8bc46dcd48eb7b91fe3edf65e661a349717d75ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): probe_up_simplify_inflight_hi? \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":"quiche/src/recovery/gcongestion/bbr2/probe_bw.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"c335c636ecd22f62f751171e8659de6e78a170cb300ec3a4153945bac3a19860"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): BytesInFlight(send_state); \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":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a91e7d4cbbd97faed7f9da3aa5457afc3852e148b7bec158caa50a09662d18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vlad): 2 * mss \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":"quiche/src/recovery/gcongestion/bbr2/network_model.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"048901dc5f9dae425495e506118e10628927db94ade163b133e4eb1094e3a28e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the early data context should include transport parameters and \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":"quiche/src/tls/mod.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d11e3571375f01ef0b10f4062158939b4b7164d331e9aca88ca996b1df08a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(evanrittenhouse): support POST requests \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":"tokio-quiche/examples/async_http3_server/server.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"47472f9fc7b046ee6ac5e17633e1d9b74699160917114a9f4f7418da34f86058"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use the _priority input parameter in request handling \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":"tokio-quiche/examples/async_http3_server/server.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"656afb70b7660e6e03351a768064f281cf1140f12bc9d908d0e0223b089ce016"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rmehra): explore if these should really be Options, or if we \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":"tokio-quiche/src/http3/settings.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd11f7e2515a1d78932a630a349238e176d1b98b7eb74b82ca51bef2ab4bffe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The server sees \u0060h3::Event::Data\u0060, but it contains an empty \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":"tokio-quiche/src/http3/driver/tests.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9958a934b2e6e69db81255416827466596f1d387aab8d1db079f639ea40b29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It would be useful to receive FIN here, but \u0060quiche::h3\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/http3/driver/tests.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba848313390fbf8b7a0d9fec571ed3401915d5db3eae65a92f79f38db13fb80d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not produce \u0060Disconnected\u0060. The test channel has \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":"tokio-quiche/src/http3/driver/tests.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"20adc29291aadff59c3af59941359a4735c3f6fdbf524b341bb2e6ef55f87ece"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would be nice if we could receive the fin here, but that\u0027s not \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":"tokio-quiche/src/http3/driver/tests.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dc405a7d24373bf2fff25dd30ed703bd3b5f1970d39a5c83428f88b70c0d38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is a bit finnicky to test properly. We don\u0027t want to run a \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":"tokio-quiche/src/http3/driver/tests.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7956df304c5790ef63b81a4df1b4877f7ba75205c32cf79e3c60b0d2c0ba9d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We just run a couple of times to \u0022make sure\u0022 all pending work has \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":"tokio-quiche/src/http3/driver/test_utils.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c0a7f1a0233f10177983baaad85b1ac80ee59ca8d1874a60f820827f77d10b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally, the application would still shut down the \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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9cfbb4bcb8a5f1c1cc21730482bfb74cccf1c616b2c924cddec4883792256d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally, the application would still shut down the \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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"db72f190149a0414d8b77eefd8d096d48eb8e134f98e81c41a6c62d0be540cf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we send an H3Event event to \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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd04ab5394e56b3f9afb5c12c40ab40cba138a6bbe27ca62a6f8843c941515ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if we don\u0027t have the stream in our map: should we \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":"tokio-quiche/src/http3/driver/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e2dc805edabbf94ff659c0a8176ac278f7e07458fe9dca82af57add28b00f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: does nothing at the moment \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":"tokio-quiche/src/http3/driver/connection.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d4b358dfa7e5156c163000538b43d072753e4732fcd7de8e6b133b4322c33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: does nothing at the moment \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":"tokio-quiche/src/quic/connection/mod.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0b99706380a80fb303941898b4c0010c3ca92075610ebce7b30df1c02bf98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(fisher): send better error to client \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":"tokio-quiche/src/http3/driver/client.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73df94cc53470b9f3eb37fc63d8dc85368cbfddd196e3f51826f5cd4fa05f99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(fisher): better handling when an unknown stream_id is \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":"tokio-quiche/src/http3/driver/client.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774889fb684d3c2a21804f4456b8069c571a7b0dab53003b91cacf6d12aa028"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try to read Tx\u0027 SocketCaps. false is always a safe default. \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":"tokio-quiche/src/quic/raw.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b403b046e5e8771aa6da96130fe704ca9547e1587fc88827983590fb83a69b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Does nothing at the moment. We always call Self::start \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":"tokio-quiche/src/quic/connection/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5d7f607b9791cc8ed9fbff884402534cb26214e23f33e44909e8750cd985c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(erittenhouse): Decouple \u0060wait_for_data\u0060 from the application. \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":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b08aa5fd4fc3a1e1ec6cc908a8f33528dc8d7551ea3d5ec627ed36092384f40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this assumes that the tidy_up operation can be completed in one \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":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35bdba6682ab9945a94ba9751837955b6bf43b29f21f028331bcc524b3ddb78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the router module is private so we can\u0027t move these to /tests \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":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81d40e9ea63b804dc5d3c3230d79a605bfa97c71482228a48d2ad88226359a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rewrite tests to be Windows compatible \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":"tokio-quiche/src/quic/router/mod.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ce2987d20a1462a1f40289535aa967d154431b6f5a34e3e2e144c160e03cf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Gate this variant on the \u0060rpk\u0060 feature. \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":"tokio-quiche/src/settings/config.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5728842823b9d4100e01222671163c95d063189864d3a3b35ff6041bb53dbcd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(erittenhouse): use \u0060dgram\u0060\u0027s SocketCapabilities when we migrate over \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":"tokio-quiche/src/socket/capabilities.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"49729ff954a58a3c01100f2f440b7b399c2e73ffb8fed8198c7510d2a9901978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(erittenhouse): figure out a way to avoid all of this duplication \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":"tokio-quiche/tests/integration_tests/timeouts.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b4e56e4b9b21857b6c495d5888404b39bf15729a1cb0f95dca32cacdc610a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use the synchronous h3i client to assert that CONNECTION_CLOSE was \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":"tokio-quiche/tests/integration_tests/timeouts.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"847434ee107610a3e784de1d26d386bc3730ed9e770e28f240740855cf38e470"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: migrate this to rxtx-h3, copied from examples/client as a simple \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":"tokio-quiche/tests/integration_tests/async_callbacks.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96f50cabfd3871a14c0c350623d86a5c7cdb9eda3ed23452f389c6b3551c3b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: migrate this to rxtx-h3, copied from examples/client as a simple \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":"tokio-quiche/tests/integration_tests/async_callbacks.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1a7e59e72d5187dd4b5ef1002463698df7b6e7071bdde6bd5bccba73c23423"}},{"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":"Duplicate function signature with different parameter names (fd vs _fd) in the same module. This suggests copy-paste error or unresolved conflict.: Remove the duplicate entry. If they are intended to be overloads, ensure distinct signatures; otherwise, keep only one. (signatures: datagram_socket.is_nonblocking(fd: \u0026impl AsRawFd): Result | datagram_socket.is_nonblocking(_fd: \u0026impl AsRawFd): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91d7726027d0f57ef987427a9320aad9c1e5f116847650a51a536da5bd8d3e1b"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous intent between \u0060get\u0060 and \u0060get_empty\u0060. It is unclear if \u0060get\u0060 returns a buffer with existing data or if it is an alias for \u0060get_empty\u0060. If \u0060get\u0060 is the standard allocator, \u0060get_empty\u0060 is redundant or confusingly named.: Rename \u0060get_empty\u0060 to \u0060get_zeroed\u0060 or \u0060get_clear\u0060 if it ensures zeroed memory, or remove it if \u0060get\u0060 always returns empty/cleared buffers. (signatures: buffer_pool.Pool.get(): Pooled | buffer_pool.Pool.get_empty(): Pooled)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"441a2deb9e5620b20ddaf4286b610031caa996cd613e8bc481d7642225fdc9f8"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent error handling for similar operations. \u0060ConsumeBuffer\u0060 returns a boolean (likely success/fail), while \u0060DgramBuffer\u0060 returns a \u0060Result\u0060. This forces users to handle errors differently for conceptually identical buffer manipulation.: Standardize on \u0060Result\u0060 for both, or \u0060bool\u0060 if errors are unrecoverable/panic-worthy. \u0060Result\u0060 is generally preferred for explicit error handling. (signatures: buffer_pool.ConsumeBuffer.add_prefix(prefix: \u0026[u8]): bool | datagram_socket.buffer.DgramBuffer.try_add_prefix(prefix: \u0026[u8]): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d9c77b87aa9dd2d65201026373066aaa24d58e450bf87b51bd7a9d36d6c3f6c4"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return types for \u0027as\u0027 accessors. \u0060as_raw_io\u0060 returns a typed borrow (\u0060BorrowedFd\u0060), while \u0060as_buf_io\u0060 returns a \u0060String\u0060 (likely a name or path). This breaks the expectation that \u0060as_*\u0060 methods return references or borrows of the underlying type.: If \u0060as_buf_io\u0060 is meant to provide access to the buffer I/O interface, it should return a reference to that interface, not a String. If it returns a name, rename to \u0060buf_io_name()\u0060. (signatures: datagram_socket.datagram.DatagramSocket.as_buf_io(): String | datagram_socket.datagram.DatagramSocket.as_raw_io(): BorrowedFd)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"986d0057f09fe94ed43b1fe9ce2bff91c76ab1e14a7fd8fb9b5a54708266329f"}},{"ruleId":"D22","level":"warning","message":{"text":"Naming inconsistency between \u0060send_headers_frame\u0060 and \u0060send_headers_frame_literal\u0060. The distinction (literal vs encoded?) is not obvious from the name alone and lacks a consistent pattern (e.g., \u0060encode\u0060 vs \u0060raw\u0060).: Use consistent suffixes like \u0060send_headers_encoded\u0060 and \u0060send_headers_raw\u0060, or clarify the distinction in documentation and naming. (signatures: h3i.actions.h3.h3.send_headers_frame(...) | h3i.actions.h3.h3.send_headers_frame_literal(...))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5d8f1225d2eebcd12f4cd287f897779d34c359d452d87749f7d7e1bf674c8119"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 12 project(s) overshoot their size bounds, lowering Project Cohesion to 8.3/10. The most over is \u0060quiche\u0060 (60499 LoC, 144 public types across 11 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6050b42c5315eeb8b879bd0b4cdf017b0db2cf4bf817a071e924b597eebe29c8"},"properties":{"commitSha":"f8cc6fe1dbc6d592109a819d911c3d6ed559fb8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b431a7ebd089384f3d38f3c78e211f2fcde864739bd37ff3ce086df43c65d9f7"},"properties":{"commitSha":"595d0c30a51720d96b6c2ab8c86d71c911f8ea7f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3638f833089a2317ddb8c4c41e205c8625bbeeeef093d3ed081ee68b843e045e"},"properties":{"commitSha":"c84d2d87d4e343e488580b326c6d40abbee9aea5"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2562e99f2c55118df2fbb46dfb9eaad48fc7f8013eada9a3a764f4704ee591ab"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e9e69e61d08dd7d07f8ba2881099eb4eea2e4fbc49dbf4d7d3564f88f7b42ef"},"properties":{"commitSha":"e2e1d16a66ace80d5bf117702d2681883f2ad7f3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42a1c4ebe72248df80eb6bb07c73d01065eb634b66f4de6f601a5e77074b81dd"},"properties":{"commitSha":"b5333de36258289737f5e2abc8f1256238349e37"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"867895ed91568f08d22c3218adff266f9f8f65a35c9145092e7df3072fc67623"},"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":"c2338e628bf5619b4ed465692e48f4778c366d3d19537b8c4388445df63e686d"},"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":"513bdef7258d378692ab9561fc49bf6224abf3671b8eb69beb72a12164440a87"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6435d5c2d5337af1cefba60a5167ded7e2fe5d198de45e1d9a4a0d16cb26a669"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"8960f771fc367f7f29fb85fc3a8efe13be37c7de263a15d5b599c95f94db7da2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b5a9f4e655ebcdf7a4201960c87fe0249e69a31245ae2966b42cc369d51d6b3f"},"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":"1fdeb10ce2b6bab8078a847d7baeb42e46adaff18d0c44d9b77c6bcf011efeae"},"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":"1a6b8b872519c6a5282831f912357468728707ae31f71d533316c5f1e541ba23"},"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":"3057f36408e3835e661e6750eb098245cba1f77d354a251cf13bb9ff6f0cf558"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9e306271469e9f0db638b98d17e1b0ba4bb72ee3a9146031a33cfa227d985605"},"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":"81dc505d2ad47253a4aac36ff7bdbc37f6b99fc4451363bfa8d62d10749c0d13"},"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":"80c2bf1d466892291ba85cc101ccf6fcd665a2b2599897b48d8da676a87434fb"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"03f2bb1675d5ef0f644aeec9c6a5df645cab42c5fa88e90970eda810b2696257"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ff452b5b7d17e833c0124a81575840d0a0fba53b39ad2120686e62be9fe5e475"},"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":"8a0ada6a5cd6502ec83b8b67073393841aefb1f6ace0f0515cf0e7d3f713e123"},"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":"00e9d89739d4291ec78f90dfffe6ffbd7fb5161a247de265f493f6422b3bf3f5"},"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":"9cc7e83f49625dca55e13f688f324b00d445301625e15aa6e132f91288f64eff"},"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":"4b1088874da2302958c256a0649668ff4bde8c79231629b5db5eeb09906f6e8c"},"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":"36a4ebd895855ec0ecd027aa760c401892d85edf9c9c32f861303d536270ad76"},"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":"acc9b684c099a17cebe5892463e4b44e444e59434730b5183032b1923105e828"},"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":"c614efaf9f871559b104e5a7558c786f8cf77fbe2a8a965592e805425d15c956"},"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":"8f6d6aae511ad1d025968b003ed9ed8c6e018c19c6b56f67fb2551391290a1b1"},"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":"1d6bfa84f27111b096b516029e3a66e103fc999aa3a181bf03dbc8897282116d"},"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":"19915eedba3fef5f554be10a73c2df0466a2304f9dd6630aa17b420aeaa8499c"},"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":"b66155cd0f4453fb83f2d6469c83fca218b63029d3f6e12d43b4a0e42cfda024"},"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":"6dcbe67b9edfd46d67d44f05d9d01c6131004fcd8e4307560d19009bea7625d6"},"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":"08803f4c4ee6d79e439e128ba7ccae5bbb14b406cd78cfef7a867ec2148c83c7"},"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":"cee69c439bebd9fee93a07cf8fda19b39cc858f36048dc62cf264767c9cf3eb3"},"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":"3c3b3b691b1524c8f13e29b5990f3c167fddee54d156008d382f49d839a991e4"},"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":"0b4cbd4740f005623fd5d8e5ee3fa9d4d1b8e8ebd7279fff63dbdd331ad7f20b"},"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":"a239d5cee969542b16a0e1db12245e6d001febeced38d3785a0021a6df7b7111"},"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":"9d3b197ac4b6e76dfebd0206fc74b45e0a7ec88ea2c54b7965e00a3cff871ff4"},"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":"ae975a378302d3f1381ff93ddb50d7c4e853cc49fc340c2151e5891fe7424657"},"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":"df86aa93c4cbdd520b256324ef4d715a02f7dc1e83b0e5b30ea4bed7f406a141"},"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":"603455e101f846a6a8650eeec2469e284f47e575250321f04a9bf493f9014549"},"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":"6a3958dc3eb93e722ad60d9c1988694afc45d7c71fe717cb0b8146be1deb6a07"},"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":"bc51fe9d61f5a8b9e1a30c88616e21dfc6d932406073100feff5ab0e0afbe9ff"},"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":"1ff2c16cc380dbcb5cb9afacb5172d97e5392886b72d1fe29135abc131fae947"},"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":"77b4bf83cf5180e1911ceba83b0b5cbd67977aa47b263d72b59a9c298705362d"},"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":"4554a4ea03d8ce853e12ac00d6fd8d5191b0f0363e9d1033968262fa5e68a591"},"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":"9c5bed86c207d9c2e37a06030f93257706f46e060748ea567556f15a60cec6bd"},"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":"fd4fa69f9a157a0b1d0fcef8970ca52225540daa61fd01692562edf7774b4400"},"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":"ecb1d8f81722eb96510a5b46cfb8ad6418fe44acc446df4226cef94717a8c357"},"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":"cc09c1ce804f5b99711651d2a0a37f29eb134fba54c36ac3b1fac607d25e54b3"},"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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"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":"fe2eddb22a3e95eb24f503d1f049a650714e01281efdf252fecd434c07926a6f"}},{"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":"ddc1b4400e1cb5247b20303320ebcafc8bccd3b83f8f7876572ca86e8affb6b7"}},{"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":"9a633b13eced664f3194e12ffa5ab0514fcf8130682a5cc2fb94f8789b1d251d"}},{"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":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"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":"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":"bdb58f8c4e0ca9e6d66ae7091beea32a6f96312b92fcd496d9643c7529736c52"}},{"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":"15672dd3529e1374b77f4dcff0a7d53e58455889df07ddca4c96ec9aa88a2929"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"datagram-socket/src/datagram.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8214c0d720f972b9b60337a11503562fb6f5240d3bc1a1b0070ad87fc9a7c951"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 15 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: quiche/src/minmax.rs, qlog/src/writer.rs, tokio-quiche/src/http3/stats.rs, datagram-socket/src/mmsg.rs, quiche/src/recovery/congestion/hystart.rs, tokio-quiche/src/quic/addr_validation_token.rs, quiche/src/recovery/congestion/prr.rs, quiche/src/recovery/congestion/test_sender.rs (and 7 more) (16 orphaned of 163 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 163 of the 180 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: recv_buf.rs \u2194 tests.rs: \u0060quiche/src/stream/recv_buf.rs\u0060 and \u0060quiche/src/tests.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060a64d9721\u0060 fix connection flow-control double-counting from zero-length STREAM f\u2026; \u0060e97798e1\u0060 tokio-quiche: make body_recv_buf max size configurable, default 16 KiB; \u00603ca46b77\u0060 tokio-quiche: size body_recv_buf to contiguous readable length (#2547) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/stream/recv_buf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"949fb5e98079658647bbf885214ed0c7dd690eb048220003e58395067a460618"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hystart.rs \u2194 mod.rs: \u0060quiche/src/recovery/congestion/hystart.rs\u0060 and \u0060quiche/src/recovery/mod.rs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060754e328e\u0060 recovery: merge epoch data into a struct (at that commit the file was still \u0060quiche/src/recovery/hystart.rs\u0060); \u0060a22bb4b3\u0060 packet: refactor Epoch to be an enum instead of usize consts (at that commit the file was still \u0060quiche/src/recovery/hystart.rs\u0060); \u006056edda76\u0060 recovery: remove ABC_L constant and its logic (at that commit the files were still \u0060src/recovery/hystart.rs\u0060 and \u0060src/recovery/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"quiche/src/recovery/congestion/hystart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeea9f63508513a7146071144b754a36ce39e937799f7e28cb5706719cc2eb7b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: quiche-server.rs \u2194 client.rs: \u0060apps/src/bin/quiche-server.rs\u0060 and \u0060apps/src/client.rs\u0060 change together 55% of the time (18 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u00605f00e83a\u0060 path: add PMTU path event; \u0060b6fd412d\u0060 Expose initial RTT config in \u0060quiche-client\u0060 and \u0060quiche-server\u0060 CLI; \u0060d707c50e\u0060 apps: more workspace dependencies \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/src/bin/quiche-server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9565c4167209d142dd3464be7a42ef8bbaee06a60b36196cd30f1e16d582616f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: worker.rs \u2194 acceptor.rs: \u0060tokio-quiche/src/quic/io/worker.rs\u0060 and \u0060tokio-quiche/src/quic/router/acceptor.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060736d0deb\u0060 tokio-quiche: box quiche::Connection to shrink async state; \u0060444fb3ed\u0060 tokio-quiche: Refresh connection IDs in IoWorker::work_loop; \u006031766ebb\u0060 Add TimeHistogram for time spent in the sendmsg loop (#2223) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tokio-quiche/src/quic/io/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ea8ec9ab14929c41262d2814e62f0583ac57d68fcecff7a402a8c80d35aeca"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/index.html"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d75213b5716d1f7def6d71ba8f2160d5edf0e29725a05123451bcc7497b556"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4288df14785532ac3b021fd83d4690cb8862bd86b20b514e887e5cff745089"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a766dd365b7f5006176a572c0192cba7937f57cca255abf4034bdec2e9384db"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f579a13c8e3231637b35635b8f9e91a81a01c6bd99947d8d2a817a3267f9b4"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://code.jquery.com/jquery-3.7.0.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository. 3 such include(s) across the repository\u0027s markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"qlog-dancer/index.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a5c4fc7699e4ba5e12e24c674b3d61c82f1d35364b0eb2452d50245d11ad2d"}}],"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-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.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-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":64,"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."]}]}