{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"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":"fselect::function::evaluate (cyclomatic 211): fselect::function::evaluate has cyclomatic complexity 211 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fadf5b986e6c2ea15febce4b25417c4f6d19bffde01be6ccceb0f3d70f1f9c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_lexeme (cyclomatic 88): Lexer::next_lexeme has cyclomatic complexity 88 (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":"src/lexer.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdc8cdb529ecf6fe9ae96f5f0085a833f621b1853fa39d15cf902e1f053e82a"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::util::parse_filesize (cyclomatic 58): fselect::util::parse_filesize has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f3317c9677f2eb602069acf78932a136bef78b0f9a794e46f55607a81e7086"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::visit_dir (cyclomatic 56): Searcher::visit_dir has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f9ff161513e1061b2daf8f6a5f7afe9f8bf0bc3424b17b8c5f540e24f49269"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::compare_variants (cyclomatic 53): Searcher::compare_variants has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"671d5d96a32709737f431fc6151d15918218e738268e0ec074a46d775c8bc058"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::search_and_print (cyclomatic 51): Searcher::search_and_print has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99386c59e7cf047d6374cabf9f26da9d04f47957a553f15d458af0bbec8dc93"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::main (cyclomatic 51): fselect::main has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f137d064d9cf7d17b7765b8efd0538e1408fcb0a9f3a94465d143eddb0b28fba"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::check_file_inner (cyclomatic 43): Searcher::check_file_inner has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c9c98487627d5a5b7e9e9301abd256bbc41f24396c6e14944120c8f81167fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_comparison (cyclomatic 36): Parser::parse_comparison has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f5fac53c24d859f40a938e61ce863b878fb5138a45bdbaff28c5ce56564e36"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_func_scalar (cyclomatic 36): Parser::parse_func_scalar has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b359d67da32b09dbfe290f451e8133a308c60c5a8004ef5730f0bf3209c92900"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::render (cyclomatic 33): Expr::render 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":"src/expr.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"95146a08ec01c22bec24e8de92bb06bae95fc49c0a5a300dd7e945125e9d9a0c"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::get_column_expr_value (cyclomatic 33): Searcher::get_column_expr_value 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":"src/searcher.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"941a16138b9f9a2b967199ddc713706bc4a5b2d05475d0a74fcb7df18bedb0d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_root_options (cyclomatic 30): Parser::parse_root_options 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":"src/parser.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b3a25c6b9a9299ff3fa5908b6f6c20f5b4ee0b184461bf456e26d644f8aad9"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::util::format_filesize (cyclomatic 27): fselect::util::format_filesize 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":"src/util/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08b84fec5265948da3749e25ef7b214f89b65c8d803d3af5c2609158be917e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_roots (cyclomatic 26): Parser::parse_roots 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":"src/parser.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4b48627031f67145e2709f5c67219f0900f1843030a7bf40795911f1553007"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse (cyclomatic 25): Parser::parse has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67cf7e2fee64513b15c8b445a3eef0ce459231341c1f770fa0c2e0c62036142"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_order_by_clause (cyclomatic 25): Parser::parse_order_by_clause has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b26fde8020008082bcec8cedfe200dd2376c376d7cd53582c73f2ac1feb036c"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::expand_roots (cyclomatic 25): Searcher::expand_roots 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":"src/searcher.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"029c8cd6d629c224150da204f86a0178c4005fb26ac122a42ab566bdd3fdd70e"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::bind_aggregate_aliases (cyclomatic 25): Searcher::bind_aggregate_aliases 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":"src/searcher.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0149fa7cf32af3fbc29375b9bd21b787d13b3384a0816dd109e1969259599b"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::bind_row_aliases_inner (cyclomatic 25): Searcher::bind_row_aliases_inner has cyclomatic complexity 25 (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":"src/searcher.rs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c435c78c85e88392e7a034f98a1f56ca0eed686737fbd79501c8d9172482294"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_group_by_clause (cyclomatic 23): Parser::parse_group_by_clause has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a326380f42c616188638498f0414078a15cd77f360b5d2fbbbc70bed31ce0c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::visit_subquery_paths (cyclomatic 23): Searcher::visit_subquery_paths has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c450f7ba3d0c7a966914a2cdd6604de932836a6209459666e810f25d54d66b9"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::ignore::hg::hg_glob_to_regex (cyclomatic 23): fselect::ignore::hg::hg_glob_to_regex has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ignore/hg.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c1ab32fb8d0cf6d4a61591fbce43b2132d7cb52753627d44f765a4efc6e30f"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::function::contains_utf8_or_latin1 (cyclomatic 22): fselect::function::contains_utf8_or_latin1 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":"src/function.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"533885e54c6329f1b04a2d27c520038f71f153d2dcb8eb051ce32c6036d7ca3c"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::mode::format_unix_mode (cyclomatic 22): fselect::mode::format_unix_mode has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (fselect::mode::get_mode_unix) 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":"src/mode.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6928dfb21ed5b577d503a84ffa04e61bf3fba722def352e3ae0cba044e1356e"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::mode::get_mode_unix (cyclomatic 22): fselect::mode::get_mode_unix has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (fselect::mode::format_unix_mode) 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":"src/mode.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a057900f5d5c4c4d1b6b62f08d7eafdf9ac0fd16a738161495a6bff642292e"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::mode::get_mode_windows (cyclomatic 20): fselect::mode::get_mode_windows has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mode.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe827c37e3bd8d28f4ecc3217d17cd99a59d79c1738065be7fe0f4b69c5071f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_fields (cyclomatic 19): Parser::parse_fields 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":"src/parser.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee84e2f914fb1a433ba181c64445e8be72d58b6fc9853398fee6c5c9c36a03"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::check_in_list (cyclomatic 19): Searcher::check_in_list 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":"src/searcher.rs"},"region":{"startLine":3014}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d753ffe00a04459c128d818137886b66621f1d9fcaa8acf4d54ab4de42db7"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::conforms (cyclomatic 19): Searcher::conforms 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":"src/searcher.rs"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70f6138913fcff2f31053423f98f8005bc4fc355ff060adb7e108469d0ba518"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::function::get_aggregate_value (cyclomatic 19): fselect::function::get_aggregate_value 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":"src/function.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bb81fe5e533469770c4363aa577905e5175b58d98aac69ed24a380a9cc57a9"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::util::get_exif_metadata (cyclomatic 19): fselect::util::get_exif_metadata 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":"src/util/mod.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f54d0484e1498a95844cf2c7174d5a6248a6c50ebf10735566f51b20ff2ca10"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::group_conforms (cyclomatic 18): Searcher::group_conforms has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd78be3811fc71ba358eac825b5018db8410cdc5c6050ac217fdb27584278d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_function_inner (cyclomatic 16): Parser::parse_function_inner 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":"src/parser.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"493ef44aca0102dfbc05d0ce13bc3bbc32e3b85d2fe1ee5a88c48ab3767690b1"}},{"ruleId":"D1","level":"warning","message":{"text":"fselect::util::datetime::parse_datetime (cyclomatic 16): fselect::util::datetime::parse_datetime has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/datetime.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f0feaf327801753f858c76f34e8a06bce150a5156d0881c437da1a15d1df23"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::function::evaluate (cognitive 301): fselect::function::evaluate has cognitive complexity 301 (threshold 15). Drivers by points: if/else 72 (193 pts), match/switch 42 (87 pts), boolean chains 19, loops 1 (2 pts) (nesting depth added 167). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea899330a562673671a059b5e44ea69ad078ca1dddbd3dd8f228567427c78cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::visit_dir (cognitive 195): Searcher::visit_dir has cognitive complexity 195 (threshold 15). Drivers by points: if/else 31 (135 pts), match/switch 8 (33 pts), boolean chains 17, loops 3 (10 pts) (nesting depth added 136). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4eaf3f4ebfbaea9bc4c603325d52a661ba5b1441783b03979b9279b4a8363e"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::search_and_print (cognitive 137): Searcher::search_and_print has cognitive complexity 137 (threshold 15). Drivers by points: if/else 29 (79 pts), loops 13 (39 pts), match/switch 4 (11 pts), boolean chains 8 (nesting depth added 83). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc91d1e1fc69cf4f7faf7607246920c9157b1e7bc36bd4b5a971fed2a89dd87"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::expand_roots (cognitive 114): Searcher::expand_roots has cognitive complexity 114 (threshold 15). Drivers by points: if/else 18 (76 pts), match/switch 3 (20 pts), loops 4 (16 pts), boolean chains 2 (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"85296a3cd379f548db3749f66f5eabc337b293543b8eee40dd197445bfe40ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::main (cognitive 105): fselect::main has cognitive complexity 105 (threshold 15). Drivers by points: if/else 39 (69 pts), match/switch 5 (25 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1485c5f2492bfdda27b3ec01439dec5d709fdb9fde6437d90175fe0ac1aff013"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_lexeme (cognitive 80): Lexer::next_lexeme has cognitive complexity 80 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 25, match/switch 6 (14 pts), loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lexer.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9833c40c883961adacb93db59025d7842e73c62a3f17fb9ee6f5f7901a35e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_roots (cognitive 77): Parser::parse_roots has cognitive complexity 77 (threshold 15). Drivers by points: if/else 15 (48 pts), match/switch 6 (25 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ac056540f44cbd97639ddba7136fc626f2122f88412aeb7834bf7f9f51dab0"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::check_file_inner (cognitive 76): Searcher::check_file_inner has cognitive complexity 76 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 8 (18 pts), boolean chains 9, match/switch 4 (8 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7db3a002528b04dc82b5c9c1d1b9b23e5af76cb011639591422202bb64e803"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_func_scalar (cognitive 63): Parser::parse_func_scalar has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 5 (13 pts), boolean chains 10 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47d600b8403496e3ff604b6fcf00e239a1863abe176b620660c3629298ba27c"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::parse_filesize (cognitive 61): fselect::util::parse_filesize has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 19 (23 pts), boolean chains 19, if/else 19 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1f0f87bf3d172fbda7ebcd0fbacc7ed1674ad72eb3883ba1ac3aff12d5cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::get_column_expr_value (cognitive 58): Searcher::get_column_expr_value has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (37 pts), match/switch 7 (17 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"883c6b746f9c24ac614cd9a6b60dfdd6fe7c1adbdb569e20635b757c889a1577"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::render (cognitive 57): Expr::render has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (44 pts), loops 2 (6 pts), boolean chains 5, match/switch 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"654936f2d256c308707f030136469e9d0a08e531c6239524e2f68e9bafacb326"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::bind_row_aliases_inner (cognitive 50): Searcher::bind_row_aliases_inner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 9 (19 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a89e2631e836e6b57578a7711459a8e775fc822d83a32932407126791b3f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_group_by_clause (cognitive 49): Parser::parse_group_by_clause has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 8 (30 pts), if/else 8 (15 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 31). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11ea068dad9bca034ce4704ae6ae932790e4d78488f41c68cd24226df2e96c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_order_by_clause (cognitive 49): Parser::parse_order_by_clause has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 8 (25 pts), if/else 9 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21f45fa0121ed21e69e897ca9b43e1f1af2a3fdd3d1d4c4ce9dec123b697a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_root_options (cognitive 47): Parser::parse_root_options has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 6 (16 pts), boolean chains 4, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f769b81189ae193594a8b3319463251643521fae65fc64953398af243b3137c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_comparison (cognitive 46): Parser::parse_comparison has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 11, match/switch 7 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0027dc4878e9017796fbe4fb58a2bd360832a09769bb9be77f64c81d23ff34b"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::bind_aggregate_aliases (cognitive 44): Searcher::bind_aggregate_aliases has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 6 (10 pts), match/switch 2 (5 pts), boolean chains 2 (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":"src/searcher.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0dd16cbad563e37df566cfcb34e070e4f0c0264d2e2209fc4ae2336284ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::ignore::hg::parse_hgignore_lines (cognitive 43): fselect::ignore::hg::parse_hgignore_lines has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 6 (26 pts), if/else 6 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ignore/hg.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67604dcce241f5dea50e6fb9ff202e179d01cdbe44a5eb8ec774322e44f9408"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::visit_subquery_paths (cognitive 42): Searcher::visit_subquery_paths has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98ffd65e9e22ef61cd66730b11c3aa80f197ac626fa4378b48a5673139d2cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::ignore::hg::hg_glob_to_regex (cognitive 41): fselect::ignore::hg::hg_glob_to_regex has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (8 pts), match/switch 2 (7 pts), boolean chains 5 (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":"src/ignore/hg.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06af1445c4bc4eb4be819afd59fd5871c6e7800efd692e2a314c849338dffa5"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::mode::format_unix_mode (cognitive 37): fselect::mode::format_unix_mode has cognitive complexity 37 (threshold 15). Drivers by points: if/else 34 (37 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (fselect::mode::get_mode_unix) 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":"src/mode.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9287f25a19a63c748eb48b4679a4f72a8785839e160c44c792059f9febeb8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::mode::get_mode_unix (cognitive 37): fselect::mode::get_mode_unix has cognitive complexity 37 (threshold 15). Drivers by points: if/else 34 (37 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (fselect::mode::format_unix_mode) 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":"src/mode.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"df91f81decda63898413932d3e6ae739b333f2d7aaf75a4a722140313f6218c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse (cognitive 34): Parser::parse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (25 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8858c4fedf7bd56fd2dce5f658e7bbb8b0239e1298e6f7028a3285cb829286f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::get_function_value (cognitive 32): Searcher::get_function_value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (5 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa236be92a7e23fb6cdd3ab1bfeca96c8fd278f8a0d74304e5ebed204853970"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::conforms (cognitive 32): Searcher::conforms has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 7 (15 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9981c0980c47ef819a345bbb23106d134337829ca049f8a73bb86a4d26104d"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::compare_variants (cognitive 32): Searcher::compare_variants has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 8 (14 pts), boolean chains 3 (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":"src/searcher.rs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"30800d54bbea5a58b29425cf20ebdc5933a93ad5d8843a9764b2c7d1914aa6ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::group_conforms (cognitive 32): Searcher::group_conforms has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 4 (9 pts), boolean chains 4 (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":"src/searcher.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4678db7f82147a431971448ae27ae37b433de5d949157d4ed429feedf09c170a"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::get_exif_metadata (cognitive 32): fselect::util::get_exif_metadata has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, match/switch 1 (3 pts), 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":"src/util/mod.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b821baf57c8a63f505e4c79194ae3e46ca4acf5699273fa55061d97cadea4a"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::datetime::parse_datetime (cognitive 30): fselect::util::datetime::parse_datetime has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 8 (13 pts), boolean chains 3 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/datetime.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d458210992f1d3071039c6999bfc94ab9320705d73434cb0fc24d0b042f3add9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_fields (cognitive 29): Parser::parse_fields has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (7 pts), boolean chains 4, 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":"src/parser.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5df3ccec3f807bd5978248a978b2544f07857675de8686bdbafbf340d190f05"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr (cognitive 28): Parser::parse_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"816cf2f53f8297716ed71fa7e392e59471669b2655bd6ba3dafb0390cbb97bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::function::contains_utf8_or_latin1 (cognitive 28): fselect::function::contains_utf8_or_latin1 has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, match/switch 2 (5 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":"src/function.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53c33a18b881ff405260557016c665067dd81a7198f3959613b2af42946957b"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::check_in_list (cognitive 25): Searcher::check_in_list has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":3014}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f62ce0e65c70ed66b35430ee42023482c677ab0149b5275f20df5e0adcf9f75"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::validate_functions (cognitive 24): Expr::validate_functions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (2 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":"src/expr.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb9591429a43fc870c587246a7a80c47d869d6877b893a2b75c2c9122c2935"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_limit (cognitive 24): Parser::parse_limit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (8 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbbd71b020b9a672b69afd559c96878370cc1c98d24454a763eec3c636233d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::visit_external_index_entries (cognitive 23): Searcher::visit_external_index_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 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":"src/searcher.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9da0bcf57164b60873c1e2c04cdef8f9bbd529163a44b1e46f2327e6e01d01"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::exec_search (cognitive 22): fselect::exec_search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (3 pts), boolean chains 2 (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":"src/main.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d550ee3108e25c5a96008665ee1e646ab17188d9034a9ee9bf7cfdff83b7ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::ignore::docker::parse_dockerignore (cognitive 21): fselect::ignore::docker::parse_dockerignore has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ignore/docker.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41e223032aa01e15a777ed3d7a2845dbe8ab4d370b622b4dc4c1c7d1b6000aa"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::function::file_contains (cognitive 20): fselect::function::file_contains has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce6da3ddb84d4e6c79cd7fd1c0b51e95314a94ac3101c29935fd989b4cc9ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::format_filesize (cognitive 20): fselect::util::format_filesize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8382c6f606d4855ab3fd4250f13a4e3b1bef2b9a48039bcf0737069e019640d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_function_inner (cognitive 19): Parser::parse_function_inner has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 4 (6 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb48d2f705d5afbfa4e68bb19b1730e5dbe539f01255dda0889de5d4e390ac9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::bind_group_context (cognitive 19): Searcher::bind_group_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"283ad29d93566104c06ebdbcf99ca858918e012c3ef3aa601fa562e5c8574498"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::mode::get_mode_windows (cognitive 19): fselect::mode::get_mode_windows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mode.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f80acdbc4eb5c53c7b6cf3231577d563566b4ba612896740a5f36f603229041"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::condition_state (cognitive 18): Searcher::condition_state has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 3 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"6999bf467921471da85084ae2e148fefda34002602451d62e1d964e6cd1608ca"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::function::get_aggregate_value (cognitive 18): fselect::function::get_aggregate_value has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"29540c2339e246216ba29e7e341f43fd1a8f74e5c19fb8a45e0c0c51ebf9c847"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_word_is (cognitive 17): Lexer::next_word_is has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lexer.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2b258ad1da111b050e412a1e383c28cec7ec4861173bb34e6bb98e4a0529a1"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::feed_utf8_lossy (cognitive 17): fselect::util::feed_utf8_lossy has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 2 (5 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 10). 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":"src/util/mod.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf95786603e5f81d15878dace0fb66807081cf8e8632dfc1fd6f3120d608f27"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::acl::find_entry (cognitive 17): fselect::util::acl::find_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (7 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":"src/util/acl.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f3bc8a370ff07d12ac4bb09ba8693a1f2c1c3db8ccff245ae7ff31721abacf"}},{"ruleId":"D2","level":"warning","message":{"text":"fselect::util::git::commit_changes (cognitive 17): fselect::util::git::commit_changes has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 4 (6 pts), boolean chains 3 (nesting depth added 7). 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":"src/util/git.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110c850a3506109c672e56b06183c62a565baf34dd0af339a7370c514cc2124"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Searcher: ClassTooLong \u2014 2121 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), 75 methods, 2 blocks, lines 106-3489. The bar is 400 significant lines; this is 1721 over it, 5.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a65a6473ef70eb6df79d2494e703cdf0bf13a6638abf65decf9c2d1cc8d5a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/searcher.rs: FileTooLong \u2014 2343 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: Searcher (2 blocks, 106-3489). The bar is 500 significant lines; this is 1843 over it, 4.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8221126c0a7ea955b477fa2b4c2acf2d9fe798c08f866a1399e55f945311032"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 1383 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 2 blocks, lines 30-2110. The bar is 400 significant lines; this is 983 over it, 3.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c124a3b9014da83c20f5dbe060f0ba9c784f06afc8822c18b9de40bd2fc8e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 1406 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 98% of them inside a single declaration: Parser (2 blocks, 30-2110). The bar is 500 significant lines; this is 906 over it, 2.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0420f380acc1c74b7a74ed69a8a754d21db29a67e3fc8266ce8b7544a9f1485"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Searcher.search_and_print: MethodTooLong \u2014 search_and_print runs 257 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 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d10bcd6cf25f4b510820417f1da5deac21e3ac0674f6083fb02fdd38a8e649"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Searcher: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfab0bae3bba085f28540e0c37b326cd05141f5634b2a3bd8ec423b826129107"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"805065a321828a48ef44f0e875a8b320655ed269d6146d75af7d83b21d7d2d44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b4b2421761f12512af4d8ea54f8a676b42d638ff646234992e2344b25d11cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: util/mod.rs: FileTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 505 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca915ca67a9cb7e1d0ea7038ac1046c0b9ae172a0ed8f91a178dee05ca9407d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Searcher: TooManyFields \u2014 52 stored fields beside 75 methods. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66cbe06119e5171baaf33d93364cdd0bf5afd4f5c5175ae5a0b6d54fa52340b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.next_lexeme: MethodTooLong \u2014 next_lexeme runs 173 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 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lexer.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ea6e0b9e1c94e21ef7770699f90949d2adc5635c135d6b37eaea76623d6f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Searcher.visit_dir: MethodTooLong \u2014 visit_dir runs 171 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 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"db146c5e760129063da1f8b6df2b44bfd89a8d0dd4aa50913da122cdf6c1f33a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Expr: ClassTooLong \u2014 644 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), 64 methods, 4 blocks, lines 67-1109. The bar is 400 significant lines; this is 244 over it, 1.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bac6ccd0b0a8de9ae34ecd7087881f925f2ed4a8675db17dafaed1250a2fc54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fselect::main: FunctionTooLong \u2014 fselect::main runs 161 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf46b37519b0e748834d9d69b2cd3ccc66dc67c117e3981373505f5d1b31f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fselect::field::dispatch::get_field_value: FunctionTooLong \u2014 fselect::field::dispatch::get_field_value runs 160 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 60 over it, 1.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":"src/field/dispatch.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba30630c2d38a534c7af23493138a64e38adc1d846a64f29bbb048bc1a5007"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: fselect::field::metadata_handlers: TooManyFunctions \u2014 46 free functions. The bar is 30 free functions; 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":"src/field/metadata_handlers.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"39145f751ea66664df71bbcdc768f88cb58fa3c460e7757e4c135d48034d971c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field/mod.rs: FileTooLong \u2014 747 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 247 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cafc01d717beaefdf4e73745d950e67c831bb18e5b970d2f9eaa587186eb9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 746 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: Expr (4 blocks, 67-1109). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bad7b1d7abc36c8b3d1f445e92d82503c1ed3a47f81aa350eb6eab83e05d28d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Searcher.check_file_inner: MethodTooLong \u2014 check_file_inner runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36cb99df109fa87e73816844448bc5b96bdb98575019dc35c119c7d1ba143f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_comparison: MethodTooLong \u2014 parse_comparison runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e9f476cd021b5c1007c71d4bcedca83da2e0fc5fe3c96a62dc15538f584a37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_root_options: MethodTooLong \u2014 parse_root_options runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"325824abc55ae04e056ed25dd42c65c5996215421c4c99c83233a59f80464cea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Searcher.get_column_expr_value: MethodTooLong \u2014 get_column_expr_value runs 112 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 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"41957d1f3116f45c563b618fbc0befa4c9d94e852985f7537c1f58e8e2000d17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fselect::util::format_filesize: FunctionTooLong \u2014 fselect::util::format_filesize runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"660e557f89b45ea9ef2460717eb6a594f6d77a269d92915cff98c0b9271a95dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse: MethodTooLong \u2014 parse runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cc9fba05f8e08aa39c924511d77f32369f1808c256ae25c309fb75c6c778f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): src/parser.rs:1744-1824 | src/parser.rs:1863-1961 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc191b91c451ba34fd0e7e7ef5bbba6aaa46e47a2cd79571672dd95a1f962ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 45\u002B corresponding lines): src/util/win_xattr.rs:18-63 | src/util/win_xattr.rs:66-110 | src/util/win_xattr.rs:115-160 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 45 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":"src/util/win_xattr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c030df9107c8a3fc7cca34c481ca611075745abbf233c2e8dd6aa6d43b3eafe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/parser.rs:1127-1162 | src/parser.rs:1164-1197 \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":"src/parser.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1005b0f12d4613120814b3ef209e5a56fa9e017fe03da6e518cb78ec508dd2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/field/metadata_handlers.rs:373-397 | src/field/metadata_handlers.rs:399-419 \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":"src/field/metadata_handlers.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f56a0483b9238d60845bf4d44578ed74704d101d8f1b6ff084c17b400be0315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/field/metadata_handlers.rs:421-439 | src/field/metadata_handlers.rs:462-483 \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":"src/field/metadata_handlers.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b07916e1bdfb11d6c5a8105e2a9a44aa00dd9073d8e0883984cc0a61d35bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/searcher.rs:1495-1518 | src/searcher.rs:1521-1547 \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":"src/searcher.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"729c599c4170700cb54f6c43cc3999ac5c558648f4246b9cb7a85973c36f77fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/util/mod.rs:1181-1203 | src/util/mod.rs:1208-1237 \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":"src/util/mod.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f7355612d15975ca7e484fc0cfd6785344f0a154dbc5e87b9641922e82878e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/searcher.rs:3115-3133 | src/searcher.rs:3139-3157 \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":"src/searcher.rs"},"region":{"startLine":3115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d48436de02a82549b6af6c6ce0176461d91a5148b50453453f4d337f1f31ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/util/git.rs:428-436 | src/util/git.rs:438-446 \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":"src/util/git.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18c31fba7f3dfe5db0326fb62ce96c849c24bf486a661ea5b36b86679d149a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/util/win_acl.rs:186-204 | src/util/win_acl.rs:208-230 \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":"src/util/win_acl.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba542d6cbda7df3ca6949aa3d6d6325626686faf2c49de1e9219f73b674de6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/field/metadata_handlers.rs:266-285 | src/field/mode_handlers.rs:7-23 \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":"src/field/metadata_handlers.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d5317a46a4dee280b6531f145e4202dc209f6ee35ccbb2408232df0d6d8c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/field/metadata_handlers.rs:330-350 | src/field/metadata_handlers.rs:352-371 | src/field/metadata_handlers.rs:441-460 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"src/field/metadata_handlers.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab694fcc6abec814aa2534bf22e189a4fab7b43a3dafa3e394a4061fe8fbc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/parser.rs:2012-2037 | src/parser.rs:2039-2064 \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":"src/parser.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d635d2cb9d0cf621b5b0e88a38c9a2ce69d49a0e216371b3b7910288002a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/expr.rs:184-206 | src/expr.rs:284-308 | src/expr.rs:348-369 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"src/expr.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d57cb69e93ca3dfb00c5c4b2400ac2440541b46285b14457ecb24faa6a9dee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/util/variant.rs:200-214 | src/util/variant.rs:231-242 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/variant.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ad87530426bd5a64265beaa6a7813e9fe100026b0fe53e65f661f73f8caf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/ignore/docker.rs:32-51 | src/ignore/hg.rs:42-62 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ignore/docker.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a3d400fd1c2975d516ea2b696422b1a2bb1e0b2d9bfe3ebd317b16eca75147"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/main.rs:463-471 | src/main.rs:473-481 | src/main.rs:506-514 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 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":"src/main.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3268fa1d236b35f01e418d37a99c7c3fa5e0ba76338ba47bd66d1c4167ce4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/util/mod.rs:132-147 | src/util/mod.rs:176-187 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"04db3da17c6abb10393cf75e1409048e6577f013b5ecd4460483e4614b355aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/field/metadata_handlers.rs:76-263 | src/field/mode_handlers.rs:104-118 | src/field/mode_handlers.rs:121-135 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"src/field/metadata_handlers.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed587c4192eaf95597e6aae2da58d8dfa645fea37422ea91887cf7c7e57cded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/field/exif_handlers.rs:23-31 | src/field/exif_handlers.rs:33-41 | src/field/exif_handlers.rs:43-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 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":"src/field/exif_handlers.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e79b58e96dd13f2f4a7fe635a7ad96d2a3ee248a94b116e4689333b4f510f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/output/html.rs:7-19 | src/searcher.rs:1132-1144 \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":"src/output/html.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7389a4966b73fff0f50a16fc7dba249fe14ee7f6ee1879ca30b8bed0dca1b915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/ignore/docker.rs:53-66 | src/ignore/hg.rs:64-77 \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":"src/ignore/docker.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b084626d9a24b9d113819ae52c6311b59b8c6f38999660ce2293a6cb3c87407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/util/dimensions/mod.rs:35-43 | src/util/duration/mod.rs:32-44 \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":"src/util/dimensions/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceb05b99bc0a6fb5c610c3381791370e215c6d56155073f9ca2314e0307d0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/util/extattrs.rs:71-83 | src/util/win_attrs.rs:70-82 \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":"src/util/extattrs.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0429e23dc156a16c8b2137b6d33336de2a4d7e4515c2bd257fe953209a4fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/util/mod.rs:1474-1488 | src/util/mod.rs:1562-1577 | src/util/mod.rs:1630-1642 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"src/util/mod.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d393aaf2730afcbae306bbaa1a5e80c7684ad910d5ba4359678bc1ec4aa9035f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/expr.rs:164-182 | src/expr.rs:412-432 | src/expr.rs:460-478 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"src/expr.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc76366782416fe5a7b26c7808ea22ffc8d983e74c86ebfe64ffaa99040688fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/field/path_handlers.rs:24-36 | src/field/path_handlers.rs:38-50 \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":"src/field/path_handlers.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1ee8bb8654ac45a40e1667a8a96ed73db3f0fa340fe4b6fdbddef7b68b85cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/field/media_handlers.rs:33-40 | src/field/mode_handlers.rs:85-92 | src/field/mode_handlers.rs:94-101 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/media_handlers.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"422f3721a5162b7f25b19481ab22d5df9e323cdde58402aae845b2d10c52351f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/util/win_acl.rs:93-105 | src/util/win_acl.rs:110-122 \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":"src/util/win_acl.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498ea49ee17c845b44dbb60fe254e17a891092dfd321b63bebecbf756bd8585"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): src/field/content_handlers.rs:15-22 | src/field/content_handlers.rs:24-31 | src/field/content_handlers.rs:33-40 | src/field/content_handlers.rs:56-63 | src/field/content_handlers.rs:65-71 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/content_handlers.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"95396205de5004abcd48901c6fe21de45851ccb80b39ff83d7ba0ceed7de769c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/parser.rs:1142-1162 | src/parser.rs:1177-1197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser.rs:1142\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e4c416def4ece0875ffb5bb7ec14b83433199f9dc52f5836e0ebd9fbe68d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/util/win_xattr.rs:45-63 | src/util/win_xattr.rs:142-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/win_xattr.rs:45\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/win_xattr.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e00fbda28ec5ad07d298a94421697c35da9b534d7ac8bc902bed5269b236cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/util/win_xattr.rs:19-36 | src/util/win_xattr.rs:67-84 | src/util/win_xattr.rs:118-135 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/win_xattr.rs:19\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":"src/util/win_xattr.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2379cff1e8b75193cba6cdd699c2439d9570780efe343f7af2ecda0aa868b051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/searcher.rs:803-818 | src/searcher.rs:829-844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce5746828e0b5b7d226f1425abc29bf5caf5acc9957505de7f55ba770bff407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/parser.rs:1748-1761 | src/parser.rs:1868-1881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser.rs:1748\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":"src/parser.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2f8fe7e67361d68e41da24260e6929f0c45672fd163b1c2f50d8b86a045322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/parser.rs:1763-1774 | src/parser.rs:1883-1894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser.rs:1763\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/parser.rs:1895\u0060 calls \u0060push\u0060 and \u0060src/parser.rs:1775\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":"src/parser.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8d9a46eafacc4bf48dbce98758c915245a71506000dff4ee1c321547512673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/parser.rs:1228-1238 | src/parser.rs:1248-1258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parser.rs:1228\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":"src/parser.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d4cb30faf856685bdce184f312317ae2429767eaadb486646c5d890f3463ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/function.rs:1174-1185 | src/function.rs:1242-1253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/function.rs:1174\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7a5a933bfeb8f55166252117728a0dff4eaa476ae6fd4c13e28c808784a9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/function.rs:303-311 | src/util/mod.rs:835-843 \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":"src/function.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75db361d63eedfa412d1f82af42d2f119ce031372f8af1fde3cee26262e8243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/function.rs:1144-1151 | src/function.rs:1209-1216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/function.rs:1144\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7f103bbc3639950b524d9393a17d012db4b618e3b9fcc5eb3e6fb16f870e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/searcher.rs:971-981 | src/searcher.rs:1041-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"730de680dbf5086badc13348375c49cafc4f7f5320c8c16340a83bce4f2eb5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/util/git.rs:137-143 | src/util/git.rs:155-161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/git.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c369df991a04d37ef47940e03c21a6c3713751380bc2f979580ef87160188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/function.rs:926-931 | src/function.rs:944-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/function.rs:926\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":"src/function.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd5285a1a1d6f5ec432114c2c94355c0a265a5ba7e213d83fc5ecf57a377d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/function.rs:1203-1208 | src/function.rs:1236-1241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/function.rs:1203\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":"src/function.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d879ac8641321eac6fd0b1f763bcfa713338bc4993e8ac7e1a411031efa7556e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): src/util/mod.rs:321-325 | src/util/mod.rs:328-332 | src/util/mod.rs:335-339 | src/util/mod.rs:342-346 | src/util/mod.rs:349-353 | src/util/mod.rs:356-360 | src/util/mod.rs:363-367 | src/util/mod.rs:370-374 | src/util/mod.rs:377-381 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/mod.rs:321\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":"src/util/mod.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0ace2202b77edab808101fcb48471b7918c7551e329e3268ddee6faf433ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/util/mod.rs:300-304 | src/util/mod.rs:307-311 | src/util/mod.rs:314-318 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/mod.rs:300\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":"src/util/mod.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa85950267426d52a07bcee4672c2909796af38736345617de197c3eb4ba94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/field/metadata_handlers.rs:385-389 | src/field/metadata_handlers.rs:409-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/field/metadata_handlers.rs:385\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":"src/field/metadata_handlers.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e67ca0bde0ff9b9e7b41d9e5a4957913ebe133285f3c70f28c72b66ef2cec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/field/metadata_handlers.rs:425-429 | src/field/metadata_handlers.rs:467-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/field/metadata_handlers.rs:425\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/metadata_handlers.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c295ec80f0055476fb277135b52878530245e08c1ef0623ebe7d142f8b1de6e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/field/metadata_handlers.rs:463-467 | src/field/metadata_handlers.rs:486-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/field/metadata_handlers.rs:463\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":"src/field/metadata_handlers.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"5839336b2c11015b7dc0be1b369701e0a5c46fa68d2a95d8ccd6d415970ca009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/function.rs:1139-1144 | src/function.rs:1169-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/function.rs:1139\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":"src/function.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6944e7da97847d381ebb80249a4c368ecc4294af331e46eb36553757fbed9252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main.rs:465-471 | src/main.rs:475-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main.rs:465\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":"src/main.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f944f610fa2921f6f01ad8d96d4cf0c18db9bcc4d7b5fc6829d9e6974e34c5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/util/capabilities.rs:88-92 | src/util/capabilities.rs:99-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/capabilities.rs:88\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":"src/util/capabilities.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b85a3c120a9cc12edc2fee79a475f4dc96058015c58828346a67077edc4a969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/util/extattrs.rs:61-69 | src/util/win_attrs.rs:52-60 \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":"src/util/extattrs.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0be7a86d6b78774550d35d30fd2e26ef3b9412a8549aaa4542b5444639b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/util/mod.rs:261-267 | src/util/mod.rs:268-274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/mod.rs:261\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":"src/util/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9491f08c2d1ddc5451d4902bc61e55c451b6c80709acbf35e301dc148fcc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/util/mod.rs:275-281 | src/util/mod.rs:282-288 | src/util/mod.rs:289-295 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/util/mod.rs:275\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":"src/util/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5e50a000ecb9c0913e6178193c48a58057431628c9a837fccd9b7bd11e4ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/function.rs:743-749 | src/function.rs:765-771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/function.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d04c977ae7ce0623a4ab3bd53c36199c38b774a5ba31334316363e70954e62e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/field/exif_handlers.rs:26-31 | src/field/exif_handlers.rs:36-41 | src/field/exif_handlers.rs:46-51 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/field/exif_handlers.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/exif_handlers.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d022a567aaae616661e8fa640f142a54bfc88adc2d0c52afe63d9e0dc64c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/util/dimensions/mkv.rs:18-23 | src/util/duration/mkv.rs:18-23 \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":"src/util/dimensions/mkv.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a95759cdd0e4bca51df68ecbbe6c32519d986a162143ef6e94b5610a955dc5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FileMetadataState (LCOM4 11): FileMetadataState\u0027s methods fall into 11 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 11 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":"src/field/context.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cbb98b04308baea3c70aeac49ec3dd78f001f70135e9068c7634b3d85019c9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/config.rs: 47.1% line coverage (49/104)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f39c712208840f81c3a4b7003d2b51a12011be93376595d0effca010f13ef00"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/dispatch.rs: 39.3% line coverage (44/112)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc43020db2049c91743f4d3543affe0ad4d61a24da4522bf8878bce3b89d1f88"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/exif_handlers.rs: 8.1% line coverage (7/86)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/exif_handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdaab9a25dfe375b88022bf6218cd0701836d9178b2c39d566b404ca5517903f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/git_handlers.rs: 0.0% line coverage (0/50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/git_handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08963a99f6a40a38433f45b7df7d8cb35219df0a2584ed35269169ec8eb59256"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/hash_handlers.rs: 25.0% line coverage (4/16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/hash_handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d251e88a9702887de32da4cf5a52a967b4bfda96d409cc718843b148a011d9"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/media_handlers.rs: 19.2% line coverage (14/73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/media_handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b043bf9bc7cccc2e74188a1d15c78062bdd9757cd2e61c145dafe478ed0b628f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/metadata_handlers.rs: 44.4% line coverage (127/286)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/metadata_handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d507ac437c14af5bd0eeee20bdfa35ce78e5e43bb5d6ac584ea69cb749267d7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/field/mode_handlers.rs: 18.0% line coverage (18/100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/field/mode_handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"802c954b7a7d71151da85734cda93381f7340f058854c65204c97970ee083dde"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 11.5% line coverage (39/339)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/util/duration/mod.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/duration/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a516d5eb644867ebfa6ad70a57eb089da0625a49c404eca15b00938dd25de329"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: tree_magic_db: \u0060tree_magic_db\u0060 3.0.1 is published on crates.io under \u0060GPL-2.0-or-later\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3f876a6a8d41d31589133565e24386fa029e7dfdc6215bd0fe0cdac747820807"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/searcher.rs: src/searcher.rs changed 164 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in Searcher::visit_dir at line 1635. 106 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/searcher.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/searcher.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fb6c61aa17b24dd18fa7f3f53555e156a3ee3c1fa148233121c0ef902a113f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parser.rs: src/parser.rs changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Parser::parse_comparison at line 908. 38 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"845d3c80394c2808057c31fac3dbd0fa49b805b51513087167c3f9f22a3acff2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/expr.rs: src/expr.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Expr::render at line 995. 19 of those changes were fix/bug commits, and the other 28 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/expr.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5c269b09de51e13a859a62300123e04e1f5aac1c678325fd7731a8c6388b23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lexer.rs: src/lexer.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in Lexer::next_lexeme at line 217. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/lexer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lexer.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"560554a5baba813cd9d3127c8ccf5fd8d409081574b65bbf4fe39a360b4dd093"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/util/mod.rs: src/util/mod.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fselect::util::get_exif_metadata at line 686. 10 of those changes were fix/bug commits, and the other 18 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/util/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d756af7f51f47b785b04bbdd82ee254a735e242b4d1463b6701923b3fd2f68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/util/datetime.rs: src/util/datetime.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fselect::util::datetime::parse_datetime at line 81. 4 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/util/datetime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/datetime.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"092a875494e7c22dab4df03684e8f72daba7a9b2e69db9ee0a348907da3e7b46"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/util/git.rs: src/util/git.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is fselect::util::git::commit_changes at line 500), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix git\u201D; \u201Cfix git regression\u201D; \u201Cfix git related bugs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:42:02 \u002B01:00\u0027 --until=\u00272026-11-09 09:42:02 \u002B01:00\u0027 --full-history --no-merges -- src/util/git.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/git.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a40b240f348aa5a034acdc46a9ce7d543cb8cfc74eaef91f8bb0af584b9465"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9269d57ae2d0fdd9d36822295cd584b0a25a4bc0ab67d0b10f33f28c4e6b88"}},{"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57d94ecf1e4e1b67a0a20e1126764020d74cc51d3a14b0d8b3faf921de4f9ffd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d236e2eb5661e26c6177aeed5d0fa0a37641a17313636ac1d87f67a88eec1e2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd25e2b83ac639dcce62732f13612d523e8aef52d4618f47fd6e8fade8bafee2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3697f1522e19a638b7ef88b7aaf49350d5b9b08b7c831fcbc85b3c68f84dd986"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acefbdd9133f7ebd7b2ae5ea549699a8f57ce0d7681e6ab09d0d3fd19c3061dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7c0f9c8293ac4302cb0c73a803b1e600dd92aa45994f24cce64b0c3466566f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcb3e35b7ceb6e066202e8b0d09947e3c69a91f2942e781ff30459e207796cd0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"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":"94a5aac744cec20fcd4bd49e3dc733665c735fff55525a54e3d6a7e747b619c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06dcb5f670fc7c678ac3933493502944f0140be4e8d81f1cbc5532f8db54ed93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"183f01dfb9f48af7d10f02064220b3fdb92a9a960a3dc3e2e9e993c60b496c51"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c591a064849548f418685394ed81a08adc90c8ec19ce74fe9a36c9a84843b836"},"properties":{"dependency":{"package":"chrono-english","version":"0.2.1","advisory":"RUSTSEC-2024-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6509f9ae7e567aeb5bd9753af08953fb31dbbc35f92a3e6fabf6a748ba58f762"},"taxa":[{"id":"CWE-527","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-538","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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 47 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; 47 of the 61 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: src/util/dimensions/image.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":"src/util/dimensions/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceb289abd23aacb6f9feba5100ef7699f389aa6f13a7e47262e1f7ed5a9c7bc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fileinfo.rs \u2194 mod.rs: \u0060src/fileinfo.rs\u0060 and \u0060src/util/mod.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00602fd4b158\u0060 fix found regressions; \u0060e5ce972b\u0060 improve archives handling; \u00607de70662\u0060 optimize heavy columns \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fileinfo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aac0b924f2b70da9f400679636072ca0f15c36a309c246f843e39f7f98d95f"}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b3856dc48c94a2ef2fb1ec98294eb281aa479096b2de4ad945576786b374c23"},"taxa":[{"id":"CICD-SEC-4","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/rust.yml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022mkv\u0022 == ext_lowercase || \u0022webm\u0022 == ext_lowercase\u0060 appears character-identically in 2 files \u2014 src/util/dimensions/mkv.rs, src/util/duration/mkv.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":"src/util/dimensions/mkv.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"49438d2db2154d7c2115cf28f46f8e4b47a395e95da5f4fbcf1b7d9c69ed29ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060hash_file\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util/mod.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34c641d74cc411e209878baedd9ee970e16ef077390e10801c9f0c6dc89f3e2"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-527","guid":"79b27cde-9d04-1a54-b64b-d5bb9b4a8ee7","name":"CWE-527","shortDescription":{"text":"CWE-527"},"helpUri":"https://cwe.mitre.org/data/definitions/527.html"},{"id":"CWE-538","guid":"3baa1f05-df1b-ae58-9ee0-1d790ff4a989","name":"Insertion of Sensitive Information into Externally-Accessible File or Directory","shortDescription":{"text":"Insertion of Sensitive Information into Externally-Accessible File or Directory"},"helpUri":"https://cwe.mitre.org/data/definitions/538.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":27,"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."]}]}