{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"StaticDir::handle (cyclomatic 59): StaticDir::handle has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent 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":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"33760eb50381afd803415ef7166a8d184bf1ae9059d667856ed2aee7c4cfb39d"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_tus::handlers::post::create (cyclomatic 53): salvo_tus::handlers::post::create has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent 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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35ed6f7802604277e442c8ddb9d6860ff57081819b80663e3890d5965b6361a"}},{"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":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5134da709a64017d50cdc2cd588b94cde31630cc3da81acccd65af9f9279c0"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_tus::handlers::patch::patch (cyclomatic 47): salvo_tus::handlers::patch::patch has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c1b8404c32a7b0ed8ce0b8e21aa036d4ae467059b07f0648f2bccd33452f98"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedFile::send_with_method (cyclomatic 42): NamedFile::send_with_method has cyclomatic complexity 42 (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":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe2b37182d128d6ead72113b3e5b756d3f62c52883816ff9504eff5e05080a"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_oapi_macros::bound::relevant_types (cyclomatic 40): salvo_oapi_macros::bound::relevant_types 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":"94328e0ae04470a397d61b0a443cb7bfeb1764054f7786121312e281c7c237a7"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedStructSchema::try_to_tokens (cyclomatic 37): NamedStructSchema::try_to_tokens has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent 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":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f01cbbb3552591621528ab9934458b469e57eaf32807d142b215e01b7ecfe9c"}},{"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":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2961c63f200bb9914f53a46f4881640fe184a96cc03e7fefc5d64b4a36efef"}},{"ruleId":"D1","level":"warning","message":{"text":"HyperHandler::handle (cyclomatic 33): HyperHandler::handle has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/service.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"620eade3c22dcc070201ac3875fd02f55546e0df6f853883d613a0eeefa937fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::serve_connection (cyclomatic 32): Builder::serve_connection has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf8098c32416c72ef23244a2d47c5b009d5785e9e65204de3d576dce42dffe7"}},{"ruleId":"D1","level":"warning","message":{"text":"Compression::handle (cyclomatic 30): Compression::handle has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e5bee9d530e92ea49e44d4f1bd45556f8facdc8150e5cbfcb0a6ac5f8e19a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadSeeker::send_inner (cyclomatic 27): ReadSeeker::send_inner has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/writing/seek.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7be96b885d230b4e96a91809dc8831165f9e68b74b781b28d44353f949f168"}},{"ruleId":"D1","level":"warning","message":{"text":"Proxy::build_proxied_request (cyclomatic 26): Proxy::build_proxied_request has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1194e9e260bb45e70e270b73e5b2d488d18ac55ed10d9238efac82e09e470c10"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_serve_static::embed::render_embedded_data (cyclomatic 26): salvo_serve_static::embed::render_embedded_data has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/embed.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b088fd9183f4d4de3b6cde0c7270f9770a11a1cb53f98be5222c7ae380654"}},{"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":"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":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8403d9a2e85b8afabacb528c57b3f1efba6041042ad6ab0bc4163ecfee6149f"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_macros::extract::generate (cyclomatic 22): salvo_macros::extract::generate has cyclomatic complexity 22 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 7 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/macros/src/extract.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace38617bb550587348cc35126364ae3e697d364c2640ff9ad7b7d5fa8ea2999"}},{"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":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b4b1a4eb66994a0deab7549a9d930bb683d55d0d1f42df70a03cf6501ce425"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenApi::merge_norm_node (cyclomatic 20): OpenApi::merge_norm_node has cyclomatic complexity 20 (threshold 15). Of this number, 18 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":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7494b6a8140123c2b1bfeac250bbf384ccdac905ff2670af0ef2b7f716ac09d"}},{"ruleId":"D1","level":"warning","message":{"text":"NormNode::with_method (cyclomatic 20): NormNode::with_method has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/routing.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dab7844361c2f2eb2e3b3acaa64dd5f7ffcf9b59b9166a674d9b25180aeaf32"}},{"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 branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bf1f06da987e36d9ba9431781a259730240d1496857de100405b621e30ff49"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_craft_macros::craft::rewrite_method (cyclomatic 19): salvo_craft_macros::craft::rewrite_method 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/craft-macros/src/craft.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0db1184351c2630d79e3f8b8b91cc926b1f4415191e719fe3c54f9fe121603b"}},{"ruleId":"D1","level":"warning","message":{"text":"CachePolicy::parse_bytes (cyclomatic 19): CachePolicy::parse_bytes 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/jwt-auth/src/oidc/cache.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932285878a28bec44cae8546e985ee3b049bf6265509140c14d3ef74008dec3"}},{"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":"check_macro_paths.main (cyclomatic 19): check_macro_paths.main 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":".github/scripts/check_macro_paths.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10389a527e6ffda7609526dc43e194fcee4fd9cca89d2314a157820b671fbd9"}},{"ruleId":"D1","level":"warning","message":{"text":"StraightStream::poll_write (cyclomatic 18): StraightStream::poll_write has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. 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 18): StraightStream::poll_write_vectored has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This 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":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966f4ec0b4109b0f960c2425003d66c9310dd54a79ad5d8a78fd5d8c2726ee5"}},{"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":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"953c37f21f482f2107368df4290113b02cf22cc6a7f6b98486f5a575f8df814c"}},{"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":67}}}],"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":"Tracing::handle (cyclomatic 17): Tracing::handle 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/otel/src/tracing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a71b8d55a99766440d495be66da3947640fb34c0547f9decd07371a5cd21cf"}},{"ruleId":"D1","level":"warning","message":{"text":"salvo_tus::handlers::head::head (cyclomatic 17): salvo_tus::handlers::head::head has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/head.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b047932286a9dbc8f63f04673983f024b49a1fbccdf9d39e436a1010076d8"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpRange::parse (cyclomatic 16): HttpRange::parse 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/core/src/http/range.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c645476b34868313674f7d7dbdbe82649aa83c4e03c66612b5e577ee38cd858"}},{"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":"SerdeValue::parse (cyclomatic 16): SerdeValue::parse has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serde-util/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d633a6d3023784dd17329ee42081feb6cbdaa274c1fb57cbc7666953421822a"}},{"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":190}}}],"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":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a88b83fa3aea20a6fe146c8796b7f820b95ba103d613fdec5ef709138da79a"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticDir::handle (cognitive 177): StaticDir::handle has cognitive complexity 177 (threshold 15). Drivers by points: if/else 48 (141 pts), loops 7 (27 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 114). 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":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ccc4eeec6dd59d56883295013c1e448f8f6d011b2bcc5ee36cc81f3040f20c"}},{"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":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"348000575e49f899b556cc347e1967be6f100bc6762d6dae6a8d718a1fd36f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedStructSchema::try_to_tokens (cognitive 80): NamedStructSchema::try_to_tokens has cognitive complexity 80 (threshold 15). Drivers by points: if/else 25 (49 pts), match/switch 7 (19 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its 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":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d4cacaa3e4c38b7b00ae7119159ceee1faa40a6fdd55f1c6682347019ec233"}},{"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":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c87826eb5ca45a7e9016f1493ecd107cb807749fd4bd51a699bb6ac5762861e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::serve_connection (cognitive 71): Builder::serve_connection has cognitive complexity 71 (threshold 15). Drivers by points: match/switch 12 (36 pts), if/else 16 (34 pts), loops 1 (nesting depth added 42). 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":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbac8952497e808324a860db4016ffc4e7657c1bcb6877f8d1c75019962f8f90"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_tus::handlers::patch::patch (cognitive 66): salvo_tus::handlers::patch::patch has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (40 pts), match/switch 13 (21 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0a684b653b8fd0506d080fd92ecebcd7ed1fad8b95a79a3e70c84b578b837"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_tus::handlers::post::create (cognitive 66): salvo_tus::handlers::post::create has cognitive complexity 66 (threshold 15). Drivers by points: if/else 29 (40 pts), match/switch 11 (17 pts), boolean chains 9 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea30145d40c5f9e2c280d8a9db6515b9a3e5a362e7ac062111f5fba22bc75ce"}},{"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":"NamedFile::send_with_method (cognitive 59): NamedFile::send_with_method has cognitive complexity 59 (threshold 15). Drivers by points: if/else 36 (42 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 12). 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":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b9db93534cb995a5f4d5b8278b59062a261d52313082c8b844d01518d5ddb0"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperHandler::handle (cognitive 50): HyperHandler::handle has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (38 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/service.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"154e82a87c222da76b749d02689f819f948a3351fe1a170c00cfa3dbe1a4de1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Compression::handle (cognitive 47): Compression::handle has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (43 pts), boolean chains 3, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef79118d0397b05a75417af72c5534a3bfe4a0332d823be9bcba40982ea6a0"}},{"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":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b046b903f6eabe0dc4576a7a2b6a2e7dcaef5c95cbbc9a73b3f9ac54edfaac1c"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_serve_static::embed::render_embedded_data (cognitive 43): salvo_serve_static::embed::render_embedded_data has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (29 pts), match/switch 3 (9 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/embed.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5476d474b7455807b66f9773d2e0566297369e02ba20f2f7c2ae22c409b9ff2c"}},{"ruleId":"D2","level":"warning","message":{"text":"Proxy::build_proxied_request (cognitive 42): Proxy::build_proxied_request has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (30 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"da20184c707b0d0cbb41597756f719854a920d54f86f07c94662c1eb0474c667"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_oapi_macros::bound::relevant_types (cognitive 38): salvo_oapi_macros::bound::relevant_types 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":"a8dfaa1180ab27a23f2bd886dbd476f66ea519df9179523d59e60f481d28501e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenApi::merge_norm_node (cognitive 36): OpenApi::merge_norm_node has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (11 pts), boolean chains 4, loops 1 (nesting depth added 16). Of this number, 33 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":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24331a13d7dec1ac7c60b47cf3a55a8bd9f63af84a6ae9df18b18e6fe9770ce"}},{"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":"StraightStream::poll_write (cognitive 33): StraightStream::poll_write has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. 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 33): StraightStream::poll_write_vectored has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. 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":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e2145b2803440725a0f1c015703ffbe8b1834c4e92e76b3b267c188971c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSeeker::send_inner (cognitive 33): ReadSeeker::send_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/writing/seek.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f3967457eace5b77f48fb8c3f5d0f43519c30329baaafaa0bedd3e92c05b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"check_macro_paths.main (cognitive 33): check_macro_paths.main has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 10 (20 pts), if/else 6 (11 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/check_macro_paths.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9c1361e88effa3043bd235b8ddb53f7b813a6d5b633eaf7b38918caac8690"}},{"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":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d33054e20c405b864566ff47f21c29a17f78b2246de85e84945c14c86f98708"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::try_serve (cognitive 31): Server::try_serve has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 7 (11 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9ffa3415e2b50257f1eea7a743f44d2cc65ce3f74a0c2d6a58cf627c7055fb"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_macros::extract::generate (cognitive 31): salvo_macros::extract::generate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 4 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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/macros/src/extract.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d801f4355df7c3b67f8aebc539c4b3d7585861a7d20da35e11763e7a81ade0"}},{"ruleId":"D2","level":"warning","message":{"text":"FormData::read_with_directory (cognitive 29): FormData::read_with_directory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/form.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"53abeef386e29d7512abb07d093ead70ec7c6f660c7788112d7af4ae5f5d5538"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpRange::parse (cognitive 27): HttpRange::parse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (26 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":44}}}],"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":"NormNode::with_method (cognitive 25): NormNode::with_method has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/routing.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ce6b0ebbdf23d96c518be0e6fb53c00f0d6287a56d8e0107e1eafdd06dac4e"}},{"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":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3c7bfa527d37ddc1240c0b073a8086bd7235b2f596aa12126175517c411edd"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_craft_macros::craft::rewrite_method (cognitive 24): salvo_craft_macros::craft::rewrite_method has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (7 pts), boolean chains 3, 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/craft-macros/src/craft.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee4e3f925c346ad2b7aab7c795476ed8a7133e7141fc24abda8585c071e3a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Csrf::handle (cognitive 24): Csrf::handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/lib.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5676dc644fecdd778d6a084c32ed42de12274208b2755b2b744a2bc77c21c138"}},{"ruleId":"D2","level":"warning","message":{"text":"CachePolicy::parse_bytes (cognitive 24): CachePolicy::parse_bytes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, 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/jwt-auth/src/oidc/cache.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cbdba9069455230983638286ac840a1e8f4d2a04677d2f88d71a4ca9bd6c87"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatParser::next (cognitive 23): FlatParser::next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/flat_value.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed417f6a7e2e293a63322da910b9664d8008b4e7ca8676745ea322e426aeb67"}},{"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":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fb6de6ddddccde8560ff5e408facc518cbdf349bc435d01402ffe3c21f7526"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionHandler::handle (cognitive 23): SessionHandler::handle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/session/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"519551743eca6d4b646817f3f5a5d8164d7731b7b6146778d9eacb56bd3f5b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_tus::handlers::head::head (cognitive 23): salvo_tus::handlers::head::head has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 4 (5 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/tus/src/handlers/head.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f7772d044d4ef9e412c755c0d3ea34def5c11c98b94bd12a5f3ef8d2e42e58"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketUpgrade::upgrade (cognitive 22): WebSocketUpgrade::upgrade has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 2 (4 pts) (nesting depth added 5). 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":"RequestBodyAttr::try_to_tokens (cognitive 21): RequestBodyAttr::try_to_tokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 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":"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":202}}}],"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":"Tracing::handle (cognitive 20): Tracing::handle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 2, 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":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc780f14ef3187f91583132a25ac11547acc8d277574f8cdc9ea08c59917ee5a"}},{"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":"Router::detect_with_method (cognitive 19): Router::detect_with_method 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":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d6d4d706ad5197293c8872545a1ab84ee3593664b2168fdceea93d566d958b"}},{"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":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d62b00d8b2fcaa3467d6f2b252984efea2af8b294bf8d7e8dbdf1856607328"}},{"ruleId":"D2","level":"warning","message":{"text":"ToSchema::try_to_tokens (cognitive 19): ToSchema::try_to_tokens has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdca471dd401ced501f157b603253af5873d543cdff11906c82c0ede9c90daf"}},{"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":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3e45fb05f302c20b1448ccdb6244fcab014e38518b490b1b5a0eccfb5547c4"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeStream::poll_next (cognitive 18): EncodeStream::poll_next has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (7 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/compression/src/stream.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e716319add329c839ce29da3af6494facb5fa662e71777c6603125a740b27a8e"}},{"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":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1f18529683096922d96692c5062ab455c89c544fb3e1e5e58b336841ecfc9"}},{"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":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a2a77b18f63e9419b74af443bb163b67daf06cdb2cf588c1230d24f0c22a37"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_oapi_macros::endpoint::generate (cognitive 18): salvo_oapi_macros::endpoint::generate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/endpoint.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6294ee812eed9c871373817e1a8d3875fd1cefaf869808814ab5cd1e2df78d2b"}},{"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":"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":761}}}],"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":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d93349df34485150ede97f8ddeab6b85e7d24d9abb090a611a290784854e99e"}},{"ruleId":"D2","level":"warning","message":{"text":"salvo_core::routing::path_state::parse_path_parts (cognitive 17): salvo_core::routing::path_state::parse_path_parts has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (5 pts), match/switch 2 (5 pts), if/else 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/path_state.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa48d248666df9612db25850e030a7a109105a50f7e802e912a8adfb42b04f0d"}},{"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":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5566fd37d59d46e9a39960f8177a1df70107c369ea846776704b82cc5c5260a"}},{"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":"salvo_serve_static::dir::list_html (cognitive 17): salvo_serve_static::dir::list_html has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 1 belongs 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/serve-static/src/dir.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae95e0ba396b2837575abbbe27c22935ddddcf480ced75b9a7bb3e1924d0747c"}},{"ruleId":"D2","level":"warning","message":{"text":"AcmeListenerBuilder::try_bind (cognitive 16): AcmeListenerBuilder::try_bind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 3, 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/acme/src/listener.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"21efb919f509b9dc6ef086a64c30192331a812e5f97bcd19dae261585006c94a"}},{"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":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f150698cd8d82dc379c6ca70d784b98bf88b4a22d95b48f03e9c346c6e3eb4"}},{"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":180}}}],"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":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3512cad1b0b7290fe396638bb31110f2f535709ae8b352cd63e3b90ef9641202"}},{"ruleId":"D2","level":"warning","message":{"text":"SerdeValue::parse (cognitive 16): SerdeValue::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serde-util/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6aeba124440354f17c8296bde59e417c19947dca90f2f4074d3ff58e624f62"}},{"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":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ddaf0e36f3462fa564f8d8fc65ecc0c88404e3b7169bcd9c6034a2b40dfda"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskStore::try_finalize_if_complete (cognitive 16): DiskStore::try_finalize_if_complete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 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/tus/src/stores/disk.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce1765921f4fcb73b76ebb2f034899ce1097cfcf6dc01a99e0b179072aeebca"}},{"ruleId":"D2","level":"warning","message":{"text":"check_macro_contracts.main (cognitive 16): check_macro_contracts.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3, error handling 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/check_macro_contracts.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d77608eb40d6a83f3dc0ee0781fa40a76a48f0446155f5d5a9a779dcdb6a914"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamedStructSchema.try_to_tokens: MethodTooLong \u2014 try_to_tokens runs 260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e311349d7ef0b100cd649548a18ecba88fcc12429f67922e79932cb51c16c52f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Request: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\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":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c2c5444dc3744572614fded5836992637b3e8c789d6d0ef773e00bb1274ea"}},{"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":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e217129a35e3dfa47fbb1911fd336d89d91f824abbdd11978cf8bd4a55a346d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticDir.handle: MethodTooLong \u2014 handle runs 190 significant 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 90 over it, 1.90\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":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a522fedd8ffbeccb3b881854c5feebad6d62a4c15e92bcb78ebe4ccb2c0025f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/enum_schemas.rs: FileTooLong \u2014 935 significant 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 435 over it, 1.87\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/enum_schemas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e65b5835ac9b20af24fdaff154a3ed36d979112348efd4a18ce89b57aa4156"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_tus::handlers::post::create: FunctionTooLong \u2014 salvo_tus::handlers::post::create runs 178 significant 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 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"920aeb44731aba6e2d66350a92e23fa83d63f85e15538838d7e5ab120a02e8f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_tus::handlers::patch::patch: FunctionTooLong \u2014 salvo_tus::handlers::patch::patch runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cd1729e0642d229164e6ff1e7d94be258b52ce67277b1b1a9c8927474c94ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamedFile.send_with_method: MethodTooLong \u2014 send_with_method runs 167 significant 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 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9b4eea90127de132ffbecea2f47a016ffd8f88aa5293d954ec2085bb19f1a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filters/path.rs: FileTooLong \u2014 825 significant 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 325 over it, 1.65\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":"ClassTooLong: Request: ClassTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 76 methods, 4 blocks, lines 203-1716. The bar is 400 significant lines; this is 247 over it, 1.62\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/request.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab88dea67915c53f50cc22c1f9951d87948382752de8c818d33d82770bad6197"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Router: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2ced510307f652d47ba08dd7e084bb37c33071602d47fa2a10c147283a379a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_macros::extract::generate: FunctionTooLong \u2014 salvo_macros::extract::generate runs 153 significant 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 53 over it, 1.53\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":"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":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a4119c989253243eb062cadd4920de000d157ed01785df48b553d5dc89edb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/request.rs: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Request (4 blocks, 203-1716). The bar is 500 significant lines; this is 256 over it, 1.51\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: ToParameters.try_to_tokens: MethodTooLong \u2014 try_to_tokens runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/parameter/derive.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4736592494c16920539f0419fc176f5ceb778068799ec4f9bc08df17c3ee04d2"}},{"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: 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":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5141d8ce4e8f91829f50d487effce7f27899b77f18a69a475acb7b2cd49c4ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnumSchema.new: MethodTooLong \u2014 new 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/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66a830696a1177bb24a17277ef7d2dfba772617650ec5c0ef1d8c2b10d3a320"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dir.rs: FileTooLong \u2014 697 significant 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 197 over it, 1.39\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":"ClassTooLong: ComplexEnum: ClassTooLong \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), 6 methods, 3 blocks, lines 511-1234. The bar is 400 significant lines; this is 152 over it, 1.38\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":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27673eedea259e1aee93955fa8493bbb822b831c6d4c19f016102810019003"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.serve_connection: MethodTooLong \u2014 serve_connection runs 137 significant 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 37 over it, 1.37\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":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"42066763100c42b74ec05a2702d06f832b2b6c3a18d8e1dc9323ada7923f2524"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_serve_static::embed::render_embedded_data: FunctionTooLong \u2014 salvo_serve_static::embed::render_embedded_data runs 137 significant 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 37 over it, 1.37\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/embed.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eabdc70cb791ac756fe3a70c531399c1af40bf37a6625977cee31582d5848a1"}},{"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":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa66aa30ca61b3afbd963ba97e1d24b6dfcf78e5acab5cb6affd3418a4c7c12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/named_file.rs: FileTooLong \u2014 641 significant 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 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fs/named_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd6d5c55fd7010d0fd2291ae21ac039874ffff1ca8cc6375ee75290e3596766"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComponentSchema: ClassTooLong \u2014 489 significant 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-732. The bar is 400 significant lines; this is 89 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: feature/attributes.rs: FileTooLong \u2014 607 significant 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 107 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":"FunctionTooLong: salvo_craft_macros::craft::rewrite_method: FunctionTooLong \u2014 salvo_craft_macros::craft::rewrite_method 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/craft-macros/src/craft.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0199407812d06303227cafc9addc9a4d6baafb334a6d68d189b8033fcf8bb364"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToSchema.try_to_tokens: MethodTooLong \u2014 try_to_tokens runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5ada1d496fe1b6b9793208adf247cd24f942faae4d6440e737645e08afd034"}},{"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":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea40312a02112e095cebaaa117191b0ecc08bcbe16e3ffd0c673bb6919559479"}},{"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 569 significant 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 69 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/response.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2988fea197558769fc015539ca545203d70bea135e1ba9df8a54f6ac25e5b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/component.rs: FileTooLong \u2014 555 significant 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-732). The bar is 500 significant lines; this is 55 over it, 1.11\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":"FunctionTooLong: salvo_oapi_macros::endpoint::generate: FunctionTooLong \u2014 salvo_oapi_macros::endpoint::generate runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/endpoint.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d88841d39b460bb5bfdab2d29ca07bbccd73ad9b5e91f74d3c061d532e71d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: salvo_oapi_macros::bound::relevant_types: FunctionTooLong \u2014 salvo_oapi_macros::bound::relevant_types runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/bound.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ab2dfecf714ef0b2cd3bae73df31874284a98df246cb03ee990b9b3469c03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/struct_schemas.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: NamedStructSchema (3 blocks, 30-551). The bar is 500 significant lines; this is 11 over it, 1.02\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/struct_schemas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483ab9f3fe8865b531793b02d2d81d371d534223a1b8480c63fbb92a5fd90211"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/openapi.rs: FileTooLong \u2014 508 significant 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-790). The bar is 500 significant lines; this is 8 over it, 1.02\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":"D4","level":"warning","message":{"text":"Near-duplicate member pair (112 shared lines): crates/oapi-macros/src/schema/enum_schemas.rs:767-960 | crates/oapi-macros/src/schema/enum_schemas.rs:973-1131 \u2014 These two members are variants of one another: 112 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":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc014b1a8a1b02e3aa812713ac79b26c0e10d67beb506009bf5bc9540adeac5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (29 shared lines): crates/macros/src/handler.rs:96-206 | crates/oapi-macros/src/endpoint.rs:320-421 \u2014 These two members are variants of one another: 29 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/macros/src/handler.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae510855520674e730ce100ecbe2ca5178aa4673df3471ccaa1639ae5ed84a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/tus/src/handlers/delete.rs:14-74 | crates/tus/src/handlers/get.rs:16-115 | crates/tus/src/handlers/head.rs:15-118 | crates/tus/src/handlers/patch.rs:18-300 | crates/tus/src/handlers/post.rs:22-300 | crates/tus/src/method_override.rs:75-91 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea62fa7d0b53506577e0216ece03a628e92678b5f69481f655a2eebdd703aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/core/src/conn/stream/straight.rs:116-180 | crates/core/src/conn/stream/straight.rs:194-256 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb3766cbbf4637d94bc4dd15da718ae34c74d688243d64fa593b360e7055fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/oapi-macros/src/schema_type.rs:66-137 | crates/oapi-macros/src/schema_type.rs:356-426 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema_type.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97368687b2a1ba68d6d7ac4207900e270c219efd6f4cceee5fc2bcabe697abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/oapi-macros/src/operation/example.rs:19-71 | crates/oapi-macros/src/server.rs:118-164 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/example.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"715d50dee1b7f5e23014d8a83daece289da42bfd8a85687e4ba7d4a0e5d64ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/core/src/conn/tcp.rs:228-267 | crates/core/src/conn/unix.rs:172-211 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/tcp.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c75e166d0d8b4a0cb71d6b216aabfe952566a27a6ca5e4fce068b146fe59a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/macros/src/shared.rs:113-142 | crates/oapi-macros/src/shared.rs:130-158 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec7835d130d9157648d1bd3c001528047d88404d2fb5cd45c74e89a451a66ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/oapi-macros/src/response/derive.rs:307-359 | crates/oapi-macros/src/response/derive.rs:407-447 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a29e98290cf6ee3bd03803d23c1ece5a1dce2f77db3b480a79caf309cfb1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/cache/src/lib.rs:803-837 | crates/compression/src/lib.rs:644-677 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cache/src/lib.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ce6dacef28ca5de76452666d3824acaa2a3430a66de38ce4b3c9377d04368e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/macros/src/shared.rs:33-72 | crates/oapi-macros/src/shared.rs:55-92 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44fd1aeb2d14ee0cab09d4bdcac68ed5dd75e6529b6b36a62f7048acdb6ee78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/core/src/conn/native_tls/listener.rs:62-90 | crates/core/src/conn/openssl/listener.rs:64-84 | crates/core/src/conn/rustls/listener.rs:62-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c213dc8a7f0c6a8b9d50a59d6f808ffa716b68f86a060ce71723a7718f8df79c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/oapi-macros/src/operation/encoding.rs:22-58 | crates/oapi-macros/src/server.rs:19-61 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/encoding.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7338c2c3902e2a870628912d840cc1716fb298db9e90a329bcd863f4109bbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/core/src/extract/case.rs:56-79 | crates/serde-util/src/case.rs:94-116 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/case.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04937ea9e649e55aa535a8c8219cae3480092625220f303a40e908fc2f6e727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/oapi/src/rapidoc.rs:104-122 | crates/oapi/src/redoc.rs:119-137 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/rapidoc.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc443911491b35f727f84e1b8eb29285b1bdfaf324c77ca9ff4aaa95b6a92b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/core/src/conn/openssl/listener.rs:203-235 | crates/core/src/conn/rustls/listener.rs:204-232 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/openssl/listener.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0ce4d229ddb406d0988ba21e04b9e2bbb00778c7f55c5467b025621da7d1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/routing/filters/others.rs:177-190 | crates/core/src/routing/filters/others.rs:249-264 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/others.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dda26a3840b40b9b1842498a48001c1c9fe8989b425c307b25377bba5a51b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/core/src/extract/case.rs:86-111 | crates/serde-util/src/case.rs:120-146 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/case.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85472e3749ea342c65eaea53feb0da06a2b5c19f246147f56d6b8fedd44bd89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/oapi/src/naming.rs:222-237 | crates/oapi/src/naming.rs:313-329 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/naming.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5585325e86466e7fcc7009afba6c0cdfc7b275e1e6e23c8dd2b18ae260a2b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rate-limiter/src/lib.rs:333-358 | crates/rate-limiter/src/lib.rs:363-386 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rate-limiter/src/lib.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa049f4e54e29f2431b3ec74915cec86484b4c728f07a85b98cf3dcd8aed02a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/core/src/catcher.rs:426-451 | crates/core/src/catcher.rs:480-500 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/catcher.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec55718e0d227b687a0669d1c54d1ff6aca873aaa28fdf0003e36787bc5834c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/oapi/src/openapi.rs:889-909 | crates/oapi/src/openapi.rs:945-965 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ca2fc143474311d3434a2ef306ed4740a902f8bda687202f8ee2a588b3c936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/oapi-macros/src/response.rs:449-465 | crates/oapi-macros/src/schema/feature.rs:259-268 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd119db8d7f67cb72a6e5bcce3cb3b245c0c38b838a4ca4caff0bae90c744696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/oapi-macros/src/response.rs:478-496 | crates/oapi-macros/src/response.rs:553-573 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5925138cc0cb30f3c3f625c366552eede3f8c8120b35648df6d2c59e08c04f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/oapi/src/extract/payload.rs:101-117 | crates/oapi/src/extract/payload.rs:121-139 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/extract/payload.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bdfe52d315f09cf8e1459e3f5b6b5c1a955beffe6f329a711570d4694f9fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/core/src/conn/openssl/listener.rs:94-114 | crates/core/src/conn/quinn/listener.rs:101-121 | crates/core/src/conn/rustls/listener.rs:94-116 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/openssl/listener.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a92a693a9c1599e37b7ca128ef5be8e206a45027094aaec886d72a298a326cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/http/body/req.rs:205-212 | crates/core/src/http/body/res.rs:231-238 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/req.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"156553636b9b8245349085e552aac8fbca93b50208a62310b9636d9981fa9cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/src/conn/stream/handshake.rs:115-124 | crates/core/src/conn/stream/handshake.rs:150-159 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/handshake.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0a0e05e8e1b7a5271a7042caa1eb83f3ac756921371649c5ba95bc42926c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/core/src/catcher.rs:344-357 | crates/oapi/src/html.rs:1-14 | crates/serve-static/src/dir.rs:907-920 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/catcher.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cb9fa139910ca2e492122dd748bb3385086a218309be0f7634dfb39e62705e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/oapi-macros/src/response.rs:257-270 | crates/oapi-macros/src/response.rs:275-288 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9c351e5655bebf4afdf898162b70888788604c9d69eb04dc98e3beb8dcfe99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/core/src/conn/openssl/config.rs:94-104 | crates/core/src/conn/rustls/config.rs:132-142 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/openssl/config.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00a85d0987682f98f4ec8bff5947c489c45d42c317a23205c94034eceaff268"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/acme/src/listener.rs:43-56 | crates/core/src/conn/rustls.rs:38-51 | crates/proxy/src/hyper_client.rs:39-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/acme/src/listener.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"587fefe05a3e412660248ececfe5f63ca6877579edc76274cdbec032156c1d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/compression/src/encoder.rs:62-69 | crates/compression/src/encoder.rs:72-79 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/encoder.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f7d90ce437f3761f0b681c0dd8a137caec9c66675e8bd7c5cecc120d50a193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/cors/src/inner.rs:50-57 | crates/cors/src/inner.rs:89-97 | crates/cors/src/inner.rs:126-133 | crates/cors/src/inner.rs:151-158 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/inner.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5499acb84f4124d3b8fc0bb6ff7ea717ba99c978a48dc5e86731662461c53dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/oapi-macros/src/response/link.rs:15-24 | crates/oapi-macros/src/response/link.rs:153-163 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/link.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6646a4362b1beaa4e76bf883bcd0df9866d069d3bb3273641f5b74d86ae108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cors/src/inner.rs:77-85 | crates/cors/src/inner.rs:115-122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/inner.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a213f8699a38c41794ec1c56702357d62a1331307803efc46d8c8b007b65c147"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/core/src/conn/stream/handshake.rs:126-134 | crates/core/src/conn/stream/handshake.rs:136-144 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/handshake.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"255561cb31c6222dadb8aae976b95b2005b49d375f6c3b013410ccf1d1d5d32b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/macros/src/attribute.rs:5-15 | crates/oapi-macros/src/attribute.rs:16-26 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/attribute.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca2c8866258387b7cf4d8b34d65743df8e80858c13fbe029c31089dee913d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/routing/filters/opts.rs:45-58 | crates/core/src/routing/filters/opts.rs:73-86 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/opts.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b509894fcbc87180f3f77370dd6e04fda4dbcf02ce21c21c303d276aacbf2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/oapi/src/openapi/security.rs:550-562 | crates/oapi/src/openapi/security.rs:596-608 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/security.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43303d6930bbfff7ae7d953b8e6f0f633966fb296cb919713a540e760b4947f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/oapi-macros/src/parameter/derive.rs:355-387 | crates/oapi-macros/src/parameter.rs:215-241 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/parameter/derive.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4083c4ef44985b8891321aff42243b94777027041c487aad8b05ebb96a766b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/jwt-auth/src/oidc/cache.rs:239-245 | crates/jwt-auth/src/oidc/cache.rs:247-256 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/jwt-auth/src/oidc/cache.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3778e3a67692583dcaec9be706ebecb533326993631d112ff4d0751e6692ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/cors/src/allow_methods.rs:49-57 | crates/cors/src/allow_headers.rs:39-45 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/allow_methods.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4523c7acdc72f66d1cf0d8d4ffc6f84d7adef1a9ddd87fd8ca1b6bca2d51f0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/craft-macros/src/lib.rs:83-89 | crates/macros/src/lib.rs:70-76 | crates/oapi-macros/src/lib.rs:91-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/craft-macros/src/lib.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e20cf6f21e1c64c3162639c96f61453e6d4dc5729604f66b41b00ec2f2f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/oapi-macros/src/response.rs:25-34 | crates/oapi-macros/src/schema.rs:35-44 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"995af48db6eaae94b9a2bb8c86e7ab77d33eceea25a99b706941b197ce1d01f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/extract/parameter/header.rs:113-120 | crates/core/src/extract/parameter/query.rs:99-106 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/extract/parameter/header.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f75b87bbf4d3e5da4d493344c4e7b8f3c1c93a785014c3d71f859e0f3cc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/oapi/src/openapi.rs:523-530 | crates/oapi/src/openapi/components.rs:185-192 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"371bc6350d1225e6ca7f2a5b65ab3890d96d10e70fa6414dd9598064f4aa36de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/oapi/src/openapi.rs:554-561 | crates/oapi/src/openapi/components.rs:214-221 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5664938f23d29a41e2b6ecf578c5f97b31f7826a6321f7c331623a1d61f4c03b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/oapi/src/openapi.rs:411-417 | crates/oapi/src/openapi/operation.rs:317-323 | crates/oapi/src/openapi/parameter.rs:433-439 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c553e5fc65cd825f40b02962938bb30235674d382248c7217138100d34eada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/core/src/serde/flat_value.rs:97-103 | crates/core/src/serde/vec_value.rs:83-89 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/flat_value.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91589200437c3f28d4b5fffb5bd8ca79e98a2316b475951d1bfdb9e9d8ec96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/core/src/serde/flat_value.rs:109-115 | crates/core/src/serde/vec_value.rs:95-101 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/flat_value.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcb54a13483633fdebf6c3025fc3fd85bc3974fcd5c6526780bb1aaad5fb0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/oapi/src/openapi.rs:481-488 | crates/oapi/src/openapi/components.rs:143-150 | crates/oapi/src/openapi/content.rs:152-160 | crates/oapi/src/openapi/response.rs:112-117 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c755c9222ce7591ea4557c4a4e5bab1836c38891c9caebca25116db2c6fd24c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/csrf/src/lib.rs:328-335 | crates/jwt-auth/src/lib.rs:466-473 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/lib.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba93766d8e9bc85761e9878edf442767b2ec41b1fd611c158b67a8f96e9b5b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/oapi/src/openapi/schema/object.rs:279-287 | crates/oapi/src/swagger_ui/config.rs:635-644 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/schema/object.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ae201416ad1ba23ed9d6bddb4e909a7279f357d7e9d96f4e62208036bc5160"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/core/src/conn/openssl/config.rs:58-62 | crates/core/src/conn/rustls/config.rs:73-77 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/openssl/config.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da1310a28df026758f42de08ccac33d559b6daf06bb71d94d60e507fdf9e9d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/cors/src/expose_headers.rs:85-88 | crates/cors/src/max_age.rs:65-68 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/expose_headers.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4d4de965442a5eec956fa714b3e44fcabf7f4de04d269dbcafcf558bbea178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/core/src/conn/stream/straight.rs:137-177 | crates/core/src/conn/stream/straight.rs:213-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/stream/straight.rs:137\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":137}}}],"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:922-960 | crates/oapi-macros/src/schema/enum_schemas.rs:1092-1131 \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":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f1c1fe84206840f349088423996bfdc9855774d6a8931ff1ce968b7dab231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:768-805 | crates/oapi-macros/src/schema/enum_schemas.rs:974-1011 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:768\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fd7f7d077e58d9fd84699ef9ce24ef9d02e3382fea91c515aad23ceda828a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 3): crates/craft-macros/src/utils.rs:32-79 | crates/macros/src/shared.rs:180-227 | crates/oapi-macros/src/shared.rs:546-593 \u2014 before extracting anything, compare \u0060crates/craft-macros/src/utils.rs\u0060 and \u0060crates/macros/src/shared.rs\u0060 as WHOLE FILES: 89% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/craft-macros/src/utils.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/craft-macros/src/utils.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b52dd204a4a705182df000e6c41d07e8a3ec076beba7bb30802a9dcde445514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): crates/core/src/fs/named_file.rs:965-1000 | crates/core/src/writing/seek.rs:154-188 \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 3 separate duplicated blocks between them, totalling at least 64 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":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"3344b3e903b4293c750367e620f9eb5bdb4c1d78aba5b4c702a69d23dad01cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201330 lines \u00D7 2): crates/oapi-macros/src/operation/request_body.rs:165-188 | crates/oapi-macros/src/response.rs:325-354 \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 60 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/operation/request_body.rs:165\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd7a9a13b3ad278d22bd56e65fb3cd1e4e146ebf11ec8128f58bda454979d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): crates/core/src/conn/native_tls/listener.rs:154-181 | crates/core/src/conn/openssl/listener.rs:141-168 | crates/core/src/conn/rustls/listener.rs:143-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 3 separate duplicated blocks between them, totalling at least 50 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060current_acceptor\u0060 to \u0060Arc\u003CArcSwapOption\u003Ctokio_native_tls::TlsAcceptor\u003E\u003E\u0060 in one and \u0060Arc\u003CArcSwapOption\u003CSslAcceptor\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d990642194173f9b4563b354e0761b1148adc3a32c9fab82af2da49d05fb4ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/core/src/server.rs:390-415 | crates/core/src/server.rs:567-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/server.rs:390\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"984024b0b6ed35a08aee24cc534920b13197fbe3f7e839b5d6aa0cebd9c7c4e3"}},{"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 135 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae503546cd5cc905f3ff26186e706adedd70b278ed80187f784d233fa8dfc33"}},{"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 135 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/shared.rs:117\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tokens\u0060 to \u0060proc_macro2::TokenStream\u0060 in one and \u0060TokenStream\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:545-570 | crates/oapi-macros/src/schema/enum_schemas.rs:593-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8c509d06df53679552024c19eae523d1b6dd1b88bb0f393c7e6eda32a44969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/core/src/conn/tcp.rs:237-261 | crates/core/src/conn/unix.rs:181-205 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/tcp.rs:237\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/tcp.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd70d845da2c1e9d4e5730305be6329224d7eb3d03de15e16de25b00bd482d2"}},{"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:182-205 \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 73 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/handler.rs:16\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:503-526 | crates/oapi-macros/src/response.rs:601-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/response.rs:503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2014fc3379ec49e80418b5e5e26783ac6125a5eadde78715ade9f9d5ad38034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/csrf/src/aes_gcm_cipher.rs:57-79 | crates/csrf/src/ccp_cipher.rs:57-79 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/aes_gcm_cipher.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2dd98f661fd9989e720b2b9084b0e40e44b44c5898c62e057df385e4eb7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:844-866 | crates/oapi-macros/src/schema/enum_schemas.rs:1030-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:844\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/oapi-macros/src/schema/enum_schemas.rs:1055\u0060 calls \u0060Some\u0060 and \u0060crates/oapi-macros/src/schema/enum_schemas.rs:867\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cb8515a5eeee69be6218248d8caf7d9c6a46436e242f13b26c48cc815a2f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/proxy/src/hyper_client.rs:149-169 | crates/proxy/src/reqwest_client.rs:105-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/proxy/src/hyper_client.rs:149\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/proxy/src/hyper_client.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d0d44fa89c1768f639701c6eae3824d8a3f88c7cf8c5aa65d34a9d2ad42a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/oapi-macros/src/schema/enum_schemas.rs:540-559 | crates/oapi-macros/src/schema/enum_schemas.rs:769-788 | crates/oapi-macros/src/schema/enum_schemas.rs:975-994 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:540\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/oapi-macros/src/schema/enum_schemas.rs:768\u0060 calls \u0060oapi_crate\u0060 and \u0060crates/oapi-macros/src/schema/enum_schemas.rs:538\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d247c7d3d7843f2d332daaee671621c5391cab265655bd261c9c4eb97142b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/cache/src/lib.rs:804-822 | crates/compression/src/lib.rs:645-664 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cache/src/lib.rs:804\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060headers\u0060 to \u0060\u0026HeaderMap\u0060 in one and \u0060\u0026http::HeaderMap\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cache/src/lib.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6837c5e4714afc2e3cc208578b5db1306f4229f38090867b02fde457fb9773d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/macros/src/handler.rs:51-70 | crates/oapi-macros/src/endpoint.rs:258-277 \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 73 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/oapi-macros/src/endpoint.rs:278\u0060 calls \u0060type_name_suffix\u0060 and \u0060crates/macros/src/handler.rs:71\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb646555850ffe02f5a24f0b258ec13c5b0270ab9ee11a3cdb7cf7ca41578ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201319 lines \u00D7 3): crates/oapi-macros/src/operation/request_body.rs:170-182 | crates/oapi-macros/src/response.rs:331-349 | crates/oapi-macros/src/response.rs:921-931 \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 60 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/response.rs:921\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26edee2d3611878b1b94445a7be6b7181824a2ada2d54a9ffd31d25099a4095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:139-157 | crates/oapi-macros/src/schema/enum_schemas.rs:179-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:179\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6911b167acecadcdc507aa7a17b7e9e7014d76bc65171421c3f8b03cc6a3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:165-183 | crates/oapi-macros/src/schema/enum_schemas.rs:201-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d78bfc70ed832b3a85834917d48298902b9371248290b28a62fe05d6e319aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/oapi-macros/src/schema/enum_schemas.rs:590-607 | crates/oapi-macros/src/schema/enum_schemas.rs:846-863 | crates/oapi-macros/src/schema/enum_schemas.rs:1032-1049 \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":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5574066c26cb89313e7c25521473c4a670a590ef794d9468da8222f23d465f3e"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/extract/case.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060variant\u0060 to \u0060impl AsRef\u003Cstr\u003E\u0060 in one and \u0060\u0026str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/serde-util/src/case.rs:98\u0060 calls \u0060to_owned\u0060 and \u0060crates/core/src/extract/case.rs:61\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/component.rs:139\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:479-496 | crates/oapi-macros/src/response.rs:556-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/response.rs:556\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5339d22d596360fba3816a511c88ad6e5d539c52c6b20ad810d778d3e3b7670c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/oapi-macros/src/schema/enum_variant.rs:237-254 | crates/oapi-macros/src/schema/enum_variant.rs:343-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_variant.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_variant.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f913fde3ef2026077076e727699a9527939689c912b3ffdd733aa774165651b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/core/src/http/body/channel.rs:103-119 | 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/body/channel.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ee939d2e4aa0c22c5436d01828c1b34ff5bedce55f94321af3ee9efa2b5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/extra/src/tower_compat.rs:122-137 | crates/extra/src/tower_compat.rs:354-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/extra/src/tower_compat.rs:122\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/tower_compat.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdf5a4bad1a83698bfa95c032bbc4dfec4fa173047395aa580341e60e50816a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/macros/src/extract.rs:312-327 | crates/oapi-macros/src/parameter/derive.rs:183-198 \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":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0131a46105b0901b8070a1ac07421a427982f08ede3a8521ee0ac5d061356a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:798-813 | crates/oapi-macros/src/schema/enum_schemas.rs:871-886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:798\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"8007545ef014161664ebf6a61fe5ace2f75341a789fffbc8bdd00ebfd3d81268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): crates/oapi-macros/src/schema/enum_schemas.rs:545-559 | crates/oapi-macros/src/schema/enum_schemas.rs:593-607 | crates/oapi-macros/src/schema/enum_schemas.rs:774-788 | crates/oapi-macros/src/schema/enum_schemas.rs:849-863 | crates/oapi-macros/src/schema/enum_schemas.rs:980-994 | crates/oapi-macros/src/schema/enum_schemas.rs:1035-1049 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9944027fb3f26a8cd8f14a3ef486e6e39ac46caab2a64ec8f08dde4eaf1dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/tus/src/handlers/delete.rs:16-30 | crates/tus/src/handlers/get.rs:18-32 | 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 35 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"61260940d623427d0fa84fd68c6726ae3cd2dbf550cb4665f846735c850b2bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/compression/src/lib.rs:416-430 | crates/serve-static/src/dir.rs:642-656 \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/compression/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18406701bb50d5c5c1e97be96cc54c09bc9ffcf31b8ce95b5fa5e116a23d827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/oapi-macros/src/component.rs:456-468 | crates/oapi-macros/src/component.rs:606-620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/component.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc1eb25aa488be69ed09f931ab1c65e27524e94867409b0e82107bc8f1cd230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:1015-1029 | crates/oapi-macros/src/schema/enum_schemas.rs:1069-1083 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:1015\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":1015}}}],"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema_type.rs:69\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:14-27 | crates/macros/src/shared.rs:18-31 | crates/oapi-macros/src/shared.rs:40-53 \u2014 before extracting anything, compare \u0060crates/craft-macros/src/utils.rs\u0060 and \u0060crates/macros/src/shared.rs\u0060 as WHOLE FILES: 89% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/craft-macros/src/utils.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"db318a6da5d19adf10fad1575e195717c6f4c7fe15d18eee250a09dd3e7785f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/tus/src/handlers/delete.rs:35-48 | crates/tus/src/handlers/get.rs:31-44 | 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 35 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tus/src/handlers/delete.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9667cebfb570191f231f36e00d0b76b0d5f1e4e48fee0025516bd2c0bd67d884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/macros/src/handler.rs:101-114 | crates/oapi-macros/src/endpoint.rs:325-338 \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 73 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/handler.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"575f4c2f0a0a448e5c35497069d6552fd4062bf48f5ea42f3e97e4df92256b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/oapi-macros/src/parameter.rs:255-267 | crates/oapi-macros/src/parameter/derive.rs:455-468 \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/parameter.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"103282aa68e4a7bc2b1c6fcf5e17b0c164a5bfad9aba652fd97c98906ac9604c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:334-347 | crates/oapi-macros/src/schema/enum_schemas.rs:412-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:334\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e6eb1674f1d3674eae63ae2d0ce58329aa3b4fe9994ff6aecf04b6b2e1957e"}},{"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:130-141 | crates/core/src/conn/stream/straight.rs:206-217 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/stream/straight.rs:83\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/extract/case.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:271-283 | crates/oapi-macros/src/response/derive.rs:318-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a840673a26dc04d037ed2e55675d495f043ade13df3f27363fa4238d8582b945"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/oapi-macros/src/schema/enum_schemas.rs:869-880 | crates/oapi-macros/src/schema/enum_schemas.rs:1055-1067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_schemas.rs:869\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_schemas.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"9814d4ad9b595ee92f64fadc868aab6741fcf3d3c61807860ce3ae6bce9eabc7"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/response.rs:259\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed783789f8967652c2343d37011e1ad6bdcb816fde018516a29e1e942f5fb6ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/oapi-macros/src/schema.rs:293-304 | crates/oapi-macros/src/schema.rs:327-338 \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":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc022c5b3a50a71a81b49f9239ba2765c54b3c33785ecd72eb905911b4200a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/oapi-macros/src/schema/struct_schemas.rs:262-273 | crates/oapi-macros/src/schema/struct_schemas.rs:479-490 \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":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a03fd1b7edbc47bf6d9e66e7124cbf3a3a31eddada2005ea5984587eef7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/core/src/routing/filters/path.rs:636-645 | crates/core/src/routing/filters/path.rs:654-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/routing/filters/path.rs:654\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/routing/filters/path.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da32d444fb032ba149bbc328305ed31cb683f97e2a4b5e382a0c526be3574e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/macros/src/shared.rs:34-54 | crates/oapi-macros/src/shared.rs:56-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 135 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/shared.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/macros/src/shared.rs:56\u0060 calls \u0060ConnCtrl\u0060 and \u0060crates/oapi-macros/src/shared.rs:77\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/shared.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39d88e3cbaafd5f18964d987e391082259daf6ba4a23ff520d9305c24c1ded0"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/operation/example.rs:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:196-206 | crates/oapi-macros/src/response.rs:362-370 \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 60 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/operation/request_body.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/operation/request_body.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b10c546b7e305007bf7c748676374c40e7dfe4c1ed6ec8061c9da293ce9ad6"}},{"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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"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":"7754aa648be34984861cc313b0aee9d9eb08513faf99ca913a096412d53a3929"}},{"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 3 separate duplicated blocks between them, totalling at least 50 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/native_tls/listener.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"076d5a2dd65fe7c79ccdad9a99bbdd5152727bcf2de841ebca8be5b40a87d300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/oapi-macros/src/response/derive.rs:413-422 | crates/oapi-macros/src/response/derive.rs:469-478 | crates/oapi-macros/src/response/derive.rs:677-684 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/response/derive.rs:413\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":413}}}],"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/catcher.rs:433\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:217-226 | crates/core/src/conn/quinn/builder.rs:241-250 \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":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a085030281b2056ba8d085a3ec8e7d1b524c87de3c56191ba3a66cae0ae3074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/core/src/conn/stream/straight.rs:117-126 | crates/core/src/conn/stream/straight.rs:195-202 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/straight.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab13014d5c5dc57ad975de298835536505c6b6eea7e96de599bb45e19dd5f8"}},{"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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"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:677-686 | 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/http/request.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"29833c5a086ae204eb5d780dc0bdc605c74b1ddc490657825d120ba39257c2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/csrf/src/aes_gcm_cipher.rs:81-91 | crates/csrf/src/ccp_cipher.rs:81-91 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/csrf/src/aes_gcm_cipher.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d6630f25567642729a854f570c3bca1b66e4859b2a8b5b42afc67a6596d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/oapi-macros/src/component.rs:232-241 | crates/oapi-macros/src/component.rs:317-325 \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 (10 lines \u00D7 2): crates/oapi-macros/src/schema/enum_variant.rs:230-239 | crates/oapi-macros/src/schema/enum_variant.rs:329-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/schema/enum_variant.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_variant.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"668a84519d127619856e053bc790d65ee9fd900286a2a9ebadbf458da7b55152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tus/src/handlers/patch.rs:35-44 | crates/tus/src/handlers/post.rs:29-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tus/src/handlers/patch.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"482caea9752bb53af26ec1699efba0636828a0dadfb06a7591c3d537e40d491c"}},{"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:172-180 | crates/core/src/conn/stream/straight.rs:248-256 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/stream/straight.rs:104\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:308-316 | crates/oapi-macros/src/response/derive.rs:408-416 | crates/oapi-macros/src/response/derive.rs:519-527 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/response/derive.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd129d2805ebca34035d05380cc984cbe31150dd6743b81d6f7c88db10acac95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/tus/src/handlers/patch.rs:33-41 | crates/tus/src/handlers/post.rs:27-35 | crates/tus/src/method_override.rs:78-86 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tus/src/handlers/patch.rs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf9d9724dd13105a6297a1c6f1db228a67e38b8bb8bfc8de143bf52ad04b97"}},{"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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/stream/handshake.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad5ad38a92c9f66accf3b889114a842b5b46446728a7e9a24a1a3fbcd78af52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/craft-macros/src/craft.rs:194-202 | crates/oapi-macros/src/endpoint.rs:43-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/craft-macros/src/craft.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/craft-macros/src/craft.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"220945d9e540bbe5663979fda22951fa6e4bd283ba9ed5d8798a6c77504fed55"}},{"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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/enum_variant.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b8b037b7dc2657a56ca9594815f899662da4a66bb8794fcc369b19d2f1260a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi-macros/src/schema/struct_schemas.rs:93-101 | crates/oapi-macros/src/schema/struct_schemas.rs:183-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/schema/struct_schemas.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3587df7a663c8b7d581348783eba87f63a2a1a7828fdeb94cd51f034b0a1ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/oapi/src/openapi.rs:894-902 | crates/oapi/src/openapi.rs:950-958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi/src/openapi.rs:894\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e45618b2ec832fae2f76bd298351667d93c38dfbdc682bb3daca355ae8e7648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rate-limiter/src/lib.rs:350-358 | crates/rate-limiter/src/lib.rs:378-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rate-limiter/src/lib.rs:350\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rate-limiter/src/lib.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a218b7b3d33c0c29e41d2652996e1e8d1100196dbe2d395bddfd8ab0a4286c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/oapi-macros/src/component.rs:436-443 | crates/oapi-macros/src/component.rs:586-593 | crates/oapi-macros/src/component.rs:622-629 \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":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3858218d193f4b54e5223f3a2cf8bd9152d4ccaa11f2ffe327beb0f2e7da0557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/oapi-macros/src/component.rs:459-465 | crates/oapi-macros/src/component.rs:611-617 | crates/oapi-macros/src/component.rs:648-655 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/component.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"224db84d45c3977d7429c87f12469cdc5a4aa67e223b79920954d10b5ea1f064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/oapi-macros/src/feature.rs:33-40 | crates/oapi-macros/src/feature.rs:56-63 | crates/oapi-macros/src/feature.rs:66-73 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/oapi-macros/src/feature.rs:53\u0060 calls \u0060lookahead1\u0060, \u0060peek\u0060 and \u0060crates/oapi-macros/src/feature.rs:31\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/feature.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f6ebda29b01ff618ad8b4b1a55700f006ac7eb788814a15666bc2f90489d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/conn/tcp.rs:198-205 | crates/core/src/conn/unix.rs:127-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/tcp.rs"},"region":{"startLine":198}}}],"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 (9 lines \u00D7 2): crates/craft-macros/src/craft.rs:196-204 | crates/craft-macros/src/craft.rs:217-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/craft-macros/src/craft.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/craft-macros/src/craft.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"451e93af300ce7ffdfd4a636e9442afe6e76802521bda27093099b0e4b28de2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/macros/src/handler.rs:143-150 | crates/oapi-macros/src/endpoint.rs:360-367 \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 73 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/handler.rs:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/oapi-macros/src/endpoint.rs:368\u0060 calls \u0060push\u0060 and \u0060crates/macros/src/handler.rs:151\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0701333061de30a3ec55bbe3e93ed97e2e9674070c50501db8ad553ea38cb600"}},{"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:908-914 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/catcher.rs:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/catcher.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daaeab5090ae49739960ffefcbe3abe312d1a1a8aadc65bf773eb045b07d2a1"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/operation/request_body.rs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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/oapi/src/naming.rs:343-349 | crates/oapi/src/naming.rs:369-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi/src/naming.rs:343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/naming.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e507417588e7eb1d37a3d43329b2cf3b44578950d0c16925e6535099afb197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/session/src/lib.rs:155-168 | crates/session/src/lib.rs:398-411 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/session/src/lib.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"00340413a007697a59c3239291ea005b616cf6f026bca74f52ddad5518380b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/tus/src/handlers/delete.rs:20-25 | crates/tus/src/handlers/get.rs:22-27 | crates/tus/src/handlers/head.rs:21-26 | crates/tus/src/handlers/post.rs:27-32 | crates/tus/src/method_override.rs:78-83 \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 35 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tus/src/handlers/delete.rs:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/delete.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28213cebb7919cc05d8ef4467041337f3ce06262e0ce8f8aeec5d29c51dbb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/oapi-macros/src/component.rs:459-464 | crates/oapi-macros/src/component.rs:611-616 | crates/oapi-macros/src/component.rs:648-653 | crates/oapi-macros/src/component.rs:659-664 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/component.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi-macros/src/component.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21eef58d6fb6436b4e4db4539d3ec53352c0330fae737fdc4a2d949f4128f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/compression/src/lib.rs:586-589 | crates/compression/src/lib.rs:597-602 | crates/compression/src/lib.rs:611-616 | crates/compression/src/lib.rs:624-629 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/compression/src/lib.rs:586\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"59618bc8a0177e0de2392016275bd662d7989fbc16f486ada805292675347670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/macros/src/handler.rs:175-180 | crates/macros/src/handler.rs:194-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/handler.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7629a941091c92557518521f87c17682a1701e44c254f1eb6c14d1347f39319c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/oapi/src/naming.rs:229-235 | crates/oapi/src/naming.rs:319-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi/src/naming.rs:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/oapi/src/naming.rs:325\u0060 calls \u0060is_empty\u0060, \u0060push\u0060 and \u0060crates/oapi/src/naming.rs:236\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/naming.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9519e3f10c1a7cbfb88e2ec45f561baaddeb09c45b5c6e96b70221229dc11334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cache/src/lib.rs:828-833 | crates/compression/src/lib.rs:668-673 \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/cache/src/lib.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2d5737f4312a3da50f7e1ce7f4fe2cdd7cbc1c0e9b8ff75de2754953a5a916"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/http/body/req.rs:208\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:147-151 | crates/oapi/src/openapi/security.rs:637-641 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi/src/openapi/path.rs:147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi/path.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc82fb1eae85c298f4d70dc009779237a6c4a739ef66532a512176965e1aabc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/oapi/src/rapidoc.rs:117-122 | crates/oapi/src/redoc.rs:132-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi/src/rapidoc.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/rapidoc.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4149ab3d284cfff6433c4817fa681d0ef17edeef3d59d1b7c5a80057a75769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tus/src/handlers/patch.rs:184-188 | crates/tus/src/handlers/post.rs:147-151 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"649b492aea2e8c726f1f9aa66ad9e722e9988b952bf4351ba93de8cd1a758df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tus/src/stores/disk.rs:623-627 | crates/tus/src/stores/disk.rs:629-633 \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":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c726be3384fb7a6c2d6364a81e4283c2b073aa5b5cb2da13723e1092be1c81"}},{"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 (14 lines \u00D7 2): crates/core/src/fs/named_file.rs:1109-1122 | crates/core/src/writing/seek.rs:232-245 \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 3 separate duplicated blocks between them, totalling at least 64 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":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c27ddf7da949fc99ea1641434f430fc030ed7a22551c2f0b05082d0de86f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/fs/named_file.rs:1125-1138 | crates/core/src/writing/seek.rs:248-261 \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 3 separate duplicated blocks between them, totalling at least 64 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":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e688a2e0e34c8e3e62ac8a1c1aa81370ae8d503a6be571d81cb9f0d9057e2e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/http/form.rs:267-272 | crates/core/src/http/request.rs:1003-1008 \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/form.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01c48e630f22e5440c4660352ec38c2e01bce873f843a8de3744121977a65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/serde/flat_value.rs:126-132 | 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":126}}}],"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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/cors/src/allow_credentials.rs:56\u0060 calls \u0060pub\u0060, \u0060is_true\u0060 and \u0060crates/cors/src/allow_private_network.rs:55\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/cors/src/expose_headers.rs:76\u0060 calls \u0060pub\u0060, \u0060is_wildcard\u0060, \u0060Exact\u0060 and \u0060crates/cors/src/max_age.rs:60\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"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 (6 lines \u00D7 2): crates/oapi/src/openapi/path.rs:59-64 | 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":59}}}],"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 (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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cors/src/allow_headers.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:523-539 | crates/oapi-macros/src/response.rs:621-637 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/operation/encoding.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/proto.rs:170\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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 3 separate duplicated blocks between them, totalling at least 50 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"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 (8 lines \u00D7 2): crates/tus/src/handlers/post.rs:232-241 | crates/tus/src/handlers/post.rs:254-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tus/src/handlers/post.rs:232\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e965709ce422c0c9440edda49ac274bbb925f14f8d7fc0097d0c4befe7a7ab77"}},{"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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/oapi-macros/src/operation/encoding.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/conn/proto.rs:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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:120-126 | crates/oapi-macros/src/endpoint.rs:340-346 \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 73 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/handler.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3201245f394f9b9b9ce367905fd72d56bb2f8d82c404aa4bf3c9bbac7829b3"}},{"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:74-79 \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:180-187 | crates/core/src/routing/filters/others.rs:252-259 \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":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a35f1775df57d566cab8bd2756f0ab8ea9b4a160242f47b995af2f9d82740e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/macros/src/handler.rs:168-172 | crates/macros/src/handler.rs:187-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/macros/src/handler.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/macros/src/handler.rs"},"region":{"startLine":168}}}],"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.11, 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: EncodeStream (LCOM4 7): EncodeStream\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/compression/src/stream.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f27216690fe1a76e56d4100f0be0f7e3ec25fa427fe242caeec14383b12349"}},{"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: 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":16}}}],"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":518}}}],"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":"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"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/serve-static/src/dir.rs: crates/serve-static/src/dir.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in StaticDir::handle at line 526. 2 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \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":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f790a78567cc29d868cc49216f45c58cd3c9c5e6f1907552fea0ad13233fce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/fs/named_file.rs: crates/core/src/fs/named_file.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in NamedFile::send_with_method at line 817. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \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":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3e47310671a06bbc7d5cf9ac8c051203d003748523da5f52d331855098f637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/compression/src/lib.rs: crates/compression/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Compression::handle at line 504. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/compression/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/compression/src/lib.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"26371b5e4081912f0bfd4afe4119a38996d51eb80345980101dc38169c12bc07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tus/src/handlers/post.rs: crates/tus/src/handlers/post.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in salvo_tus::handlers::post::create at line 22. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/tus/src/handlers/post.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/tus/src/handlers/post.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d83dfb412ca69e7190d836aa33f6e2124c27ba132a30630c03de1ced2d86d21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/serve-static/src/embed.rs: crates/serve-static/src/embed.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in salvo_serve_static::embed::render_embedded_data at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/serve-static/src/embed.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/embed.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c76bd1e766040b0cbeaf09e1e34c9d7e347645b866e221a88cf26d7a8669b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/service.rs: crates/core/src/service.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in HyperHandler::handle at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \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":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00f05daa90203d111e91641c3603b541206b1f09344be5f36227ac06cf8735"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tus/src/handlers/patch.rs: crates/tus/src/handlers/patch.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in salvo_tus::handlers::patch::patch at line 18. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/tus/src/handlers/patch.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/tus/src/handlers/patch.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7718720b8079bb99e9724f1fdf7319d505b5eb95839fad8f30b1f339cf467d93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi-macros/src/schema/struct_schemas.rs: crates/oapi-macros/src/schema/struct_schemas.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in NamedStructSchema::try_to_tokens at line 179. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/oapi-macros/src/schema/struct_schemas.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/schema/struct_schemas.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a99916117bcb8ce6db2af5fadbf43f85d2729384fb82fd486a6c5690c870eb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi/src/openapi.rs: crates/oapi/src/openapi.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in OpenApi::merge_norm_node at line 628. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/oapi/src/openapi.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/src/openapi.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"61deb7dca29ecb37ae67749ab2fc3057e2bf85afca31cb7d8dc3df3986d0af28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi-macros/src/parameter/derive.rs: crates/oapi-macros/src/parameter/derive.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ToParameters::try_to_tokens at line 67. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"86158e1b035bd24ed861dead7689ad74fd8bb20563476b6e8a8ec6c083f90363"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/conn/quinn/builder.rs: crates/core/src/conn/quinn/builder.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Builder::serve_connection at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/core/src/conn/quinn/builder.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/conn/quinn/builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"facc2b17634109f2c69ee9351a0585582e2bbcb5a392d903cdbb708d4124d86b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/writing/seek.rs: crates/core/src/writing/seek.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ReadSeeker::send_inner at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/core/src/writing/seek.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/writing/seek.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"302bbd8bca23000f94a9bec6f0f8adef024bf8f836c2cf8a936a113d3d18840c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/macros/src/extract.rs: crates/macros/src/extract.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in salvo_macros::extract::generate at line 274. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/macros/src/extract.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/macros/src/extract.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"22788d14abe1785de2e7350309ba13e90c5807df2d79e7fbccfb9d563a45df92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/craft-macros/src/craft.rs: crates/craft-macros/src/craft.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in salvo_craft_macros::craft::rewrite_method at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/craft-macros/src/craft.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/craft-macros/src/craft.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"956cad568326665a874f32621b2e65925d0bae984918d7f4a84abbf10ec01cc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi-macros/src/operation.rs: crates/oapi-macros/src/operation.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Operation::modifiers at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/oapi-macros/src/operation.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/operation.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bcdc7a7dcdcc67c24cc8b7584514e2188b631b29ed337edf8ae8d694f532a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/jwt-auth/src/oidc/cache.rs: crates/jwt-auth/src/oidc/cache.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CachePolicy::parse_bytes at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/jwt-auth/src/oidc/cache.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/jwt-auth/src/oidc/cache.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1c0a5565070c6895ffcfef3e63d0846bda0df7221279398fb2958ab29acebd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/oapi/src/routing.rs: crates/oapi/src/routing.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NormNode::with_method at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/oapi/src/routing.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/src/routing.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff10b5264315bd85ade22b9241e8c8a8b9659f94d9fbc7251f40339f425a4d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/server.rs: crates/core/src/server.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Server::try_serve at line 366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/core/src/server.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/server.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5591cf3b09052470010de959a97907e83f1b3d8e0b4f9cbf4e9dd6284ab425"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/otel/src/tracing.rs: crates/otel/src/tracing.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Tracing::handle at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/otel/src/tracing.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/otel/src/tracing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5085f32f0599a3df3ba05b1a5967b339feb0216f5dc0b0f0dcc4af1a6d8ea6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/serde-util/src/lib.rs: crates/serde-util/src/lib.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SerdeValue::parse at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 04:10:41 \u002B08:00\u0027 --until=\u00272026-11-15 04:10:41 \u002B08:00\u0027 --full-history --no-merges -- crates/serde-util/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serde-util/src/lib.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd898424cd65ea66194aae452ab4ed55eddb2c91c065b67a5fbe192758b3ac"}},{"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":"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: 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":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7d03b498141fcc942c8c9d93c8251d8371404f00057d688beae098ef8915a9"}},{"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":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c04f9b86b234a5081aef33a723f658d39b159b6ecd9bb2857fbd8c96636cef"}},{"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":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"3466e41700481fd4d89052bef2747d6961cee5f1e7642f4c56001888faca2270"}},{"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 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":539}}}],"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":962}}}],"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":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36fcdade19f8b6bcaf4979fd871fbc95d9b647611e4c6dfab42a6829ee1b2f7"}},{"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":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 23 project(s) overshoot their size bounds, lowering Project Cohesion to 9.1/10. The most over is \u0060crates/core\u0060 (30750 LoC, 173 module-visible types across 18 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"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"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 245 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 245 of the 280 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/cors/src/inner.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/inner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e28b71b255e30dea95f63eb957cf4ce1dcc6c81eb7395fe877189c3213c4f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: listener.rs \u2194 listener.rs: \u0060crates/core/src/conn/native_tls/listener.rs\u0060 and \u0060crates/core/src/conn/openssl/listener.rs\u0060 change together 91% of the time (31 of the 34 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 31 shared commits counted here, the most recent 3 are \u006043e9abed\u0060 Reload TLS configs in background (#1404); \u006004d61078\u0060 Remove AsyncRead and AsyncWrite constraint from Acceptor (#1181); \u0060bdf8bd3f\u0060 Allow TLS without HTTP2 and fallback to HTTP 1.1  (#858) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e2469cf425022f41ff21f197c3b4b206bf015b81d0f361771a376670655df2"}},{"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 hub: listener.rs \u2192 listener.rs, config.rs, listener.rs, listener.rs: \u0060crates/core/src/conn/rustls/listener.rs\u0060 changes together with 4 other 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 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/rustls/listener.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d40ad17356a261013b8fa435617434ccfb32f57b0aa1e72be832be491f1e53"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: listener.rs \u2194 config.rs: \u0060crates/core/src/conn/native_tls/listener.rs\u0060 and \u0060crates/core/src/conn/openssl/config.rs\u0060 change together 64% of the time (7 of the 11 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 \u0060bdf8bd3f\u0060 Allow TLS without HTTP2 and fallback to HTTP 1.1  (#858); \u00607ae657ba\u0060 feat!: Acme and Http3 work together! (#384); \u0060617954f1\u0060 feat!: Make tls more generic (#380) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/native_tls/listener.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655766b087edff3c6e046f3984bf3d7ff2cf3e54375c9a03393cceab7cbf5984"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: config.rs \u2194 listener.rs: \u0060crates/core/src/conn/openssl/config.rs\u0060 and \u0060crates/core/src/conn/openssl/listener.rs\u0060 change together 64% of the time (7 of the 11 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 7 shared commits counted here, the most recent 3 are \u0060bdf8bd3f\u0060 Allow TLS without HTTP2 and fallback to HTTP 1.1  (#858); \u00607ae657ba\u0060 feat!: Acme and Http3 work together! (#384); \u0060617954f1\u0060 feat!: Make tls more generic (#380) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/openssl/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ee6f9ed65f36f3b60e7e792db229ca2f379236ef1e3b2ab6c11f64b6b756f1"}},{"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 60% of the time (9 of the 15 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 9 shared commits counted here, the most recent 3 are \u00609d9b1c34\u0060 Respect HTTP range unit semantics in static responses (#1801); \u0060c24faa81\u0060 Ignore Range when serving HEAD representations (#1745); \u006050a835bf\u0060 fix(core): correct conditional-request ordering, multi-range and IPv6\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: metrics.rs \u2194 tracing.rs: \u0060crates/otel/src/metrics.rs\u0060 and \u0060crates/otel/src/tracing.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e8da0e24\u0060 Record OpenTelemetry metrics and spans after response finalization (#\u2026; \u0060ca0748ab\u0060 feat(otel)!: follow the OpenTelemetry HTTP semantic conventions (#1700); \u0060ec25bc28\u0060 chore(otel): Treat status_code=none as 200(OK) (#927) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/otel/src/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17db777bb4b44a840e669c70d7bb7b74178142b2100c79ae4a14de9524c75f7e"}},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"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":124}}}],"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 17/18 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"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":"S1","level":"note","message":{"text":"Security headers incomplete: Set: X-Content-Type-Options. Missing: Content-Security-Policy, Strict-Transport-Security, X-Frame-Options \u2014 the four headers that carry the points of this card\u0027s security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(\u22121.5 on this card.) The server: \u0060.serve_connection(\u0060 (crates/core/src/conn/proto.rs:161)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e9931804dbad8b1657857c9b88c05b8faeff182b6e2bb88641bd59bac687876e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/jwt-clerk/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) 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":[{"physicalLocation":{"artifactLocation":{"uri":"examples/jwt-clerk/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131431bb22b68cdb6e36c8dbf9a21fb44e9729eb189898143c08933c8d5d497"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/jwt-oidc-clerk/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) 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":[{"physicalLocation":{"artifactLocation":{"uri":"examples/jwt-oidc-clerk/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d4a59b8c7caf3691345e26c811fb2daae45e660f403ed5cec314ffd96f8168"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/proxy-react-app/react-app/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) 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":[{"physicalLocation":{"artifactLocation":{"uri":"examples/proxy-react-app/react-app/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"35832a005e10216810ca41dfef0969c67e4e882d362151c2dae497c0b1caf3df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!input.is_empty() \u0026\u0026 !input.peek(syn::Token![,])\u0060 appears character-identically in 3 files \u2014 crates/craft-macros/src/utils.rs, crates/macros/src/shared.rs, crates/oapi-macros/src/shared.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/craft-macros/src/utils.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0b142929e29c0b8564c5daa17168bcff244b7786d6af209de81c4f32f860d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!status_code.is_client_error() \u0026\u0026 !status_code.is_server_error()\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":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec02b3e4462d9e45198eef1d7729c38f452aae299c9c293f5c6a7458e949c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method == Method::GET || method == Method::HEAD\u0060 appears character-identically in 2 files \u2014 crates/core/src/fs/named_file.rs, crates/core/src/writing/seek.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/core/src/fs/named_file.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab4c2b090ec7e50c4995c555b6fd32cf30e59ae8d18e791a6b5a9c40b8a3ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req_headers.contains_key(IF_NONE_MATCH) || !retrieval\u0060 appears character-identically in 2 files \u2014 crates/core/src/fs/named_file.rs, crates/core/src/writing/seek.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/core/src/fs/named_file.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9a49663fe236f38b8d186fb847c3617c9f0294a0accffa601fa333c0ba3379"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 266 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cc3f004fa8207da62c0ae2f492ea89ffc19a17ad208c541926c98b61afac2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 307 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f4d8d38aa648d43f9f8c1e60649b1a25e8c368e821d982ff939c18337df1d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 442 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c519c5d83540697a8ebbbe5794b04a5be8fa8e4a8ad64df6312f71295314c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 477 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3291fc3ce6c8c082b1926f3cdbfa8480c173c877648a823bbd6e8f4e9af89a93"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 493 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f287fc98e5a5ebf81788d64bc56754910d776670244a8435d1bf39eb7ba474f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 504 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/stores/disk.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e689cc4b51658e2950fa661f150b74f37259b05e0bb0a2c7067e17e60365550a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/patch.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72aa99098baad667a86d677beeba21ebe86517847e93e0658baf6b8db08caac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 266 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tus/src/handlers/post.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca13f1c39e9342faee34717a9805e7029cca09aff4a806393389d3577370b40"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 171 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/serve-static/src/embed.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"695a8ff406ec70be2cf7d4e4da33c53608b5b9d627a580381f69a0981e544644"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 379 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/naming.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"384d7deca2c94bdb8196c12a2332ba42012fe7cbc4f937368fbdb94327f1750c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 733 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/oapi/src/openapi.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8719a1904e45687f2d1f0c0622eb1a47e7c9517cd14510c26349c7ef88eeb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 330 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/jwt-auth/src/oidc.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c403a6daa9a7bc1129f3010803d56a6b38402609da15e3e47fa9dce66a76638b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 420 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/jwt-auth/src/oidc/cache.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b023cffcdb1efabc651edcf46ebc7f2c2ffcfcd4c5b616556bf3919c579901e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/concurrency_limiter.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"598b2960579bcde84148c7e875709e625d8bca4f8c596cae960b2df543f54dd8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 308 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/sse.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29e0401e51c7cf7572c76525d6cae39ecdf1e59e7dc28bc23971007a25f53c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 553 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/extra/src/websocket.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f09aa05a254d75ce83e3c6910a2506e51226ff1fa39e9579311d2d3409dbbb6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 608 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cors/src/lib.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"65086a1e69e80d3ffdd8d10a5e0f0addb902e4823e49cf45310206b1bd56dd18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 149 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/catcher.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dad04d3864b79f107966eb336dba18ca104e1f27e906b1832ff0d977f8e344b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 391 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04a1cbe08c4c192309dea2ce417918e2020a6057749363edec33122a1e45f25"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 516 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"64df9c4ff0b34fb28ed337facb4476a672cce5fb79ec037dac478698a96581f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 568 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/server.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6e2aba52028a78f63c23b707d2130d1e4fafd23c0733d9ecbffba524a23362"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/serde/request.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb24d32ed259f32813781db5f5f059ecfdae5fe255f5321bfd38f9420edadcc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 278 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/proto.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c5432e4e1b8c559f06d912a64f54fc5334309add04fd9d5c165da9637ee423"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 188 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da8d6ed17938fdbb7e15bd1d3d198fe11d23e31b9ffb380ae18be5d2fab246"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 260 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58c36bd7b38df0e0d772ebf12056a8fd3fc55f77fc8cb9e7a0e6bc3c5a2c8ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 305 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/builder.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a07dda4177d4ffbfd9d34c8a15652abe300ad103ac2cc07d9190fa3058e163"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 393 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/conn/quinn/client.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587e07e100ca122dcd2f0142369dadc1e55c4a52cc8c861773e3091636aaebc"}},{"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.34.0/swagger-ui-bundle.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd7493d01fa2c9524019b471b7bbb4d57e9abccbea3dc3f2d934d60b58931da"}},{"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.34.0/swagger-ui-es-bundle.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"39445ee065f5f2d3b9c626c2d584652595eaf5014cc5ff3b6bf6e42c20248327"}}],"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":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-321","guid":"0ce564a5-a44c-3358-b3db-317712e6e019","name":"Use of Hard-coded Cryptographic Key","shortDescription":{"text":"Use of Hard-coded Cryptographic Key"},"helpUri":"https://cwe.mitre.org/data/definitions/321.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":21,"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."]}]}