{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"salvo_tus::handlers::post::create (cyclomatic 65): salvo_tus::handlers::post::create has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35ed6f7802604277e442c8ddb9d6860ff57081819b80663e3890d5965b6361a"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticDir::handle (cyclomatic 56): StaticDir::handle has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/dir.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"33760eb50381afd803415ef7166a8d184bf1ae9059d667856ed2aee7c4cfb39d"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestDeserializer::fill_value (cyclomatic 52): RequestDeserializer::fill_value has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/request.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5134da709a64017d50cdc2cd588b94cde31630cc3da81acccd65af9f9279c0"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_oapi_macros::bound::with_bound (cyclomatic 40): salvo_oapi_macros::bound::with_bound has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/bound.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e456134dacb84825a85223519e7eded5b27b1f60c530cf414eb238d0f1ddd3"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_tus::handlers::patch::patch (cyclomatic 40): salvo_tus::handlers::patch::patch has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c1b8404c32a7b0ed8ce0b8e21aa036d4ae467059b07f0648f2bccd33452f98"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentSchema::non_generic_to_tokens (cyclomatic 35): ComponentSchema::non_generic_to_tokens has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2961c63f200bb9914f53a46f4881640fe184a96cc03e7fefc5d64b4a36efef"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedFile::send_inner (cyclomatic 31): NamedFile::send_inner has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"af91b27375ba1c0e719f498e5a2a96df9cec08b34fe7db1be0dc9d2c9c5917f7"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedStructSchema::try_to_tokens (cyclomatic 31): NamedStructSchema::try_to_tokens has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f01cbbb3552591621528ab9934458b469e57eaf32807d142b215e01b7ecfe9c"}},{"ruleId":"D1","level":"warning","message":{"text":"HyperHandler::handle (cyclomatic 29): HyperHandler::handle has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/service.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"620eade3c22dcc070201ac3875fd02f55546e0df6f853883d613a0eeefa937fd"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpBuilder::serve_connection (cyclomatic 25): HttpBuilder::serve_connection has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/proto.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8511d92fe3abfc1becfcbc7ece494125efb8a789fc99302b17d6423d9adb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Proxy::build_proxied_request (cyclomatic 25): Proxy::build_proxied_request has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1194e9e260bb45e70e270b73e5b2d488d18ac55ed10d9238efac82e09e470c10"}},{"ruleId":"D1","level":"warning","message":{"text":"Compression::handle (cyclomatic 23): Compression::handle has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e5bee9d530e92ea49e44d4f1bd45556f8facdc8150e5cbfcb0a6ac5f8e19a7"}},{"ruleId":"D1","level":"warning","message":{"text":"PathParser::scan_wisps (cyclomatic 22): PathParser::scan_wisps has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8403d9a2e85b8afabacb528c57b3f1efba6041042ad6ab0bc4163ecfee6149f"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::serve_connection (cyclomatic 21): Builder::serve_connection has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf8098c32416c72ef23244a2d47c5b009d5785e9e65204de3d576dce42dffe7"}},{"ruleId":"D1","level":"warning","message":{"text":"UnnamedStructSchema::try_to_tokens (cyclomatic 21): UnnamedStructSchema::try_to_tokens has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b4b1a4eb66994a0deab7549a9d930bb683d55d0d1f42df70a03cf6501ce425"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::try_serve (cyclomatic 19): Server::try_serve has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bf1f06da987e36d9ba9431781a259730240d1496857de100405b621e30ff49"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_macros::extract::generate (cyclomatic 19): salvo_macros::extract::generate has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/extract.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace38617bb550587348cc35126364ae3e697d364c2640ff9ad7b7d5fa8ea2999"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenApi::merge_norm_node (cyclomatic 19): OpenApi::merge_norm_node has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7494b6a8140123c2b1bfeac250bbf384ccdac905ff2670af0ef2b7f716ac09d"}},{"ruleId":"D1","level":"warning","message":{"text":"EndpointAttr::parse (cyclomatic 19): EndpointAttr::parse has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/endpoint/attr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3814ce7fc8d410f712b59fb05e8b785844cc1d1583a92711b5dd5d013235e1c9"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_tus::handlers::head::head (cyclomatic 19): salvo_tus::handlers::head::head has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/head.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b047932286a9dbc8f63f04673983f024b49a1fbccdf9d39e436a1010076d8"}},{"ruleId":"D1","level":"warning","message":{"text":"CombWisp::detect (cyclomatic 18): CombWisp::detect has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"953c37f21f482f2107368df4290113b02cf22cc6a7f6b98486f5a575f8df814c"}},{"ruleId":"D1","level":"warning","message":{"text":"NormNode::new (cyclomatic 18): NormNode::new has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/routing.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f468965d8b97842170ee9b552dc7ea91a0bc22818cbb91abd404652aa19d96"}},{"ruleId":"D1","level":"warning","message":{"text":"ToParameters::try_to_tokens (cyclomatic 18): ToParameters::try_to_tokens has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/parameter/derive.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"798349f1acafdf8c21bd41ceac9a32d6dc39d9ea13fa52d22c4269a4d072a27f"}},{"ruleId":"D1","level":"warning","message":{"text":"ResBody::poll_frame (cyclomatic 17): ResBody::poll_frame has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/res.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0da24ce40b005cae8dafdfd2744e4247646388296446cfbcd4872daa8f26ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadSeeker::send (cyclomatic 17): ReadSeeker::send has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/writing/seek.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc7c81e0a0b01f3307683fc81ca619ea4667a6f300a98727a8e6235abf4539b"}},{"ruleId":"D1","level":"warning","message":{"text":"StraightStream::poll_write (cyclomatic 16): StraightStream::poll_write has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (StraightStream::poll_write_vectored) 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":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0e499e5fcf06ae3f0c4eca3e418229ed51e53f3baa095848d01b84d9aa138"}},{"ruleId":"D1","level":"warning","message":{"text":"StraightStream::poll_write_vectored (cyclomatic 16): StraightStream::poll_write_vectored has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (StraightStream::poll_write) 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":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966f4ec0b4109b0f960c2425003d66c9310dd54a79ad5d8a78fd5d8c2726ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"Operation::modifiers (cyclomatic 16): Operation::modifiers has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7c2e94f7175802372939634592d2bf9f53db244bf420206c2e6fa7f21c4a41"}},{"ruleId":"D1","level":"warning","message":{"text":"SerdeContainer::parse_attribute (cyclomatic 16): SerdeContainer::parse_attribute has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serde-util/src/lib.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea3bfc9d548c84801ab87cd2301c09e0ee3d6c58b4372189e571c8a21a9eddc"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDeserializer::fill_value (cognitive 183): RequestDeserializer::fill_value has cognitive complexity 183 (threshold 15). Drivers by points: if/else 38 (132 pts), loops 9 (41 pts), match/switch 3 (10 pts) (nesting depth added 133). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/request.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a88b83fa3aea20a6fe146c8796b7f820b95ba103d613fdec5ef709138da79a"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticDir::handle (cognitive 164): StaticDir::handle has cognitive complexity 164 (threshold 15). Drivers by points: if/else 45 (132 pts), loops 6 (23 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 105). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/dir.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ccc4eeec6dd59d56883295013c1e448f8f6d011b2bcc5ee36cc81f3040f20c"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_tus::handlers::post::create (cognitive 99): salvo_tus::handlers::post::create has cognitive complexity 99 (threshold 15). Drivers by points: if/else 33 (55 pts), match/switch 13 (24 pts), boolean chains 16, loops 1 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea30145d40c5f9e2c280d8a9db6515b9a3e5a362e7ac062111f5fba22bc75ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentSchema::non_generic_to_tokens (cognitive 84): ComponentSchema::non_generic_to_tokens has cognitive complexity 84 (threshold 15). Drivers by points: if/else 34 (71 pts), boolean chains 10, loops 1 (2 pts), match/switch 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"348000575e49f899b556cc347e1967be6f100bc6762d6dae6a8d718a1fd36f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser::scan_wisps (cognitive 73): PathParser::scan_wisps has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (66 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c87826eb5ca45a7e9016f1493ecd107cb807749fd4bd51a699bb6ac5762861e"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedStructSchema::try_to_tokens (cognitive 62): NamedStructSchema::try_to_tokens has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 6 (16 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d4cacaa3e4c38b7b00ae7119159ceee1faa40a6fdd55f1c6682347019ec233"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpBuilder::serve_connection (cognitive 61): HttpBuilder::serve_connection has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (40 pts), match/switch 9 (21 pts) (nesting depth added 37). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/proto.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d08c9391307ef86ccadc576fa81605892d3325c66d8602e217dddd4a60f6883"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_tus::handlers::patch::patch (cognitive 57): salvo_tus::handlers::patch::patch has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (39 pts), match/switch 11 (16 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0a684b653b8fd0506d080fd92ecebcd7ed1fad8b95a79a3e70c84b578b837"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::serve_connection (cognitive 53): Builder::serve_connection has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 10 (31 pts), if/else 9 (21 pts), loops 1 (nesting depth added 33). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbac8952497e808324a860db4016ffc4e7657c1bcb6877f8d1c75019962f8f90"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedFile::send_inner (cognitive 47): NamedFile::send_inner has cognitive complexity 47 (threshold 15). Drivers by points: if/else 33 (39 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c283f2c1f2086a8b28145fb5071e91b2496dadc7ec15e7c6c5000a67f0d601e2"}},{"ruleId":"D2","level":"warning","message":{"text":"CombWisp::detect (cognitive 44): CombWisp::detect has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b046b903f6eabe0dc4576a7a2b6a2e7dcaef5c95cbbc9a73b3f9ac54edfaac1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::try_serve (cognitive 41): Server::try_serve has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 6 (16 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9ffa3415e2b50257f1eea7a743f44d2cc65ce3f74a0c2d6a58cf627c7055fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy::build_proxied_request (cognitive 40): Proxy::build_proxied_request has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (28 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"da20184c707b0d0cbb41597756f719854a920d54f86f07c94662c1eb0474c667"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperHandler::handle (cognitive 39): HyperHandler::handle has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/service.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"154e82a87c222da76b749d02689f819f948a3351fe1a170c00cfa3dbe1a4de1d"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_oapi_macros::bound::with_bound (cognitive 38): salvo_oapi_macros::bound::with_bound has cognitive complexity 38 (threshold 15). Drivers by points: loops 10 (20 pts), match/switch 6 (8 pts), if/else 5 (7 pts), boolean chains 3 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/bound.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"db521701c93c082aed6a788b330c455052c3812ec3738d0971a7d3e72382ded5"}},{"ruleId":"D2","level":"warning","message":{"text":"Compression::handle (cognitive 35): Compression::handle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef79118d0397b05a75417af72c5534a3bfe4a0332d823be9bcba40982ea6a0"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_oapi::routing::normalize_oapi_path (cognitive 34): salvo_oapi::routing::normalize_oapi_path has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/routing.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9870e8e00338155a3a93d9182ad46e8290181fcdc27c7330e43ab63f88f730"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeStream::poll_next (cognitive 33): EncodeStream::poll_next has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/stream.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e716319add329c839ce29da3af6494facb5fa662e71777c6603125a740b27a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenApi::merge_norm_node (cognitive 33): OpenApi::merge_norm_node has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (11 pts), boolean chains 4, loops 1 (nesting depth added 14). Of this number, 30 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24331a13d7dec1ac7c60b47cf3a55a8bd9f63af84a6ae9df18b18e6fe9770ce"}},{"ruleId":"D2","level":"warning","message":{"text":"StraightStream::poll_write (cognitive 31): StraightStream::poll_write has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (StraightStream::poll_write_vectored) 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":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b6706e2b0788249c0c8a0c512055bae0401b75e63a3f1b5b3817449660e27a"}},{"ruleId":"D2","level":"warning","message":{"text":"StraightStream::poll_write_vectored (cognitive 31): StraightStream::poll_write_vectored has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (StraightStream::poll_write) 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":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e2145b2803440725a0f1c015703ffbe8b1834c4e92e76b3b267c188971c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"CharsWispBuilder::build (cognitive 31): CharsWispBuilder::build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (31 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d33054e20c405b864566ff47f21c29a17f78b2246de85e84945c14c86f98708"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_serve_static::embed::render_embedded_data (cognitive 27): salvo_serve_static::embed::render_embedded_data has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 3 (9 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/embed.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5476d474b7455807b66f9773d2e0566297369e02ba20f2f7c2ae22c409b9ff2c"}},{"ruleId":"D2","level":"warning","message":{"text":"FormData::read (cognitive 26): FormData::read has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/form.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b798503f216db5ad539cd422b43b4a15794facce030ccb24999b4b19f88f8851"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpRange::parse (cognitive 26): HttpRange::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/range.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"388eeeba7f0972c4ba002dcb97d2d1a617f3b03d2ce00027a5a515c81db400d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Operation::modifiers (cognitive 26): Operation::modifiers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc94c37bd86ccc285defc1f4849874e7bc4f4a84e3b44df2ca22633446edbfa2"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_tus::handlers::head::head (cognitive 26): salvo_tus::handlers::head::head has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/head.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f7772d044d4ef9e412c755c0d3ea34def5c11c98b94bd12a5f3ef8d2e42e58"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponseTuple::try_to_tokens (cognitive 25): ResponseTuple::try_to_tokens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 5 (11 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3f80a3feacf4945daf645b5b40e9651d5eed480fe62f25dc895f1db66f2a89"}},{"ruleId":"D2","level":"warning","message":{"text":"CombWisp::new (cognitive 24): CombWisp::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3c7bfa527d37ddc1240c0b073a8086bd7235b2f596aa12126175517c411edd"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_macros::extract::generate (cognitive 24): salvo_macros::extract::generate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 6). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/extract.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d801f4355df7c3b67f8aebc539c4b3d7585861a7d20da35e11763e7a81ade0"}},{"ruleId":"D2","level":"warning","message":{"text":"FlexNamer::assign_name (cognitive 23): FlexNamer::assign_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/naming.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fb6de6ddddccde8560ff5e408facc518cbdf349bc435d01402ffe3c21f7526"}},{"ruleId":"D2","level":"warning","message":{"text":"Compression::negotiate (cognitive 22): Compression::negotiate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22871e52e7d2549d257ff40c551ebf0a3af3f1692f161b2ecc2fa7ec797d15b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSeeker::send (cognitive 22): ReadSeeker::send has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/writing/seek.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a35eef7f904bb6bb74efab818960bd8c284a4b5a17d75e7513a7690026ba8bf"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDeserializer::deserialize_value (cognitive 20): RequestDeserializer::deserialize_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/request.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e929b969a543557718fed89cf97736f9d30d4421ea2034fe055bedc06de45d"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestBodyAttr::parse (cognitive 20): RequestBodyAttr::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (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":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4b35dead366f4d778b17292adc1b194a3fdaa7a7d9217f206f20c774bf80fe"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestBodyAttr::try_to_tokens (cognitive 20): RequestBodyAttr::try_to_tokens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"186db4d59f82e649fb0da6804b2435ab051a92f9d733bcb0e551c284b12d55f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ReqwestClient::execute (cognitive 20): ReqwestClient::execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/reqwest_client.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfed25012770246059326ecabd5d4ed0ea39aa38f2cc99773180649947bd8dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedFileBuilder::build (cognitive 19): NamedFileBuilder::build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa2c56e73a9e7c2cf9da8639de59392366508c232bcc80d662c5bd96537581"}},{"ruleId":"D2","level":"warning","message":{"text":"Router::detect (cognitive 19): Router::detect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/router.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9597d6722ef9a3562ab7d445bb82f3f0ba1835159c2debe86b18d32b23b0bce0"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_macros::shared::parse_input_type (cognitive 19): salvo_macros::shared::parse_input_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2f5b9e9e1fd2caa96ce86931042cec84c1ed7543067fbe05e352455bf2f70e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnnamedStructSchema::try_to_tokens (cognitive 19): UnnamedStructSchema::try_to_tokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d62b00d8b2fcaa3467d6f2b252984efea2af8b294bf8d7e8dbdf1856607328"}},{"ruleId":"D2","level":"warning","message":{"text":"TusOptions::extract_host_and_proto (cognitive 19): TusOptions::extract_host_and_proto has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/options.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3e45fb05f302c20b1448ccdb6244fcab014e38518b490b1b5a0eccfb5547c4"}},{"ruleId":"D2","level":"warning","message":{"text":"QuinnAcceptor::accept (cognitive 18): QuinnAcceptor::accept has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/listener.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c6348aa304c62fad452b2957f961ae419f635cb0257982e6eb58aec67b2a58"}},{"ruleId":"D2","level":"warning","message":{"text":"RegexWisp::detect (cognitive 18): RegexWisp::detect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1f18529683096922d96692c5062ab455c89c544fb3e1e5e58b336841ecfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Csrf::handle (cognitive 18): Csrf::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/lib.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5676dc644fecdd778d6a084c32ed42de12274208b2755b2b744a2bc77c21c138"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketUpgrade::upgrade (cognitive 18): WebSocketUpgrade::upgrade has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (4 pts) (nesting depth added 4). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/websocket.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13f2518213113ceae92a6ef20fe77d388b8375e102382ea0c232205effa2ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldInfo::try_from (cognitive 18): FieldInfo::try_from has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/extract.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae5fb9af105ed8657a3cecd6721ac7dc089a48b6f129a0b3eca56d79bac5e84"}},{"ruleId":"D2","level":"warning","message":{"text":"ComplexEnum::tagged_variant_tokens (cognitive 18): ComplexEnum::tagged_variant_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a2a77b18f63e9419b74af443bb163b67daf06cdb2cf588c1230d24f0c22a37"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_oapi_macros::shared::parse_input_type (cognitive 18): salvo_oapi_macros::shared::parse_input_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/shared.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"270c3a625c164a95b7b9452d5174643ed7cf0f3d3c55c59dc51b8af1c03c0432"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracing::handle (cognitive 18): Tracing::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/otel/src/tracing.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc780f14ef3187f91583132a25ac11547acc8d277574f8cdc9ea08c59917ee5a"}},{"ruleId":"D2","level":"warning","message":{"text":"StraightStream::poll_read (cognitive 17): StraightStream::poll_read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"624aa20cccc538b31bcffa3eba4c54df38f24b02fc8d50366eb75e06afeb7d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser::scan_regex (cognitive 17): PathParser::scan_regex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"889b35bdc6214e2dad7f02373c967c11b12511c081843299757fbfedac864af2"}},{"ruleId":"D2","level":"warning","message":{"text":"Router::fmt::print (cognitive 17): Router::fmt::print has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/router.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d93349df34485150ede97f8ddeab6b85e7d24d9abb090a611a290784854e99e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parameter::try_to_tokens (cognitive 17): Parameter::try_to_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/parameter/derive.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f146b7fe25d90ef4017b7818d27d73ef963279d07f140ddb14821f5260a95d"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedStructSchema::field_as_schema_property (cognitive 17): NamedStructSchema::field_as_schema_property has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5566fd37d59d46e9a39960f8177a1df70107c369ea846776704b82cc5c5260a"}},{"ruleId":"D2","level":"warning","message":{"text":"ToSchema::try_to_tokens (cognitive 17): ToSchema::try_to_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (5 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdca471dd401ced501f157b603253af5873d543cdff11906c82c0ede9c90daf"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_oapi_macros::endpoint::generate (cognitive 17): salvo_oapi_macros::endpoint::generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/endpoint.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6294ee812eed9c871373817e1a8d3875fd1cefaf869808814ab5cd1e2df78d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperClient::execute (cognitive 17): HyperClient::execute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/hyper_client.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dda70affbd949334308a21182ceda8d981f06439aeacd95ba266a22f44c5548"}},{"ruleId":"D2","level":"warning","message":{"text":"AcmeListenerBuilder::build_certon_manager (cognitive 16): AcmeListenerBuilder::build_certon_manager has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/acme/src/listener.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"31179975f0e0136843b090db47472be3818a0b5b6fc8d2c0fa19e601224d0f05"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser::validate (cognitive 16): PathParser::validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f150698cd8d82dc379c6ca70d784b98bf88b4a22d95b48f03e9c346c6e3eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatParser::next (cognitive 16): FlatParser::next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/flat_value.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed417f6a7e2e293a63322da910b9664d8008b4e7ca8676745ea322e426aeb67"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDeserializer::real_parser (cognitive 16): RequestDeserializer::real_parser has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/request.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64e836e61e424e6ea40f1a8c5a1d6799127cb8dd6841cc8777feeda06f87376"}},{"ruleId":"D2","level":"warning","message":{"text":"EndpointAttr::parse (cognitive 16): EndpointAttr::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/endpoint/attr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d51e0955fd015abd7393a76aa2ee9e7b1bd8d1fca62ed2062426fd91767fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"EnumResponse::parse_variant_attributes (cognitive 16): EnumResponse::parse_variant_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3512cad1b0b7290fe396638bb31110f2f535709ae8b352cd63e3b90ef9641202"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticEmbed::handle (cognitive 16): StaticEmbed::handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/embed.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ddaf0e36f3462fa564f8d8fc65ecc0c88404e3b7169bcd9c6034a2b40dfda"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Request: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/request.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c2c5444dc3744572614fded5836992637b3e8c789d6d0ef773e00bb1274ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamedStructSchema.try_to_tokens: MethodTooLong \u2014 try_to_tokens runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e311349d7ef0b100cd649548a18ecba88fcc12429f67922e79932cb51c16c52f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComponentSchema.non_generic_to_tokens: MethodTooLong \u2014 non_generic_to_tokens runs 225 significant 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 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e217129a35e3dfa47fbb1911fd336d89d91f824abbdd11978cf8bd4a55a346d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_tus::handlers::post::create: FunctionTooLong \u2014 salvo_tus::handlers::post::create runs 208 significant 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 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"920aeb44731aba6e2d66350a92e23fa83d63f85e15538838d7e5ab120a02e8f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/enum_schemas.rs: FileTooLong \u2014 897 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: ComplexEnum (3 blocks, 480-1185). The bar is 500 significant lines; this is 397 over it, 1.79\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e65b5835ac9b20af24fdaff154a3ed36d979112348efd4a18ce89b57aa4156"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticDir.handle: MethodTooLong \u2014 handle runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/dir.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a522fedd8ffbeccb3b881854c5feebad6d62a4c15e92bcb78ebe4ccb2c0025f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filters/path.rs: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 302 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c320b5c350c2f1a463c9f708a23ca997b8f0ca0e5cbee8e27ec86a5d3f67832d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_tus::handlers::patch::patch: FunctionTooLong \u2014 salvo_tus::handlers::patch::patch runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cd1729e0642d229164e6ff1e7d94be258b52ce67277b1b1a9c8927474c94ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Request: ClassTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 72 methods, 4 blocks, lines 157-1547. The bar is 400 significant lines; this is 209 over it, 1.52\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/request.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab88dea67915c53f50cc22c1f9951d87948382752de8c818d33d82770bad6197"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComplexEnum.tagged_variant_tokens: MethodTooLong \u2014 tagged_variant_tokens runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a4119c989253243eb062cadd4920de000d157ed01785df48b553d5dc89edb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 718 significant 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 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180cb6609c5d390178a278dd369fac9f2bbf0f972f07acf767d6b1b7bd6f67e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToParameters.try_to_tokens: MethodTooLong \u2014 try_to_tokens 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":"crates/oapi-macros/src/parameter/derive.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4736592494c16920539f0419fc176f5ceb778068799ec4f9bc08df17c3ee04d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RequestDeserializer.fill_value: MethodTooLong \u2014 fill_value runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/request.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5141d8ce4e8f91829f50d487effce7f27899b77f18a69a475acb7b2cd49c4ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_macros::extract::generate: FunctionTooLong \u2014 salvo_macros::extract::generate runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/extract.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2578d7aec0c91b1c253a0d0ca5a700ae8617bec3c065467e9fa6affd1a6d5c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Router: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/router.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2ced510307f652d47ba08dd7e084bb37c33071602d47fa2a10c147283a379a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComplexEnum: ClassTooLong \u2014 538 significant 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 480-1185. The bar is 400 significant lines; this is 138 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27673eedea259e1aee93955fa8493bbb822b831c6d4c19f016102810019003"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/request.rs: FileTooLong \u2014 672 significant 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 91% of them inside a single declaration: Request (4 blocks, 157-1547). The bar is 500 significant lines; this is 172 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b510d1d9fa30c1bb76970dd3045f164e67a66f47700eec2dfb148fc407604e1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComplexEnum.adjacently_tagged_variant_tokens: MethodTooLong \u2014 adjacently_tagged_variant_tokens runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa66aa30ca61b3afbd963ba97e1d24b6dfcf78e5acab5cb6affd3418a4c7c12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnumSchema.new: MethodTooLong \u2014 new runs 131 significant 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 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66a830696a1177bb24a17277ef7d2dfba772617650ec5c0ef1d8c2b10d3a320"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamedFile.send_inner: MethodTooLong \u2014 send_inner runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bf8d8a8a47cf0dca72467c470b6ad02d747cf6d6ade2ee44a5f5fcf883cce4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComponentSchema: ClassTooLong \u2014 486 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 3 blocks, lines 63-728. The bar is 400 significant lines; this is 86 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"941566690e3d704eab9311b86d55366abe96085013be2d4448c8276efc78abb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dir.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/dir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc1bc51fcc6b48431e4fb275003f93d47998c8775d4c2135da89cd21233eed8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_oapi_macros::bound::with_bound: FunctionTooLong \u2014 salvo_oapi_macros::bound::with_bound runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/bound.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"126bca60f3854f310f097845e100bff9d8f3e995e77f494c9a564cadf8769667"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: feature/attributes.rs: FileTooLong \u2014 603 significant 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 103 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/feature/attributes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca42cc91c002fdae0c91c04bb9da536135634766b41d19223f7766aee651e833"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/named_file.rs: FileTooLong \u2014 596 significant 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 96 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd6d5c55fd7010d0fd2291ae21ac039874ffff1ca8cc6375ee75290e3596766"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComplexEnum.variant_tokens: MethodTooLong \u2014 variant_tokens runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea40312a02112e095cebaaa117191b0ecc08bcbe16e3ffd0c673bb6919559479"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToSchema.try_to_tokens: MethodTooLong \u2014 try_to_tokens runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5ada1d496fe1b6b9793208adf247cd24f942faae4d6440e737645e08afd034"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema_type.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c8006c8f2d99223d4e39566e85839f835bf91cebc52a9db61304b75ced8671"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/response.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2988fea197558769fc015539ca545203d70bea135e1ba9df8a54f6ac25e5b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/component.rs: FileTooLong \u2014 552 significant 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: ComponentSchema (3 blocks, 63-728). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b73c36399483e816ff05236f0f7448cc8108a5ed653423fe47959c7f139e37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpenApi: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ca4a45715a7151ec900a54ded9eccf9537c529f091ea7f2a1f9412067a61b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Object: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/schema/object.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb644437d3d80710c5f3ae04e7fdc164b24828b7c5984f9d8083ef66a60e029"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamedFileBuilder.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"766155edf9ef93dedfae09e7a66e025daee7044a429b14af94541facd89d42fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/openapi.rs: FileTooLong \u2014 506 significant 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 67% of them inside a single declaration: OpenApi (3 blocks, 87-784). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b22817b063e8837b51e8e9de477d8e4231a400bd6930ff52bff1a98aae39fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.serve_connection: MethodTooLong \u2014 serve_connection runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"42066763100c42b74ec05a2702d06f832b2b6c3a18d8e1dc9323ada7923f2524"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnnamedStructSchema.try_to_tokens: MethodTooLong \u2014 try_to_tokens runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d148fc9ff525c4e5f157c5d5119e04c29e6fc21456b54b235617481f6d92e74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (100 shared lines): crates/oapi-macros/src/schema/enum_schemas.rs:735-928 | crates/oapi-macros/src/schema/enum_schemas.rs:941-1099 \u2014 These two members are variants of one another: 100 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9fa46773c7300c3365c2f1502240b6288f65bcbc8783e056f890297468d27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tus/src/handlers/delete.rs:13-73 | crates/tus/src/handlers/get.rs:13-97 | crates/tus/src/handlers/head.rs:15-129 | crates/tus/src/handlers/post.rs:21-343 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a521d76c501f30f8eafabb5d8453ec0d4486313a94b557ccaa57ec787225c4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/core/src/conn/stream/straight.rs:128-168 | crates/core/src/conn/stream/straight.rs:197-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"db55ed95bae50c5bf168aedec62bc2f56015a189012761eacf5ff9ddf221d875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:890-928 | crates/oapi-macros/src/schema/enum_schemas.rs:1060-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f1c1fe84206840f349088423996bfdc9855774d6a8931ff1ce968b7dab231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:736-773 | crates/oapi-macros/src/schema/enum_schemas.rs:942-979 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfa4aa9f6feb4fd44f2cfb11059772776b97af8063f2f2ddea9cf2b59de91f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201337 lines \u00D7 2): crates/core/src/conn/quinn/builder.rs:307-343 | crates/core/src/conn/quinn/builder.rs:367-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebaf0843bde505222d66367ae1ae1560a2b008609482b2225f0bca66b31e7b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): crates/tus/src/handlers/get.rs:23-53 | crates/tus/src/handlers/head.rs:25-54 \u2014 before extracting anything, compare \u0060crates/tus/src/handlers/get.rs\u0060 and \u0060crates/tus/src/handlers/head.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/get.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ab1138a7ab90470cb480da25ff610acc594114580cc17a0d575c0f6a79d0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201327 lines \u00D7 2): crates/oapi-macros/src/operation/request_body.rs:165-185 | crates/oapi-macros/src/response.rs:325-351 \u2014 before extracting anything, compare \u0060crates/oapi-macros/src/operation/request_body.rs\u0060 and \u0060crates/oapi-macros/src/response.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd7a9a13b3ad278d22bd56e65fb3cd1e4e146ebf11ec8128f58bda454979d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/macros/src/shared.rs:80-105 | crates/oapi-macros/src/shared.rs:100-125 \u2014 before extracting anything, compare \u0060crates/macros/src/shared.rs\u0060 and \u0060crates/oapi-macros/src/shared.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f434ad3c9c50addf8b12ec8512f5fd7ed2d8cf8e2cbd755f761fa20af78c617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/macros/src/shared.rs:117-142 | crates/oapi-macros/src/shared.rs:133-158 \u2014 before extracting anything, compare \u0060crates/macros/src/shared.rs\u0060 and \u0060crates/oapi-macros/src/shared.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9dc0496a8530411e1c16603eba46852038fc8b795935e39e951e99d6d7a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:513-538 | crates/oapi-macros/src/schema/enum_schemas.rs:561-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cc43337be408a414a55e51848d47ecff1ff2a6f37d32f07f092c0e4a5933d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/macros/src/handler.rs:16-39 | crates/oapi-macros/src/endpoint.rs:142-165 \u2014 before extracting anything, compare \u0060crates/macros/src/handler.rs\u0060 and \u0060crates/oapi-macros/src/endpoint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3a7765ce8e3139bdbbfa60e82310a33770809a427d7abe1a8435641d0eddfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/oapi-macros/src/response.rs:500-523 | crates/oapi-macros/src/response.rs:598-621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2014fc3379ec49e80418b5e5e26783ac6125a5eadde78715ade9f9d5ad38034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/csrf/src/aes_gcm_cipher.rs:49-71 | crates/csrf/src/ccp_cipher.rs:49-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/aes_gcm_cipher.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2dd98f661fd9989e720b2b9084b0e40e44b44c5898c62e057df385e4eb7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:812-834 | crates/oapi-macros/src/schema/enum_schemas.rs:998-1020 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b28c51366cceed41c91e6a49d99c332e80d35c5dd8cb3ecfaf11284aa60f8f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/oapi-macros/src/schema/enum_schemas.rs:508-527 | crates/oapi-macros/src/schema/enum_schemas.rs:737-756 | crates/oapi-macros/src/schema/enum_schemas.rs:943-962 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d827a8accb60baf30a8c91c81824b4f11e47e7e49eebf16ead638f676a7a803f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/core/src/conn/tcp.rs:245-264 | crates/core/src/conn/unix.rs:191-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/tcp.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dceea3b234df9a3d6c783c6cb40d6967b474a053dbc39edb9ebad2fcf9bd8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/core/src/fs/named_file.rs:930-949 | crates/core/src/writing/seek.rs:124-142 \u2014 before extracting anything, compare \u0060crates/core/src/fs/named_file.rs\u0060 and \u0060crates/core/src/writing/seek.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aa2e31f699c7aecd7ad1e9844de26b091e7ba3e7f46987bb16ce278fa6f589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/proxy/src/hyper_client.rs:149-168 | crates/proxy/src/reqwest_client.rs:108-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/hyper_client.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d0d44fa89c1768f639701c6eae3824d8a3f88c7cf8c5aa65d34a9d2ad42a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201319 lines \u00D7 3): crates/oapi-macros/src/operation/request_body.rs:167-179 | crates/oapi-macros/src/response.rs:328-346 | crates/oapi-macros/src/response.rs:918-928 \u2014 before extracting anything, compare \u0060crates/oapi-macros/src/operation/request_body.rs\u0060 and \u0060crates/oapi-macros/src/response.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26edee2d3611878b1b94445a7be6b7181824a2ada2d54a9ffd31d25099a4095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:135-153 | crates/oapi-macros/src/schema/enum_schemas.rs:171-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d78bfc70ed832b3a85834917d48298902b9371248290b28a62fe05d6e319aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/oapi-macros/src/schema/enum_schemas.rs:558-575 | crates/oapi-macros/src/schema/enum_schemas.rs:814-831 | crates/oapi-macros/src/schema/enum_schemas.rs:1000-1017 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"26788fc2c582915a84b54495bd3cdcf6922f2f61c7312ac9852db67ae9eef783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/core/src/extract/case.rs:62-79 | crates/serde-util/src/case.rs:99-116 \u2014 before extracting anything, compare \u0060crates/core/src/extract/case.rs\u0060 and \u0060crates/serde-util/src/case.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/case.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d335e5202eb72b8ae30bc8831ce380597f7896d10b85f2b600510ff53641e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/oapi-macros/src/component.rs:139-156 | crates/oapi-macros/src/component.rs:165-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"003890edf1956822ccbef0789cea50b36fe572cb6b55610fa55c564665129b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/oapi-macros/src/response.rs:476-493 | crates/oapi-macros/src/response.rs:553-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"5339d22d596360fba3816a511c88ad6e5d539c52c6b20ad810d778d3e3b7670c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/core/src/conn/native_tls/listener.rs:165-181 | crates/core/src/conn/openssl/listener.rs:152-168 | crates/core/src/conn/rustls/listener.rs:154-170 \u2014 \u0060crates/core/src/conn/native_tls/listener.rs\u0060 and \u0060crates/core/src/conn/openssl/listener.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 46 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":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d990642194173f9b4563b354e0761b1148adc3a32c9fab82af2da49d05fb4ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/core/src/http/body/channel.rs:101-117 | crates/core/src/http/body/channel.rs:138-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":"crates/core/src/http/body/channel.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ee939d2e4aa0c22c5436d01828c1b34ff5bedce55f94321af3ee9efa2b5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/oapi-macros/src/schema/enum_variant.rs:238-254 | crates/oapi-macros/src/schema/enum_variant.rs:344-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_variant.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1218cecab6f4f6068571b98943eb13482337d20db16f795a0bff0850e264728c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/extra/src/tower_compat.rs:115-130 | crates/extra/src/tower_compat.rs:279-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/tower_compat.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11fb6dbc568fd9e7ae4aea00f6a3096e878ef58d38430e7431a31e4af0f9c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/macros/src/extract.rs:305-320 | crates/oapi-macros/src/parameter/derive.rs:175-190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/extract.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0131a46105b0901b8070a1ac07421a427982f08ede3a8521ee0ac5d061356a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:766-781 | crates/oapi-macros/src/schema/enum_schemas.rs:839-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"02873e4115bea0d95f9c086ed17dfd3c34dcdb9b3d05a5a652e0bc8d7c012bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): crates/oapi-macros/src/schema/enum_schemas.rs:513-527 | crates/oapi-macros/src/schema/enum_schemas.rs:561-575 | crates/oapi-macros/src/schema/enum_schemas.rs:742-756 | crates/oapi-macros/src/schema/enum_schemas.rs:817-831 | crates/oapi-macros/src/schema/enum_schemas.rs:948-962 | crates/oapi-macros/src/schema/enum_schemas.rs:1003-1017 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f69e185ccc4d27015639c072e745172165f58bd2c187198f7dc83513ee56a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/tus/src/handlers/delete.rs:15-29 | crates/tus/src/handlers/get.rs:15-29 | crates/tus/src/handlers/head.rs:17-31 \u2014 before extracting anything, compare \u0060crates/tus/src/handlers/delete.rs\u0060 and \u0060crates/tus/src/handlers/get.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":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"406557bf55f788d52ae3204c0bbb90169b927e340063378dfe58e9c3bfea3552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/macros/src/extract.rs:425-439 | crates/macros/src/extract.rs:442-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/extract.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f669ee3c6685a0d64cc01b46011ba3f3962ea8a02d2b6115543d41a4493d7557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/oapi-macros/src/component.rs:452-464 | crates/oapi-macros/src/component.rs:602-616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0db5798bab35a1b0839aa9a9bf0a5863320d23d6336225784ffb8b2d7a4847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:983-997 | crates/oapi-macros/src/schema/enum_schemas.rs:1037-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0b60df37a54a2ca5b11da62223c6d9427b9b024b65243d126a68d8bd2710a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/oapi-macros/src/schema_type.rs:69-83 | crates/oapi-macros/src/schema_type.rs:358-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema_type.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a15689755c4d8505d291237eb66e95f3d321c6d82def6113e0d3bc58141f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/craft-macros/src/utils.rs:6-19 | crates/macros/src/shared.rs:18-31 | crates/oapi-macros/src/shared.rs:40-53 \u2014 before extracting anything, compare \u0060crates/macros/src/shared.rs\u0060 and \u0060crates/oapi-macros/src/shared.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/craft-macros/src/utils.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"db318a6da5d19adf10fad1575e195717c6f4c7fe15d18eee250a09dd3e7785f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/tus/src/handlers/delete.rs:34-47 | crates/tus/src/handlers/get.rs:28-41 | crates/tus/src/handlers/head.rs:30-43 \u2014 before extracting anything, compare \u0060crates/tus/src/handlers/delete.rs\u0060 and \u0060crates/tus/src/handlers/get.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":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9667cebfb570191f231f36e00d0b76b0d5f1e4e48fee0025516bd2c0bd67d884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/macros/src/handler.rs:51-64 | crates/oapi-macros/src/endpoint.rs:210-223 \u2014 before extracting anything, compare \u0060crates/macros/src/handler.rs\u0060 and \u0060crates/oapi-macros/src/endpoint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fd681a85b857a3cfd2489a812cf0ee07e31e4c90a4d81ce0624678bbdfd0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/macros/src/handler.rs:89-102 | crates/oapi-macros/src/endpoint.rs:259-272 \u2014 before extracting anything, compare \u0060crates/macros/src/handler.rs\u0060 and \u0060crates/oapi-macros/src/endpoint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"575f4c2f0a0a448e5c35497069d6552fd4062bf48f5ea42f3e97e4df92256b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/core/src/conn/stream/straight.rs:83-95 | crates/core/src/conn/stream/straight.rs:121-132 | crates/core/src/conn/stream/straight.rs:190-201 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0597b7e609b94379037a46b897ef2b47d8c075af6ee801bc77be410284f7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/extract/case.rs:90-102 | crates/serde-util/src/case.rs:124-136 \u2014 before extracting anything, compare \u0060crates/core/src/extract/case.rs\u0060 and \u0060crates/serde-util/src/case.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/case.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86b161ccbb26d1c122cffe038d0d1f82e0c85aee6859f6f9501b552f3f8ca7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/oapi-macros/src/response/derive.rs:269-281 | crates/oapi-macros/src/response/derive.rs:316-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a840673a26dc04d037ed2e55675d495f043ade13df3f27363fa4238d8582b945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/server.rs:358-369 | crates/core/src/server.rs:529-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38a0eef1e68490e488cb68d947398eb0ee3543dc1a761ba249b7205511da52f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/oapi-macros/src/response.rs:259-270 | crates/oapi-macros/src/response.rs:277-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":"crates/oapi-macros/src/response.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10e8f44322786c2daaf3d0ae60b158f1e970fdbac353c18572240aa7324dbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/oapi-macros/src/schema/struct_schemas.rs:252-263 | crates/oapi-macros/src/schema/struct_schemas.rs:435-446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eac4b5e48b0b0efd2009cc3b164384f2d47c292c903cab486819f9724fd91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/oapi-macros/src/schema.rs:288-299 | crates/oapi-macros/src/schema.rs:322-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":"crates/oapi-macros/src/schema.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc022c5b3a50a71a81b49f9239ba2765c54b3c33785ecd72eb905911b4200a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tus/src/handlers/patch.rs:192-203 | crates/tus/src/handlers/post.rs:212-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"abee0b61a1712521f51c6a51d584d096810d0a304dbe15cb5972d0ba3345c028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/tus/src/handlers/get.rs:67-76 | crates/tus/src/handlers/head.rs:78-87 | crates/tus/src/handlers/patch.rs:96-106 \u2014 before extracting anything, compare \u0060crates/tus/src/handlers/get.rs\u0060 and \u0060crates/tus/src/handlers/head.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/get.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1473e1619de3fa7d73ed70b514d5ba783b30a4aee4da5a8942c7ceb82ab7be80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/core/src/fs/named_file.rs:918-928 | crates/core/src/writing/seek.rs:113-122 \u2014 before extracting anything, compare \u0060crates/core/src/fs/named_file.rs\u0060 and \u0060crates/core/src/writing/seek.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba16567b2906f7ad6b7bc8876d23f308d7dc1ebf6d2fbcba5f60e98c9be57050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/core/src/routing/filters/path.rs:620-629 | crates/core/src/routing/filters/path.rs:638-648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da32d444fb032ba149bbc328305ed31cb683f97e2a4b5e382a0c526be3574e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/macros/src/shared.rs:34-44 | crates/oapi-macros/src/shared.rs:56-66 \u2014 before extracting anything, compare \u0060crates/macros/src/shared.rs\u0060 and \u0060crates/oapi-macros/src/shared.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39d88e3cbaafd5f18964d987e391082259daf6ba4a23ff520d9305c24c1ded0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/oapi/src/openapi/schema/all_of.rs:58-68 | crates/oapi/src/openapi/schema/one_of.rs:58-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/schema/all_of.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ae7adc3ba6019e4cd20529ec50136262e38a1f9a4d81319b82830af2cf914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/oapi/src/rapidoc.rs:105-115 | crates/oapi/src/redoc.rs:120-130 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/rapidoc.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e885f8db2f28a8c88753bc95a0f41cbce1ce91b76817088326ab7b76dd8a8e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/oapi-macros/src/operation/example.rs:25-34 | crates/oapi-macros/src/server.rs:124-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/example.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1287d08c1aa39862fea92eb4692059a8235adab09dbe4586806fb16a5183242b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/oapi-macros/src/operation/request_body.rs:193-203 | crates/oapi-macros/src/response.rs:359-367 \u2014 before extracting anything, compare \u0060crates/oapi-macros/src/operation/request_body.rs\u0060 and \u0060crates/oapi-macros/src/response.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf86fa09856971bf077358cd97d4863c4dbfe53a809d0c4134b7f8650756b793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:303-313 | crates/oapi-macros/src/schema/enum_schemas.rs:381-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e6eb1674f1d3674eae63ae2d0ce58329aa3b4fe9994ff6aecf04b6b2e1957e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/core/src/conn/native_tls/listener.rs:74-83 | crates/core/src/conn/openssl/listener.rs:73-81 | crates/core/src/conn/rustls/listener.rs:72-81 \u2014 \u0060crates/core/src/conn/native_tls/listener.rs\u0060 and \u0060crates/core/src/conn/openssl/listener.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 46 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":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7593c8254d3cf31c2751cc331f3c4c829927b7710444f35931dcf1c980bd6c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/oapi-macros/src/response/derive.rs:411-420 | crates/oapi-macros/src/response/derive.rs:467-476 | crates/oapi-macros/src/response/derive.rs:674-681 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b883e8a59fc722ce5dfa08a49e34f962a43bb16ecc890f50838139b8adca43ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/core/src/catcher.rs:433-441 | crates/core/src/catcher.rs:483-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/catcher.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229e13e6dbcceb63a88c34e78c9afe12dd33c46cdc4c466722b2b8bc19e4967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/conn/quinn/builder.rs:135-144 | crates/core/src/conn/quinn/builder.rs:159-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a085030281b2056ba8d085a3ec8e7d1b524c87de3c56191ba3a66cae0ae3074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/extract/case.rs:115-124 | crates/serde-util/src/case.rs:150-159 \u2014 before extracting anything, compare \u0060crates/core/src/extract/case.rs\u0060 and \u0060crates/serde-util/src/case.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/case.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c844ca6ba660fb29a26dfc2302d9032dbc7126e76a55c24b996cc7eccfde771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/http/request.rs:568-577 | crates/core/src/http/response.rs:183-192 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/request.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"29833c5a086ae204eb5d780dc0bdc605c74b1ddc490657825d120ba39257c2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/csrf/src/aes_gcm_cipher.rs:74-83 | crates/csrf/src/ccp_cipher.rs:74-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/aes_gcm_cipher.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d6630f25567642729a854f570c3bca1b66e4859b2a8b5b42afc67a6596d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/core/src/conn/stream/straight.rs:104-112 | crates/core/src/conn/stream/straight.rs:163-171 | crates/core/src/conn/stream/straight.rs:232-240 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb4681bf9853374179343fc9587ce5d6aaa8b9b776c85d989bcd8d05f09b466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/oapi-macros/src/response/derive.rs:306-314 | crates/oapi-macros/src/response/derive.rs:406-414 | crates/oapi-macros/src/response/derive.rs:517-525 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd129d2805ebca34035d05380cc984cbe31150dd6743b81d6f7c88db10acac95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/conn/stream/handshake.rs:55-63 | crates/core/src/conn/stream/handshake.rs:73-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/handshake.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dec7e6afd6ab02e47640408535b53bbde4c8c142adae7b8055228f41d0190b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/server.rs:347-355 | crates/core/src/server.rs:518-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"76549b01a415b8b47bba5f66e11d69f42dd5bb723a62647415d6044891dd1464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi/src/openapi.rs:888-896 | crates/oapi/src/openapi.rs:944-952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e45618b2ec832fae2f76bd298351667d93c38dfbdc682bb3daca355ae8e7648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi-macros/src/schema/enum_variant.rs:210-218 | crates/oapi-macros/src/schema/enum_variant.rs:309-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_variant.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c09e5c432be95f0960c4bbfa3c38089091b47453efbefc4825d43af07c86b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi-macros/src/schema/struct_schemas.rs:94-102 | crates/oapi-macros/src/schema/struct_schemas.rs:186-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb69e6385e90db7fb69514eb171651b11524eb15f9e16ae5ee8752a23d438359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rate-limiter/src/lib.rs:344-352 | crates/rate-limiter/src/lib.rs:372-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rate-limiter/src/lib.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a218b7b3d33c0c29e41d2652996e1e8d1100196dbe2d395bddfd8ab0a4286c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/oapi-macros/src/component.rs:432-439 | crates/oapi-macros/src/component.rs:582-589 | crates/oapi-macros/src/component.rs:618-625 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3858218d193f4b54e5223f3a2cf8bd9152d4ccaa11f2ffe327beb0f2e7da0557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/oapi-macros/src/component.rs:455-461 | crates/oapi-macros/src/component.rs:607-613 | crates/oapi-macros/src/component.rs:644-651 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e688bcc38dc8c15b207bf66ea4d7d675b27d4fc549638c38374652e4a2b1edd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/conn/tcp.rs:199-206 | crates/core/src/conn/unix.rs:126-133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/tcp.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22ad7b0347ac5e883957d6c59435df11141416c1eea46c5c9163c1a182c5230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/http/body/req.rs:165-172 | crates/core/src/http/body/res.rs:156-163 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/req.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c3d309aa09e8b3558ceaa2d9bf233a98b0c07481f8999debb7733e6c9901dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/macros/src/handler.rs:131-138 | crates/oapi-macros/src/endpoint.rs:299-306 \u2014 before extracting anything, compare \u0060crates/macros/src/handler.rs\u0060 and \u0060crates/oapi-macros/src/endpoint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0701333061de30a3ec55bbe3e93ed97e2e9674070c50501db8ad553ea38cb600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/oapi-macros/src/component.rs:232-239 | crates/oapi-macros/src/component.rs:313-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c7998bb81fe7699cd55b54f383329e4fd939f1b673de8eef655b53f063cb77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/tus/src/handlers/delete.rs:19-24 | crates/tus/src/handlers/get.rs:19-24 | crates/tus/src/handlers/head.rs:21-26 | crates/tus/src/handlers/post.rs:25-31 \u2014 before extracting anything, compare \u0060crates/tus/src/handlers/delete.rs\u0060 and \u0060crates/tus/src/handlers/get.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":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e032c89490e8be222c4aa2348f89d1ad92cbc4a7f795cc73413f941efc6077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/catcher.rs:345-351 | crates/oapi/src/html.rs:2-8 | crates/serve-static/src/dir.rs:772-778 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/catcher.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daaeab5090ae49739960ffefcbe3abe312d1a1a8aadc65bf773eb045b07d2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/conn/native_tls/listener.rs:154-160 | crates/core/src/conn/openssl/listener.rs:141-147 | crates/core/src/conn/rustls/listener.rs:143-149 \u2014 \u0060crates/core/src/conn/native_tls/listener.rs\u0060 and \u0060crates/core/src/conn/openssl/listener.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 46 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":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e06a7eee28f8cee31a225707ddcf0e328741ca013579c042ce3892552ec174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/oapi-macros/src/operation/request_body.rs:76-82 | crates/oapi-macros/src/schema/xml.rs:35-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e8d70ae32fe0f2fe1298dbb21a7e02250de61cf9dde089dffbc2e9f8828a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/session/src/lib.rs:140-146 | crates/session/src/lib.rs:368-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/session/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fda5a6977e497900979869263a787802cff4604600062b11be910e4d905323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/oapi-macros/src/component.rs:455-460 | crates/oapi-macros/src/component.rs:607-612 | crates/oapi-macros/src/component.rs:644-649 | crates/oapi-macros/src/component.rs:655-660 \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":"crates/oapi-macros/src/component.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fb72ff5eb50806867c2e3c9dfca8ba9556e16e743d4c960d446517c9fc5297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/compression/src/lib.rs:520-523 | crates/compression/src/lib.rs:531-536 | crates/compression/src/lib.rs:545-550 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"59618bc8a0177e0de2392016275bd662d7989fbc16f486ada805292675347670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/macros/src/handler.rs:163-168 | crates/macros/src/handler.rs:182-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7629a941091c92557518521f87c17682a1701e44c254f1eb6c14d1347f39319c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): crates/core/src/http/body/req.rs:208-212 | crates/core/src/http/body/res.rs:168-169 | crates/core/src/http/body/res.rs:174-175 | crates/core/src/http/body/res.rs:234-238 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/req.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c155f273ab487c2e4eea732a0cbe81576e3f67d0eba50a05042d61135bb463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/oapi/src/openapi/path.rs:158-162 | crates/oapi/src/openapi/security.rs:613-617 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/path.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc82fb1eae85c298f4d70dc009779237a6c4a739ef66532a512176965e1aabc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/oapi/src/rapidoc.rs:118-122 | crates/oapi/src/redoc.rs:133-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/rapidoc.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4149ab3d284cfff6433c4817fa681d0ef17edeef3d59d1b7c5a80057a75769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tus/src/stores/disk.rs:481-485 | crates/tus/src/stores/disk.rs:487-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c726be3384fb7a6c2d6364a81e4283c2b073aa5b5cb2da13723e1092be1c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tus/src/handlers/patch.rs:180-184 | crates/tus/src/handlers/post.rs:198-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5c12c9912a0d091491bc49a7c51cb2776dbf5e5f6e5a72308c887a2f33b4b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/conn/openssl/config.rs:42-46 | crates/core/src/conn/rustls/config.rs:57-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/openssl/config.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a84b165227b5ec25f72d37f0c570f0b025300991f532de3947ffe45014551e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/core/src/extract/payload/file.rs:57-62 | crates/core/src/http/form.rs:155-160 | crates/core/src/http/request.rs:849-854 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/payload/file.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"580501ba526fdd36013c2c6595f6208377f5708185ac0b027c8328a1f97d3e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/fs/named_file.rs:1043-1056 | crates/core/src/writing/seek.rs:183-196 \u2014 before extracting anything, compare \u0060crates/core/src/fs/named_file.rs\u0060 and \u0060crates/core/src/writing/seek.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c27ddf7da949fc99ea1641434f430fc030ed7a22551c2f0b05082d0de86f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/fs/named_file.rs:1059-1072 | crates/core/src/writing/seek.rs:199-212 \u2014 before extracting anything, compare \u0060crates/core/src/fs/named_file.rs\u0060 and \u0060crates/core/src/writing/seek.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"e688a2e0e34c8e3e62ac8a1c1aa81370ae8d503a6be571d81cb9f0d9057e2e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/serde/flat_value.rs:121-127 | crates/core/src/serde/vec_value.rs:112-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/flat_value.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede6d36f35114a67a792111f8c7c6da0450fc62351fea1df40c1a7d31bdc8f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cors/src/allow_credentials.rs:50-54 | crates/cors/src/allow_private_network.rs:49-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/allow_credentials.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed69fc67094ffba045cf5cf99460de6b492153e3be16efcc29556556a7eefe4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cors/src/allow_headers.rs:71-75 | crates/cors/src/allow_methods.rs:83-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/allow_headers.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70ac7e2ff3bd74964c21d2a0c657b094f8b2a8978b7c8127384153125ec8ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cors/src/allow_headers.rs:139-145 | crates/cors/src/expose_headers.rs:122-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/allow_headers.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5931e949304b5169a9dc9971b93248b2c397c8d88a4f1c1bdd1c87d3a3d5a27e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cors/src/allow_headers.rs:148-154 | crates/cors/src/expose_headers.rs:131-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/allow_headers.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d612f1dbca0c5bf02b079931cae7aa87a21477bf481db889238f49e9e33dce83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cors/src/expose_headers.rs:70-74 | crates/cors/src/max_age.rs:54-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/expose_headers.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd146094827e99d79504e744fec24f406ba167972cf6e97a45e7af8c6282ff6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/oapi/src/openapi/callback.rs:80-86 | crates/oapi/src/openapi/response.rs:28-35 | crates/oapi/src/openapi/schema.rs:34-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/callback.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a6f327bc1e7808a21b84b6c976fe1a153b1ae0c8b8cde353e6e8588891253a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/oapi/src/openapi/components.rs:182-189 | crates/oapi/src/openapi/components.rs:211-218 | crates/oapi/src/openapi/content.rs:152-160 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/components.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5c76715d98c5bafc6e48e90100dbe981a87588d26305ca31c0c292c2c74b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/oapi/src/openapi.rs:407-413 | crates/oapi/src/openapi/operation.rs:312-318 | crates/oapi/src/openapi/parameter.rs:375-381 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75da71b925265fb7471552b0880d586385cf924ae29e65996a2ce75329ddba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/oapi/src/openapi/path.rs:70-75 | crates/oapi/src/openapi/schema.rs:101-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/path.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af940def0ed69690696daad61b19919d2ac1a530abb611560f4643105e1709b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/oapi/src/openapi/response.rs:42-49 | crates/oapi/src/openapi/schema.rs:48-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/response.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1b41e0d55be66b4c13ccf980b1bd206f99cad0ff53c95dfeaab26703b32f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi/src/openapi/schema/object.rs:275-283 | crates/oapi/src/swagger_ui/config.rs:635-644 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/schema/object.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94764861feb2b030f9d5694fc6651dc5192e58ef6e4569ed5485d383c427fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cors/src/allow_headers.rs:98-105 | crates/cors/src/allow_methods.rs:110-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/allow_headers.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b81a2e0ade04b4894204e96bd1ece02a29eb5e66dd715d50124dafb25ffd2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/oapi-macros/src/operation/encoding.rs:42-58 | crates/oapi-macros/src/response.rs:520-536 | crates/oapi-macros/src/response.rs:618-634 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/encoding.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee6254da43147e3621cec8e56317dafeaf5ca422b3c526e02e7716202e6d0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/src/conn/proto.rs:170-182 | crates/core/src/conn/proto.rs:232-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/proto.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"308d97b1b84354330b6183e6f457022e2c30225b08aaf3c3058bc01cad4b5941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/core/src/conn/native_tls/listener.rs:218-229 | crates/core/src/conn/openssl/listener.rs:204-215 | crates/core/src/conn/rustls/listener.rs:205-216 \u2014 \u0060crates/core/src/conn/native_tls/listener.rs\u0060 and \u0060crates/core/src/conn/openssl/listener.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 46 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":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e495f43e8ab85f6081dfb6f87aa443e4435b5f5f315455abf5e3b1dd9475c3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/macros/src/shared.rs:45-54 | crates/oapi-macros/src/shared.rs:67-76 \u2014 before extracting anything, compare \u0060crates/macros/src/shared.rs\u0060 and \u0060crates/oapi-macros/src/shared.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"237d383c1cd3b6c0301a64088de98e585f31092c8bba5779aa9b86eb78d3fbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi-macros/src/operation/encoding.rs:23-32 | crates/oapi-macros/src/server.rs:20-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/encoding.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"842f57511ae9bad0d3860c8c86b148b060eb84672e1a367a096382646df7c038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/core/src/conn/proto.rs:184-191 | crates/core/src/conn/proto.rs:202-209 | crates/core/src/conn/proto.rs:244-251 | crates/core/src/conn/proto.rs:259-266 \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":"crates/core/src/conn/proto.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bde8a443ea6e2ef1b8c7124e9ab9441daeaa804109d04bf384b90516c3a2fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/macros/src/handler.rs:107-113 | crates/oapi-macros/src/endpoint.rs:273-279 \u2014 before extracting anything, compare \u0060crates/macros/src/handler.rs\u0060 and \u0060crates/oapi-macros/src/endpoint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cb85fe4ed523a10dc32e82a13cd6dff60119c2a299891721accd6a2e8cafb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/session/src/lib.rs:134-139 | crates/session/src/lib.rs:362-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/session/src/lib.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"00340413a007697a59c3239291ea005b616cf6f026bca74f52ddad5518380b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/conn/native_tls/listener.rs:64-69 | crates/core/src/conn/quinn/listener.rs:73-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd92d8ca8731e89dda614cace854bdd6c027f2e387bac90017475545a1917a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/routing/filters/others.rs:149-156 | crates/core/src/routing/filters/others.rs:212-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/others.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a35f1775df57d566cab8bd2756f0ab8ea9b4a160242f47b995af2f9d82740e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/macros/src/handler.rs:156-160 | crates/macros/src/handler.rs:175-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb2585d827889dd6eaeafbd9573ca960a399989fa1b4a09ab36286087d2004e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: salvo-serde-util: salvo-serde-util: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d001999d4151622051c4f01b03bf77562379c3484ca7de0458e246327b5eb3c8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: salvo_core: salvo_core: abstractness 0.12, instability 0.06, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d16f456030eb8c2c99fcd372506346467b5a0cef27262341d80810dcf329192d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OpenApi (LCOM4 7): OpenApi\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5223edb5fccf33d41368252197b78484c5549e17e8966632f42068a04e444de9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EncodeStream (LCOM4 6): EncodeStream\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/stream.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f27216690fe1a76e56d4100f0be0f7e3ec25fa427fe242caeec14383b12349"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Router (LCOM4 6): Router\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/router.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ba06d9ec1f0d7042cea9ae882598fa0d3610d0a9ef0ee626d1ef27b791c437"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DynStream (LCOM4 4): DynStream\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"40378673f7081fa9b575a4d4f3de48fa03bf8f79c27e4b4e40aa9c02d0cdf343"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cors (LCOM4 4): Cors\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"530d5f67410a877e5cb7370d2f0e363768bb39956a3770a356caeb72f336c744"}},{"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":"1a9abc086a2ab8b308a656d6d4dd534bc65bc434c39de031da65234bc8eb9fd5"},"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":"d9eeca926e1c2a10ca1efff0ebb6461a4511762f7b115f7ce965281cb0177cc8"},"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":"a83519caf8e7b1f33114002b815b20161a2eb90f813f5e1b4558ac70a2b58808"},"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":"548ec3f7feca8f2542f2cf1fae24ce31ce516190cbb1784881c2495f6849bb7e"},"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":"045cbcc88107264fa3770209d3e8801ebe621b723098d47368f96d21bfd3f5eb"},"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":"087ea14c32e58de342c6334aa3903268a62b3da06eb4f8ab79d00f010789fce5"},"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":"8060813beb7b1f7536ecb95b0f2868e0ab009cce7310559d2cd3ad3252613fcd"},"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":"e73d769d56922c3da45161621cdca5d681fa26df7c5827c34279201c41b355b5"},"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":"3b09113ddbb7e430f6cde4049a4aa2361d6050ac8c71344aa33dd715663b6ef8"},"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":"d011221fafec2154afdfbb980ae331ee4413467bdd9a370037904c6b1371ee7d"},"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":"09daa07dfb869c3b1d8ebfdd3b051fa9f6a1e9ba29fcca25ec8fb8442ba1c651"},"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: crates/serve-static/src/dir.rs: crates/serve-static/src/dir.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in StaticDir::handle at line 486. 2 of those changes were fix/bug commits, and the other 5 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-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 15:34:04 \u002B08:00\u0027 --until=\u00272026-09-24 15:34:04 \u002B08:00\u0027 --full-history --no-merges -- crates/serve-static/src/dir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/dir.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f790a78567cc29d868cc49216f45c58cd3c9c5e6f1907552fea0ad13233fce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/service.rs: crates/core/src/service.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in HyperHandler::handle at line 258. 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-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 15:34:04 \u002B08:00\u0027 --until=\u00272026-09-24 15:34:04 \u002B08:00\u0027 --full-history --no-merges -- crates/core/src/service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/service.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00f05daa90203d111e91641c3603b541206b1f09344be5f36227ac06cf8735"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/fs/named_file.rs: crates/core/src/fs/named_file.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in NamedFile::send_inner at line 812. 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-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 15:34:04 \u002B08:00\u0027 --until=\u00272026-09-24 15:34:04 \u002B08:00\u0027 --full-history --no-merges -- crates/core/src/fs/named_file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3e47310671a06bbc7d5cf9ac8c051203d003748523da5f52d331855098f637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi-macros/src/endpoint/attr.rs: crates/oapi-macros/src/endpoint/attr.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EndpointAttr::parse at line 29. 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-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 15:34:04 \u002B08:00\u0027 --until=\u00272026-09-24 15:34:04 \u002B08:00\u0027 --full-history --no-merges -- crates/oapi-macros/src/endpoint/attr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/endpoint/attr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f077897fdf1da365c15b0e7eb9028cd967af182dd2e0824ebd829eba1bbe93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi-macros/src/parameter/derive.rs: crates/oapi-macros/src/parameter/derive.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ToParameters::try_to_tokens at line 64. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 15:34:04 \u002B08:00\u0027 --until=\u00272026-09-24 15:34:04 \u002B08:00\u0027 --full-history --no-merges -- crates/oapi-macros/src/parameter/derive.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/parameter/derive.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"86158e1b035bd24ed861dead7689ad74fd8bb20563476b6e8a8ec6c083f90363"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/routing/filters/path.rs: crates/core/src/routing/filters/path.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CombWisp::detect at line 432. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-26..2026-09-24, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-26 15:34:04 \u002B08:00\u0027 --until=\u00272026-09-24 15:34:04 \u002B08:00\u0027 --full-history --no-merges -- crates/core/src/routing/filters/path.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac836c07e95dc03e6514c0daf9e2e49d4a77b55b2bbea3b3a2bc984723226102"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There should be a way to do following two lines cleaner... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/proto.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76dc74a14b447fe34e3d96dc0e880305715f9e2cc20d87264ccc944907ed961"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: If data is polled before the response has been received, an error will be thrown. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/client.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21f62041548e9b2beb63fdbed4489555b642559a25010cd5e792f228f28a6ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: If trailers are polled but the body hasn\u0027t been fully received, an UNEXPECTED_FRAME error will be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/client.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e471172c86d252fa163eea5c90a44ba074bbd12525ccbce7192f6d24278fbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO what if called before recv_response ? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/client.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"461982bffdd98e099d33e5e2664eea26003feaa81fc85cd896dbf152646d045a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO take by value to prevent any further call as this request is cancelled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/client.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b40fb4fa264ed86f45844fcd7ae33e149adb2cc6ea231118414d99554bc0790"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/req.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4586ee30eee1231751f4f673a2f3ce6c40453141af6f66ac014c589845921b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we recognize unknown generic types with \u0060GenericType::Unknown\u0060 instead of \u0060None\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/type_tree.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4915bac4913d9c1036ece05a7a3868a2b5f3def3d724634a23fcb89dd8bef31e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refs support \u0060summary\u0060 field but currently there is no such \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3466e41700481fd4d89052bef2747d6961cee5f1e7642f4c56001888faca2270"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO need to be able to split variant.attrs for variant and the struct representation! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"342245559bf4a43bfe56ae89e08aac06ee57d983d0b7675324a42693f4e9c1bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME perhaps design this better to lessen the amount of args. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c41c74cc39455a3b8b209d9c40e029a0238f24feeb4ec954f633b5d33bda1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: REMOVE THE unnecessary description Option wrapping. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/schema.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36fcdade19f8b6bcaf4979fd871fbc95d9b647611e4c6dfab42a6829ee1b2f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Will remove after opentelemetry_http updated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/otel/src/tracing.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c04f9b86b234a5081aef33a723f658d39b159b6ecd9bb2857fbd8c96636cef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Time handle \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7d03b498141fcc942c8c9d93c8251d8371404f00057d688beae098ef8915a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Time handle \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/head.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c0778e5c4407da6843cc40fa7e4ee3d812b2f8e808a6ae2b952f20d5617765"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Todo not found from storage \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":"examples/todos-utoipa/src/main.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc09486d51f8e9dedac1e2c7715bf0a96191f25111afce3f94053c210546bf2"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The root README begins with a logo, links, and build status but does not state what the repository is for or what it does (e.g. \u0027Salvo is a Rust web framework\u0027 versus the detailed features list that follows). State the project\u0027s purpose in one sentence above the table of contents so readers can find it without scanning."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate method names with identical signatures. \u0060directory\u0060 and \u0060get_directory\u0060 appear to perform the same configuration action (setting a directory URL), likely due to a copy-paste error or incomplete refactoring.: Remove \u0060get_directory\u0060 and keep \u0060directory\u0060, or rename \u0060directory\u0060 to \u0060set_directory\u0060 if \u0060get\u0060 implies retrieval (though the signature suggests configuration). (signatures: AcmeListenerBuilder.directory(name: impl Into\u003CString\u003E, url: impl Into\u003CString\u003E): Self | AcmeListenerBuilder.get_directory(name: impl Into\u003CString\u003E, url: impl Into\u003CString\u003E): Self)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"632a857c477a2738cc6a67b62c05d0be44a7745238f90ed64c3d98e789a912af"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous duplication. \u0060insert_typed\u0060 and \u0060inject\u0060 both take a value \u0060V\u0060 and return \u0060Self\u0060. In many contexts, \u0027inject\u0027 is a synonym for \u0027insert\u0027. Without seeing the implementation, it is unclear if they differ by key derivation or behavior, but the naming convention is inconsistent (one is explicit about type, one is generic verb).: Clarify if \u0060inject\u0060 is an alias for \u0060insert_typed\u0060. If so, deprecate one. If they differ (e.g., \u0060inject\u0060 auto-derives key from type), rename \u0060insert_typed\u0060 to \u0060insert\u0060 for clarity. (signatures: Depot.insert_typed(value: V): Self | Depot.inject(value: V): Self)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"285d2e9e70dde9e1fa0cd6a0fed30002e022216e345e8d097ea05a1c0fa213d3"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate method names with identical signatures. \u0060get_typed\u0060/\u0060obtain\u0060 and \u0060get_typed_mut\u0060/\u0060obtain_mut\u0060 appear to be synonyms for retrieving typed values from the depot.: Remove \u0060obtain\u0060 and \u0060obtain_mut\u0060, keeping \u0060get_typed\u0060 and \u0060get_typed_mut\u0060 for consistency with standard \u0060HashMap\u0060-like naming conventions (\u0060get\u0060/\u0060get_mut\u0060). (signatures: Depot.get_typed_mut(): Result | Depot.obtain_mut(): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"093d4809f8b0bbdd7b6383837aa5214dafcfaede24782785d0bbc9aacf28f519"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming for removal operations. \u0060delete\u0060 returns a \u0060bool\u0060 (success/failure), while \u0060remove\u0060 returns a \u0060Box\u0060 (likely the removed value or a result). This is confusing because \u0060remove\u0060 typically implies returning the value in Rust, while \u0060delete\u0060 implies a void/bool action. However, the return types are vastly different, suggesting they might do different things, but the names are counter-intuitive relative to their signatures.: Rename \u0060delete\u0060 to \u0060remove\u0060 (if it returns bool, maybe \u0060try_remove\u0060?) and \u0060remove\u0060 to \u0060take\u0060 or \u0060extract\u0060. Standard Rust convention is \u0060remove\u0060 returns \u0060Option\u003CT\u003E\u0060. Here, \u0060remove\u0060 returns \u0060Box\u0060, which is unusual. Suggest renaming \u0060remove\u0060 to \u0060take\u0060 and \u0060delete\u0060 to \u0060remove\u0060 or \u0060try_remove\u0060. (signatures: Depot.delete(key: str): bool | Depot.remove(key: str): Box)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"43735e2fc49a0ed7ee97ccea6aeb3bd8d87e65a06f32fc4251428510e3250ea7"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate method signatures. Two methods named \u0060extension\u0060 with identical parameters but different return types (\u0060Problem\u0060 vs \u0060Self\u0060). This is a compile error in Rust unless they are in different traits or one is a typo in the API surface description. Assuming it\u0027s a valid surface, this is a severe inconsistency/error.: This looks like a documentation error or a genuine API flaw. If one is a builder method and one is a getter, the signatures should differ (e.g., getter takes no args). If both are setters, they are duplicates. (signatures: Problem.extension(name: impl Into\u003CString\u003E, value: Value): Problem | Problem.extension(name: impl Into\u003CString\u003E, value: Value): Self)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b6c6efd1b821c1b726edda862913720b4312d0a8e5c16676955614e57defc80"}},{"ruleId":"D26","level":"note","message":{"text":"Split crates/core: A huge catch-all at 26k LoC across 18 namespaces is a sprawling grab-bag. Suggested: "},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a1feb90c65e71b0601d38d29e948629131fa97fff5346611c07b20e8a265ed25"}},{"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":"d90033f121d54e4f197c3a79e05279e2162ef953431a4ea67128812fac48feca"},"properties":{"commitSha":"0d589401213882ce7a1686e91be5651cf9e02452"}},{"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":"635afe0323030e04fd6ba7794f0fec39a5ff19883ffb283d38182d87567a6a0f"},"properties":{"commitSha":"1ca0847261303bb8e6956cd9b072a0757d945ff9"}},{"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":"d136e7501426e3c2979cdcd7a16c663299366628ff044d1e8bc8e3c69049f028"},"properties":{"commitSha":"3f5b599dbdc5d9698b0b2e810386036729d49904"}},{"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":"540afb7923427bbc96236b087159f2bb876dbb7d175948dc7ff904b64df9ea39"},"properties":{"commitSha":"3f5b599dbdc5d9698b0b2e810386036729d49904"}},{"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":"4e98a0d37f473168e1ad78c7116c734e513a9435171ef1691f52ed4e9bee73fa"},"properties":{"commitSha":"3f5b599dbdc5d9698b0b2e810386036729d49904"}},{"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":"539762505d055b6e03f3f49c00276e878e2fb1868f0956cd7cf41022622869c8"},"properties":{"commitSha":"3f5b599dbdc5d9698b0b2e810386036729d49904"}},{"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":"16180dce7e1d5adcde5f15a44a1063922afeaa05cbf652c2fb91f1f95f596738"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2ea8f3985eab588c80eaca218de9aa4b3889fda7a04ffdf4d57b45468dcefd2c"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"72bcd2a93165335c66fa338d7f2e8cd1ce8ece2ffe46c22e771e01833d66ceab"}},{"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":"f0c3c9525fc1a7995efd83b76611e475a14de7b3cd3501f1483ed3b9b587cddf"},"properties":{"commitSha":"116793348c39d3bda95132d7e8f169506b7d93bf"}},{"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":"52eddfc75ea2f50af3fec1e2394f2a97b85b6247af9e45e56ffc6e23e68d7e4b"},"properties":{"commitSha":"2d8cc24a51e23e56ae74b3cb5aa454aec9acb0b1"}},{"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":"c1dacf40d47dd931a06ce0b40ba69c614a7a7b0a4211b8b68278f7f415610657"},"properties":{"commitSha":"ada1c99e05b1db293cf563ce0111e5e983959520"}},{"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":"773d8270ed4bb6038180041861efda0705aa0fb061537e7eb764b31eef901a40"},"properties":{"commitSha":"c70970441f730ab37bdf47c790d3bc90a5cffb21"}},{"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":"0d468da49bdd18ff163df691d9a130d3bbef28c2e01d57d41fed571ca4bb3c9f"},"properties":{"commitSha":"d027b8e74fc1489352e6dae97c86ddf6ec779320"}},{"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":"302842c2ee657c5d31aa178c4fc628860f1480820f1108e913eb1433cc65a203"},"properties":{"commitSha":"bf9cb70730f8429fa58e1d4fb168b0d7f5d82e05"}},{"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":"ef6a65c39a097a7b52cac6034750452ffc43d88fd7c1a0372bb7f976e6c979bf"},"properties":{"commitSha":"097a6413643567600dcab85ce2e945f4e95a3f1f"}},{"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":"154168f67db00a1d1f0455a3f1940a058f07ae92b62ad6313eab64a7570ae2be"},"properties":{"commitSha":"24f1e5169839f0f063d956b42234de2d0864a155"}},{"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":"dbd20dce3083cac506271fbfe3213435afa76d8f54eb2202d8f9e22001a8682c"},"properties":{"commitSha":"097a6413643567600dcab85ce2e945f4e95a3f1f"}},{"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":"c0a4061bfe582efe5afa897d09930a6bd91f3be5b7730ff4f67f571e64784854"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"96cec9972ff8c0946063adeba7594e64a40ecaae4ec7aad5f035abc011483dce"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b11e30822f93d277d8a12bb0278d82279e55de66cdca8910b548b76b9b5d0661"}},{"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":"30f9ead99a030f88522d19a0bd6c1f1be5568bca10695d64e9c29ba67198e6da"}},{"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":"bf225f87e52db3b91225ec17d90887a2736b2d27f7bf7c0efd58c1ee1752ad78"}},{"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":"c2e8e6229bc275b1e7208df961ba5b2d72f7c79cec1d007c696c1f283b40ad59"}},{"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":"ced63b2fa1c4e7ffbe9078b99e7a5be4f4c5afe3edde265fd375674d66af747c"},"properties":{"commitSha":"ddd7f9c111985ad15de28554330819e48da66c0d"}},{"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":"6f335a99aa79a51f0613501be08db912e68719a07b34f54dfa7b00ae9fe6f3d3"},"properties":{"commitSha":"12d37941c8b9fee1cb8308ffe7b227468a6a465f"}},{"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":"1ebfc6454926adc8bcdd9a383a1f7e392ddea375507c6f03377190653a98f9ce"},"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":"de9b4a4d7bbc58782f32eaaae0bf1db7969bbd5bb1dd69b649682d924d646109"},"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":"8403925012c1b3f7719a883658845b9185acf1c65a293dead923a55b8dd423d4"},"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":"b53edd3ffe456b3414ec4b73ab23cd56cbd460b29f570e5a953862fea809eaa3"},"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":"db8098748428bcb97066a640331fd59db47332698f020dc5b802537917287ece"},"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":"0c6d695c3e2dd54eae1731990daf7a0c5e59beab11e2ced59bf943af05c404ce"},"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":"1107fbe45f34647481bb90252d68d74a01c880cc9f874ef9865008a1e29c7cf3"},"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":"f467635970e9cf07eacae0eccea0e9971f0dbd30d31e5ea037f3f67b2a7a38b1"},"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":"d25c178ff9ee45da6c61aad151069e129228365ec95249c7d176e0df1ab0d362"},"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":"4a91d3774746cff798305e04a251863e156474679daad416aa216c7e61717bba"},"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":"e3a9fdeaca27708b0dae9ddc8a7740396996333065d7dd0ebab928a16554e2dc"},"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":"820777a6885a4e2268ae96a3a96c2c50b3407b63632a447f095faf648da339ae"},"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":"62563de3569e9ee0416cd8621366bbcd73acf272683fa30a383e948cf04f59dc"},"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":"08e5e8689ffaeb8b2ac8b64eafdd1486a592a433708331c7d1fd15600dd161e6"},"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":"242cc5cabd6fab694ac8b5f72d309230ee16dab7b7a4162f52f0f1032b48ff73"},"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":"f522cb44c428530fc19490d9f4fc4700f6de20aa1b1a318d3b40e35f8daf8bfe"},"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":"99a8c664d35faabf7ec0637e73d1ccea10a3ac8f0c451f4f12629092e7d7b752"},"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":"4c0294c189b014639b9b3a38a52e909a44fe21942b77173e77e288d15cbfe69e"},"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":"91d8d3e1df38a4de14e6665274065572977e6f2307dbba16d6d0264a240937bd"},"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":"8f12a17e21744efeb11db6de92b5f5fe232a703dc12106ba8dccfd91fdf6e568"},"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":"88ffd25706b1e73cfb78b7600a4a851d140e5a511fe9110fc1cbb105cded34ea"},"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":"4f2b6dd4179fe8f82ed6c3dc5982a82f38157533465c5a0b21e1680ea95970f6"},"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":"c9a95b93da3c07c758a943b34abd14fb2a3082dab12fef32dc6ab3f3788617f4"},"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":"71aa5ebdd916aee053a96ee4058a3a64436af024cb0f909170d2b66e887ed41b"},"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":"2ddb2cc5b8de42a8f3533b1e7f0b5dee722bc2210b4ad87793528d52a3e1526b"},"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"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":"8dfabd57851c7bcb37baa8e9aafb9e1c51d861648a6ef22c4073e3d726c8c5f1"},"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":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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":"d40ca5f6448da5ab58da77f158ca164f9f772997ce1c9e783cfd31deca6343f9"},"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":"3dabcfbf97bc6e83ce69708e5f2b9ccbf97057c391cd2cb7efecd6adf257fca5"},"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":"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":"a85d7ee1aa3f0bdf3b87c4d0ce143081ccf22877626cf3af7d13318179d305f2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: listener.rs, config.rs, listener.rs, listener.rs, listener.rs: 5 files \u2014 \u0060crates/core/src/conn/native_tls/listener.rs\u0060, \u0060crates/core/src/conn/openssl/config.rs\u0060, \u0060crates/core/src/conn/openssl/listener.rs\u0060, \u0060crates/core/src/conn/quinn/listener.rs\u0060, \u0060crates/core/src/conn/rustls/listener.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 10 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca0cfae52ff3a58e4f3a0d96a27601b76491ebec683aa2df19b69772ebd9bc5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: cookie.rs, header.rs, path.rs, query.rs, json.rs: 5 files \u2014 \u0060crates/core/src/extract/parameter/cookie.rs\u0060, \u0060crates/core/src/extract/parameter/header.rs\u0060, \u0060crates/core/src/extract/parameter/path.rs\u0060, \u0060crates/core/src/extract/parameter/query.rs\u0060, \u0060crates/core/src/extract/payload/json.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 10 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/parameter/cookie.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edbe5b564627dbec2df30c0610d695779ef33669eb8ebe35da516fb67063ba5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: named_file.rs \u2194 seek.rs: \u0060crates/core/src/fs/named_file.rs\u0060 and \u0060crates/core/src/writing/seek.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 \u006050a835bf\u0060 fix(core): correct conditional-request ordering, multi-range and IPv6\u2026; \u0060572e1a50\u0060 Fix ReadSeeker range response streaming whole reader and harden range\u2026; \u0060bcbffbba\u0060 fix: prevent panic on empty Range header in NamedFile and ReadSeeker \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cd6e67ecdcaa707d287fa26d09a67a3fa772dfe836b7796c966128ab0c7463"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: req.rs \u2194 res.rs: \u0060crates/core/src/http/body/req.rs\u0060 and \u0060crates/core/src/http/body/res.rs\u0060 change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060dc4ea7ca\u0060 Document core HTTP types and validate ranges (#1682); \u00603cca8f64\u0060 Improve debug info for \u0060ReqBody\u0060 and \u0060ResBody\u0060 (#578); \u00605a954829\u0060 Add \u0060BytesFrame\u0060 type to wrap \u0060Frame\u003CBytes\u003E\u0060 (#447) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/req.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4fc51e3e835fca52bfaddb03425e871a0a3ff98a4db62dc55d62cb12617291"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking wait inside a handler: Timeout.handle: \u0060Timeout.handle\u0060 is an event/message handler that blocks the executor on a synchronous wait (\u0060block_on\u0060/\u0060blocking_recv\u0060/\u0060thread::sleep\u0060/a blocking \u0060recv()\u0060) \u2014 it stalls the handler and serialises throughput, and on an async runtime can starve the reactor. Either move the awaited work off the handler (\u0060tokio::spawn\u0060/\u0060Handle::current().spawn\u0060, if the result isn\u0027t needed inline) or make the handler itself \u0060async\u0060 so it can \u0060.await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/timeout.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c5520975ce3e16fbddfe3be0a01b12c0d072cd5fd02bc8867b80c4b77d947"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: No package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock \u2014 JS installs aren\u0027t reproducible (SSDF PW.4.4). Commit your package manager\u0027s lockfile and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"40a08798dc9f9c819eaa9f7c084938e1cf2517a9281aed2c31563d6f7d5ba90d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item \u0026\u0026 method.sig.ident == Ident::new(\u0022handle\u0022, Span::call_site())\u0060 appears character-identically in 2 files \u2014 crates/macros/src/handler.rs, crates/oapi-macros/src/endpoint.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec02b3e4462d9e45198eef1d7729c38f452aae299c9c293f5c6a7458e949c3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/swagger_ui/v5.32.11/swagger-ui-es-bundle.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e607b7670e9d6546fd3bb33d6a8927903baaf55ee9b00f64f6f1f44bffbf7ff"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/swagger_ui/v5.32.11/swagger-ui-bundle.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6ca1c3f8727c1f3f317b8b41d46b2ee9fe3f5e9115bf73b7a1776566fce9fa"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-321","guid":"0ce564a5-a44c-3358-b3db-317712e6e019","name":"CWE-321","shortDescription":{"text":"CWE-321"},"helpUri":"https://cwe.mitre.org/data/definitions/321.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":77,"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."]}]}