{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"id":"C3","name":"Audit Trail","shortDescription":{"text":"Audit Trail"},"helpUri":"https://codehealth.canine.dev/dimensions/C3"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of (cyclomatic 141): pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of has cyclomatic complexity 141 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0235edfc347b9bbf1dd5a912eb582e092b64c4d4dd3a913f3e0da9d50c48b78"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::normalize::clear_location (cyclomatic 106): pgls_pretty_print::normalize::clear_location has cyclomatic complexity 106 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/normalize.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7920811f38cee90287aa8ece0a9ffe45726c9d2c5adc01f057d73bcffde726dd"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::constraint::emit_constraint_of (cyclomatic 75): pgls_pretty_print::nodes::constraint::emit_constraint_of has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/constraint.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7431100fcb9531e5855d2f1d021a2e087298f695e8ba3bff217b3b54beb0dad7"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::column_name::step (cyclomatic 60): pgls_catalog::resolve::column_name::step has cyclomatic complexity 60 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/column_name.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dc1c154139fdd9e559171ca962b2e4357c13be9a0cbd1dc1e21344e8057b14"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor::advance_token (cyclomatic 57): Cursor::advance_token has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_tokenizer/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aae993ada41d81ea5c9ae46472f9423e0965f4720c2f4d54f5222c4529809c"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionFilter::check_clause (cyclomatic 55): CompletionFilter::check_clause has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"527006bd5f07815950a9cf947c67d9ba9a1b56a6a8c796ae0bed1c695b793299"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::select_stmt::emit_select_stmt (cyclomatic 55): pgls_pretty_print::nodes::select_stmt::emit_select_stmt has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b419437e116a048858bd4685705b36b2a0227851c8625a032d3370f551cd3b"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::function_options::format_function_option (cyclomatic 50): pgls_pretty_print::nodes::clauses::function_options::format_function_option has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/function_options.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce32a9522a483166a0cc76fff01cd2ad73066785cc08bde28ebed353fcaa046"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::extend_token (cyclomatic 47): Lexer::extend_token has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/lexer.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dc3a7199812e596469a5645232022b39fadfce75d98766b5d2b7c75ce4f171"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::overload::select_candidate (cyclomatic 46): pgls_catalog::typing::overload::select_candidate has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8407565b434a30d0dd031851ef498a9cac10fad68a780deee5449fd738c115"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_stmt::emit_create_stmt (cyclomatic 46): pgls_pretty_print::nodes::create_stmt::emit_create_stmt has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e2bb3d00f48cbae73529fb905cc144dc09ce48ac6e723d5b42f100f5090174"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::resolve_node_enum (cyclomatic 45): pgls_catalog::resolve::nodes::resolve_node_enum has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9efdb2a1fc25513cff63d2338ace9873270dd2d04619bce566ff607860a5fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_role_stmt::format_role_option (cyclomatic 44): pgls_pretty_print::nodes::create_role_stmt::format_role_option has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_role_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc8a399397294723e1fa90ff003985b22321f073c50329556c30d97e497502c"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::expr::a_expr::infer_a_expr (cyclomatic 43): pgls_catalog::resolve::expr::a_expr::infer_a_expr 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":"crates/pgls_catalog/src/resolve/expr/a_expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ad1c1ca08f655f4b0c02933345eb9e1deb292d8051acd57c2b67bafbd6af58"}},{"ruleId":"D1","level":"warning","message":{"text":"docs_codegen::rules_docs::write_documentation (cyclomatic 42): docs_codegen::rules_docs::write_documentation has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"682251709ca706c44686582c7562ad1ca71a44c44949e79be7b224546804d168"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::options::emit_role_option (cyclomatic 39): pgls_pretty_print::nodes::clauses::options::emit_role_option has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04abea14c2de61834455e38cc9b0feae9ccdf12de2fddd9448f31f53bdafd8"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::unify::check_generic_type_consistency (cyclomatic 38): pgls_catalog::typing::unify::check_generic_type_consistency has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"04323b673f5519825704fde4249424237ddb0c7d3d0858109a6d0488a23080de"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::unify::resolve_polymorphic_result (cyclomatic 37): pgls_catalog::typing::unify::resolve_polymorphic_result has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3569886aeedabe7ad67630a6bf1b61c2bc50f91ccc149b49f521d905af7c3574"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionScore::check_matching_clause_type (cyclomatic 37): CompletionScore::check_matching_clause_type has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/scoring.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a73340a1e552ac63cd495405c5d2983e3182879bd3b1ccdf1fa2fe5ba8f1b2"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogBase::new (cyclomatic 34): CatalogBase::new has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/base.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6383ef5012de9746c1c26f56ae902133ecf63fb932fba96fdc11032a049f3a17"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_diagnostics::display::frame::print_frame (cyclomatic 33): pgls_diagnostics::display::frame::print_frame has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca216b7326f51bac0252bc31373a6b3258c3549e60d541f9e6cc64799848fe4d"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt (cyclomatic 32): pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"465567213973487f989d21588db8b91d7f69965db8afdc28d5d376f7de3991c2"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_statement_splitter::split_region (cyclomatic 32): pgls_statement_splitter::split_region has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beed8b430a95bffea7f91fb045ad8fdd741ca80de24106359aa5012c40d4352"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::join_expr::emit_join_expr (cyclomatic 31): pgls_pretty_print::nodes::join_expr::emit_join_expr has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/join_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5834b60fe5b6f6399c4974afd7f33e27dc36cc9c63ac95b92b2d39dc38f1865"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_workspace::workspace::server::formatting::format_document (cyclomatic 31): pgls_workspace::workspace::server::formatting::format_document has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/formatting.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d298b7dbd7ecb952adffc302cd89e50f855894e3eb4df2f00397bade6e24d23"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::session::transaction::prevents_transaction_block (cyclomatic 30): pgls_catalog::session::transaction::prevents_transaction_block has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/transaction.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ee7c4d62ee7def9b396330d565532e781736712f32dc39486ed323f0f800f5"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_expr::emit_json_expr (cyclomatic 30): pgls_pretty_print::nodes::json_expr::emit_json_expr has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7103d7d604124347211f64869fe30266c84200e669a3b3e7caf17804037626d4"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_markup::markup (cyclomatic 29): pgls_markup::markup has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_markup/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b80afcdc9393ce652941db6ef6f6749a43f18866f601009e52494b564237bc"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::func_call::emit_sql_syntax_call (cyclomatic 27): pgls_pretty_print::nodes::func_call::emit_sql_syntax_call has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bc5ba9c4b64710cbb26f99971c31576c0e9f0074cffb641fc63a5f4c68ea8e"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner (cyclomatic 27): pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1395190126cec96984867367de07cd0a46b61bb925678586b12723f507324350"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::xml_expr::emit_xml_expr (cyclomatic 27): pgls_pretty_print::nodes::xml_expr::emit_xml_expr has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/xml_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7976954523d98b16e0ec44c275fd34cee79151eed8b403b3c26715a11f406"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::normalize::normalize_merge_support_func_recursive (cyclomatic 27): pgls_pretty_print::normalize::normalize_merge_support_func_recursive has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/normalize.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc5de85ca2214c8b4084828ef3da026032648e97ac5e5fe293ccd8e1d42325c"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_semantic_tokens::semantic_tokens_of_references (cyclomatic 27): pgls_semantic_tokens::semantic_tokens_of_references has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_semantic_tokens/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d288296017ef84747499acd9e6c47b43de495a3420460e5f42c6acb60ce7412a"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt (cyclomatic 26): pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f958acce7c18130931dab4ce61b98775ad67f8ab21f4df0aaf5bf2ae41c3865"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt (cyclomatic 26): pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b13ad3e671d715522cb9faaf45bb6fbf60c76a008a180637cb6fcb60bb760b"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::create_stmt::create_table (cyclomatic 25): pgls_catalog::catalog::ddl::create_stmt::create_table has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_stmt.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3b75113deb760d6e23775ed47e0adb2ab0e787ebe7f6ed33701eb592c81bca"}},{"ruleId":"D1","level":"warning","message":{"text":"DeriveStructInput::parse (cyclomatic 25): DeriveStructInput::parse has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics_macros/src/parse.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ddd3f3d7373578fff35a8311905c7c77c1094dccc368b5980169692ee25b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::a_expr::emit_aexpr_op (cyclomatic 25): pgls_pretty_print::nodes::a_expr::emit_aexpr_op has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b1ba43183d66d60e15a2c10cb957add1b6f68c7143f7bbfe100ef3aac9ce79"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::variable_set_stmt::emit_transaction_option (cyclomatic 25): pgls_pretty_print::nodes::variable_set_stmt::emit_transaction_option has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e653da927047755e0b991baa01d043d81e4ce9b5e1cb1354825159afc5dbe843"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_walk::walk::walk_statements (cyclomatic 25): pgls_walk::walk::walk_statements has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/walk.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c3f5c01e626191cdb4dc5921346d731d5dfd41bcf66a46ba73c1f60b38bd00"}},{"ruleId":"D1","level":"warning","message":{"text":"docs_codegen::schema::rename_partial_references_in_schema (cyclomatic 25): docs_codegen::schema::rename_partial_references_in_schema 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":"docs/codegen/src/schema.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b31c6ffda82cbd5c2a80ac63ebce418f69eb2a32202a80d1d42f5cd14f11fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog::snapshot (cyclomatic 24): Catalog::snapshot has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/materialize.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"608dea9ef6ca6ec8583490a6d549961cbad2ac9b7350e1b8af70016b20395895"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::options::emit_sequence_option (cyclomatic 24): pgls_pretty_print::nodes::clauses::options::emit_sequence_option has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ad3c90f515e3516dcc3dfb29be793f1da739e5e7c89054f8b4b01d359aba4"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt (cyclomatic 24): pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/comment_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddad1a214ac26eaf7a957d716791a21a603afcc255e32dc75b05e44fdc9bae61"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::sub_link::emit_sub_link (cyclomatic 24): pgls_pretty_print::nodes::sub_link::emit_sub_link has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/sub_link.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9615d61d126af5bbd9d446f14868d501d3f5ef3e05a2cfdd7d9f10913c3060cc"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_statement_splitter::splitter::common::unknown (cyclomatic 24): pgls_statement_splitter::splitter::common::unknown has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/splitter/common.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"269239354edae5d7cf8e5076864fef9aa914c258a8d4752fcb907db498316ca8"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::drop_stmt::apply_drop_stmt (cyclomatic 23): pgls_catalog::catalog::ddl::drop_stmt::apply_drop_stmt has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/drop_stmt.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c513ba83ae51e66be3f45f09de19860d9d7ee828f814579c163013d75a873e0a"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::index_stmt::index_columns (cyclomatic 23): pgls_catalog::catalog::ddl::index_stmt::index_columns has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/index_stmt.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"064362a3fbc370991611ddc353acd303e4e94ca2068c05f4f7073538b3372aaa"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionFilter::valid_keyword (cyclomatic 22): CompletionFilter::valid_keyword has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de72f5dcf8dcd435cd0f8ca3cef1cdc743f921b3b42e577716d2a46f315dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"HoveredNode::get (cyclomatic 22): HoveredNode::get has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_hover/src/hovered_node.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"72497282f7caf2fa51d2b540a84ef2a72cae7dca44c58cfab9ce5460ef8443d8"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_typecheck::diagnostics::create_type_error (cyclomatic 22): pgls_typecheck::diagnostics::create_type_error 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_typecheck/src/diagnostics.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a449325a4e985ac7d6b6b58105c3915cf5e368df9eded74e267b9c91cf26b"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::overload::function::select_function (cyclomatic 21): pgls_catalog::typing::overload::function::select_function has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/function.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1c7e292ab677ab486c3734617f2d4248d2bcc506798873d57476f9550b562c"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt (cyclomatic 21): pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"248096562b6f5331fbb8de4764aea5a67ba84c0b65f5fc4eb6cf527530e24d68"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_change (cyclomatic 20): pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_change has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a169ad9ba025bd6cfa9eb3eb025663d558e7c65df3e99d71aa5fa1037e123"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::coerce::can_coerce (cyclomatic 20): pgls_catalog::typing::coerce::can_coerce has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/coerce.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e4dacf1abf7e3c90036a01834d80df7bc8c6776aa41ddd490611aebf69a891"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::overload::candidates::expand_candidates (cyclomatic 20): pgls_catalog::typing::overload::candidates::expand_candidates has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/candidates.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91fdb16dce4716dea8aa655c70db95329893d8c2cd433a4a29a1cf00f562338"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_func_expr::emit_json_func_expr (cyclomatic 20): pgls_pretty_print::nodes::json_func_expr::emit_json_func_expr 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":"crates/pgls_pretty_print/src/nodes/json_func_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a33486256c946354c36b969385dd7f90a948a6b0904583011d645ebd66e3838"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_table_column::emit_json_table_column (cyclomatic 20): pgls_pretty_print::nodes::json_table_column::emit_json_table_column has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_table_column.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6855ff5e4290f70bbc14c65875bb80b57e00cef8d8ea543842caa4ba7a876076"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_workspace::configuration::layers::apply_override (cyclomatic 20): pgls_workspace::configuration::layers::apply_override has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/configuration/layers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1983254869186eff9292882ee84308c38e7b3f8523845f6d53d79bdd6462fb"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::create_function_stmt::resolve_create_function_stmt (cyclomatic 19): pgls_catalog::resolve::nodes::create_function_stmt::resolve_create_function_stmt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c68d0ce0cd2a31ba4ea0620ef143ccc289f7c435c3c0ff7c952e13490a36c27"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::coerce::find_coercion_pathway (cyclomatic 19): pgls_catalog::typing::coerce::find_coercion_pathway has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/coerce.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfb316ac90afe786ec08d6d4e529ba0d8d9e9839517c419d044f0f052d7a2d1"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::typing::unify::select_common_type (cyclomatic 19): pgls_catalog::typing::unify::select_common_type has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba424caaa14024f7f95225de54be8ff0c4a83b6d0293d65878c606580e4c94c9"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_diagnostics::display::diff::print_full_diff (cyclomatic 19): pgls_diagnostics::display::diff::print_full_diff has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/diff.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f09038b11bb18eae747091a6eb521b1157145a9cd5f170e3ac605290fbafdb0"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_diagnostics::display::frame::print_invisibles (cyclomatic 19): pgls_diagnostics::display::frame::print_invisibles 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. This is NOT this file\u0027s highest cyclomatic complexity: pgls_diagnostics::display::frame::show_invisible_char (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83f2a555d357cf28d8890f83e2e834b26e31730ffa7c35548d775161ddae92d"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::transaction_stmt::emit_transaction_stmt (cyclomatic 19): pgls_pretty_print::nodes::transaction_stmt::emit_transaction_stmt has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/transaction_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c5a7ceb61f5e038bd0c17b8821e9ed368867cf2953c590abefc3223a81d49d"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::rename_stmt::apply_rename_stmt (cyclomatic 18): pgls_catalog::catalog::ddl::rename_stmt::apply_rename_stmt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/rename_stmt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01927ae045188617299ad092331c4049b5560505eae2ffd47f4e328052538ae"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::func_call::resolve_func_call (cyclomatic 18): pgls_catalog::resolve::nodes::func_call::resolve_func_call has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/func_call.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7b8418a0c155a27758447340d268c2812490dae2873d680d13f4ea99904bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionScore::check_matches_query_input (cyclomatic 18): CompletionScore::check_matches_query_input has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/scoring.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45f5f4e667d5780776186e8e2c0e348bfbe9272a240329a7e05526c858297f6"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause (cyclomatic 18): pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/merge_when_clause.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9496f07e04b14e1bf8945100fe43a47d3d7ffc83c957c34377276b1c73c6a4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_query_ext::function_body::atomic_body (cyclomatic 18): pgls_query_ext::function_body::atomic_body has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_ext/src/function_body.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c81a695524c8245d02c7381b338559ebf9dea61c674f4866b990e58b830219f"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::apply_variable_set (cyclomatic 17): Settings::apply_variable_set has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/settings.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be17133ec21492864aff36e6ac7f293907c8df4b448d7f290a774195c797fc3"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::create_function_stmt::declared_type (cyclomatic 17): pgls_catalog::resolve::nodes::create_function_stmt::declared_type has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a62b26d869a8e38634e9ef602098107494d74473758bb8dcea6a1ed4f23a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::range_function::resolve_range_function (cyclomatic 17): pgls_catalog::resolve::nodes::range_function::resolve_range_function has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/range_function.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2c948062e07741c957ad114e2e2c4afb158503c5fe2d76cd46a9eb57cadaf1"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::select_stmt::resolve_select (cyclomatic 17): pgls_catalog::resolve::nodes::select_stmt::resolve_select has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/select_stmt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdd75dd76552e0307bde2f45d1e281eb6a21589823194c8e32dd0d95415c085"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionFilter::completable_context (cyclomatic 17): CompletionFilter::completable_context has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfac361f005d689cb73a5cdfa255cde5f83a9455ec4aaaee1940fa8a519f92ed"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_completions::sanitization::cursor_between_parentheses (cyclomatic 17): pgls_completions::sanitization::cursor_between_parentheses has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/sanitization.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3502f3accecfd153fed869b3fa2808a4d84c80de2dc2601a26b788f8706bfdf5"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintHeader::fmt (cyclomatic 17): PrintHeader::fmt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c71e76f96dcfc7a5f568bbf02a992d9343d89421b0c1b8e9380aeefc35d408"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_inlay_hints::inlay_hints_of_references (cyclomatic 17): pgls_inlay_hints::inlay_hints_of_references has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_inlay_hints/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aaf78823eb49516dbab881b5ab14a0b7f3d4fbac9cf5517c9837de9103777a"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::extend_literal (cyclomatic 17): Lexer::extend_literal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/lexer.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fd3795c59c7e127ed3330449d48e0047fe33672ebe5e1cf160b700a5d16760"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_lexer::params::convert_to_positional_params_with_metadata (cyclomatic 17): pgls_lexer::params::convert_to_positional_params_with_metadata has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/params.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f229caeaf9570d4b7f3834aaff7427a78e51ecd0bd401e6d00d73e737d152f"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::do_stmt::emit_do_stmt (cyclomatic 17): pgls_pretty_print::nodes::do_stmt::emit_do_stmt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/do_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1db159b782927bf252fe20a0b9f4465a6a8c44c6d49a647b0f06018eb0efc9"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::func_call::emit_standard_function (cyclomatic 17): pgls_pretty_print::nodes::func_call::emit_standard_function has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fca6e8725d8f0c7f7b16d39229c9c6d2c299d6aae271948bdcd57b1b0547ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_object_agg::emit_json_object_agg (cyclomatic 17): pgls_pretty_print::nodes::json_object_agg::emit_json_object_agg has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_object_agg.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcddf851e955b669a9efd53807996a4a5901d81326156cadc60aed0e26db7c99"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::range_tbl_entry::format_label (cyclomatic 17): pgls_pretty_print::nodes::range_tbl_entry::format_label has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/range_tbl_entry.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c418256ffc88cd1f2dde809e1c4f1b205d3f34d238bf17e936109ea7e803f34"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_splinter::run_splinter (cyclomatic 17): pgls_splinter::run_splinter has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_splinter/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"488cb68e44eb4c26ca3e018ad7c3e21478dfb1f303931ed769c7349bd67679a4"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryResult::within_range (cyclomatic 17): QueryResult::within_range has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1f020bc22c77e831328506d645be9009407cb90f99e5d02d51e7d57bf71afa"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyser::analyse_until (cyclomatic 16): Analyser::analyse_until has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bee0527bd87ec34ff1394e91593b135721b8d41dfffff7073477afd2b63520a"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::alter_table_stmt::apply_inheritance_changes (cyclomatic 16): pgls_catalog::catalog::ddl::alter_table_stmt::apply_inheritance_changes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"84607c7d3d9f4ba10772bd4a57f466a9d8140e3ca119b7fbfde7cdff672fd331"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::comments::attach_comments (cyclomatic 16): pgls_pretty_print::comments::attach_comments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/comments.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e8b52f5b0e5429e8ace6d8147d0d5e3ac48da56476faeb61ad798eb0c1b752"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_subscription_stmt::emit_alter_subscription_stmt (cyclomatic 16): pgls_pretty_print::nodes::alter_subscription_stmt::emit_alter_subscription_stmt has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_subscription_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95c86be5f0464b285219d50d0eb03df80e16531b07750dd5634e648302cbca3"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::window_frame::emit_frame_bound (cyclomatic 16): pgls_pretty_print::nodes::clauses::window_frame::emit_frame_bound has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/window_frame.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"449cc33cf548cf62f563ad512bc616be5b4754e6807724835ad5e11e3a2d3915"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::fetch_stmt::emit_fetch_stmt (cyclomatic 16): pgls_pretty_print::nodes::fetch_stmt::emit_fetch_stmt has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/fetch_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4f463f49ffe1bb9db0d7aadf3d698a2e11de6f49b41e1cac1025532c5daba"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::into_clause::emit_into_clause (cyclomatic 16): pgls_pretty_print::nodes::into_clause::emit_into_clause has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/into_clause.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6523cf04a675b6efb9c24e8d02f355a4088b04ec40d7a76fe0525e46f70cf043"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_array_agg::emit_json_array_agg (cyclomatic 16): pgls_pretty_print::nodes::json_array_agg::emit_json_array_agg has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c6ff451ab600f57ab7544d865ac00ca298956223a00dfb2344580654859625"}},{"ruleId":"D1","level":"warning","message":{"text":"pgls_pretty_print::nodes::rename_stmt::emit_rename_stmt (cyclomatic 16): pgls_pretty_print::nodes::rename_stmt::emit_rename_stmt has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/rename_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57cc76d5de0f6219fa17355ef73444c82a89ad5a5d00119a39d34d367c85607"}},{"ruleId":"D1","level":"warning","message":{"text":"Suppression::matches (cyclomatic 16): Suppression::matches has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_suppressions/src/suppression.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb1d94e17e8aa2b52f3f71fadf53ccb39ded9df80d74af16b9f8c2d647118a"}},{"ruleId":"D1","level":"warning","message":{"text":"TreesitterContext::gather_context_from_node (cyclomatic 16): TreesitterContext::gather_context_from_node has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: TreesitterContext::get_wrapping_clause_from_current_node (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/context/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"072fb3ae6b670cdd2c17834b8f520271933a77ad4332f380ca5e3b217fee1361"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceServer::database_diagnostics (cyclomatic 16): WorkspaceServer::database_diagnostics has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9420e9c6880908c40f1ab07687402db0eb3b9676bdecd374d25d03d85558b8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of (cognitive 206): pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of has cognitive complexity 206 (threshold 15). Drivers by points: if/else 84 (191 pts), loops 3 (9 pts), boolean chains 5, match/switch 1 (nesting depth added 113). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb418c5d4cc8121fbfe337eb5ad4b7a1c52033bd9b4c1977c3e6ca1534d672c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::constraint::emit_constraint_of (cognitive 123): pgls_pretty_print::nodes::constraint::emit_constraint_of has cognitive complexity 123 (threshold 15). Drivers by points: if/else 54 (111 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/constraint.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8e603cadc015b0f010df44151124cf0dc0de66033b266d2109f4d765050030"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::select_stmt::emit_select_stmt (cognitive 117): pgls_pretty_print::nodes::select_stmt::emit_select_stmt has cognitive complexity 117 (threshold 15). Drivers by points: if/else 40 (91 pts), match/switch 7 (12 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc65794fd6ba69cc922a10b9b17f7993a6f320cf61e14bc9c3d0f08defe5382f"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::function_options::format_function_option (cognitive 111): pgls_pretty_print::nodes::clauses::function_options::format_function_option has cognitive complexity 111 (threshold 15). Drivers by points: if/else 46 (101 pts), match/switch 2 (5 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 60). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/function_options.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a924b3d235f6cb5f8f068a9f3bc1e07d8fe3efeae32b3a44bf0578d6c524de3"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::overload::select_candidate (cognitive 89): pgls_catalog::typing::overload::select_candidate has cognitive complexity 89 (threshold 15). Drivers by points: if/else 18 (44 pts), match/switch 9 (24 pts), loops 9 (16 pts), boolean chains 5 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cac22c9a9b8b774e7c83d60e2971192a835969a6bd73be4904eb3692049fca"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_stmt::emit_create_stmt (cognitive 89): pgls_pretty_print::nodes::create_stmt::emit_create_stmt has cognitive complexity 89 (threshold 15). Drivers by points: if/else 31 (62 pts), loops 6 (18 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c7c438d1b728b2e7530397bbb1e56ca8968838d73466ee034a9babf0919b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::expr::a_expr::infer_a_expr (cognitive 87): pgls_catalog::resolve::expr::a_expr::infer_a_expr has cognitive complexity 87 (threshold 15). Drivers by points: if/else 22 (54 pts), match/switch 8 (17 pts), loops 4 (14 pts), boolean chains 2 (nesting depth added 51). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/expr/a_expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c139bde15d2168eb20a9941cf11d34cb5873ca87729f10182fed75151b2488b4"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::workspace::server::formatting::format_document (cognitive 73): pgls_workspace::workspace::server::formatting::format_document has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (55 pts), match/switch 3 (9 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/formatting.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc55bb20596cac8d95b256179ebeee69f461371c27f6543cbea9a25a8c1f88"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_role_stmt::format_role_option (cognitive 72): pgls_pretty_print::nodes::create_role_stmt::format_role_option has cognitive complexity 72 (threshold 15). Drivers by points: if/else 33 (64 pts), boolean chains 7, match/switch 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":"crates/pgls_pretty_print/src/nodes/create_role_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aa8c572b7b09dfe80bf52895a53e0df340622ea3f31c9359fb96de6b5a2011"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_diagnostics::display::frame::print_frame (cognitive 71): pgls_diagnostics::display::frame::print_frame has cognitive complexity 71 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 8 (26 pts), match/switch 8 (14 pts), boolean chains 4 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1e5640974fe852b6b7fac27ba3889480560bacb1ad57d6dd34bea3542b4f45"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::unify::check_generic_type_consistency (cognitive 70): pgls_catalog::typing::unify::check_generic_type_consistency has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 11 (33 pts), boolean chains 2, loops 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"344f51805b40632739880e01b6255331bfed3d573fc0ba50eff37d0fc3bb2824"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt (cognitive 70): pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt has cognitive complexity 70 (threshold 15). Drivers by points: if/else 38 (70 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":"crates/pgls_pretty_print/src/nodes/comment_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fda801e21ff36b15d872acd8be715a60e1f3d930b45d1543544a3da749a86d"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::normalize::clear_location (cognitive 70): pgls_pretty_print::normalize::clear_location has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 5 (9 pts), boolean chains 6, match/switch 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/normalize.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f85705c952b7ff9b02acc576afa4f05e0e7c30ec299ed34ca0ec928976e9472"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::a_expr::emit_aexpr_op (cognitive 66): pgls_pretty_print::nodes::a_expr::emit_aexpr_op has cognitive complexity 66 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 2, match/switch 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7de9867503ea1d617fb2f490503c899133ba1339ca3548b97c3f3d1536688e"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_markup::markup (cognitive 65): pgls_markup::markup has cognitive complexity 65 (threshold 15). Drivers by points: match/switch 9 (37 pts), if/else 6 (21 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 46). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_markup/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d60392a0eefbbbc82417bfe09217936bac781d9cba90679b7e1e2f553637e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::options::emit_role_option (cognitive 62): pgls_pretty_print::nodes::clauses::options::emit_role_option has cognitive complexity 62 (threshold 15). Drivers by points: if/else 35 (61 pts), match/switch 1 (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":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eca56382b84662aca62acc51bbd94aa92f23773f822adab14b5b591e6d1a62"}},{"ruleId":"D2","level":"warning","message":{"text":"DeriveStructInput::parse (cognitive 60): DeriveStructInput::parse has cognitive complexity 60 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 5 (19 pts), loops 5 (12 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics_macros/src/parse.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"882fecdeb9b4e814c7dcbe2953bcba6bf854b496e2d5aa62c9c361836f9c278a"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_walk::walk::walk_statements (cognitive 60): pgls_walk::walk::walk_statements has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 5 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/walk.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ba14977f26629005234448e7b08482db20d275580a5ec15d330913205361ce"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::unify::resolve_polymorphic_result (cognitive 58): pgls_catalog::typing::unify::resolve_polymorphic_result has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 11 (22 pts), boolean chains 2, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aabd2742dc4bfdf00206f1ab033da943b3d7c8136f1d1b0e8c7c38330a7457c"}},{"ruleId":"D2","level":"warning","message":{"text":"docs_codegen::rules_docs::write_documentation (cognitive 53): docs_codegen::rules_docs::write_documentation has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (43 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbed59d906228651aa94f6364ec08d7b004464bd70b80b2d5342f391f0c92f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::index_stmt::index_columns (cognitive 50): pgls_catalog::catalog::ddl::index_stmt::index_columns has cognitive complexity 50 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 4 (15 pts), loops 4 (8 pts), boolean chains 3 (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":"crates/pgls_catalog/src/catalog/ddl/index_stmt.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e679ad7c615efe4d8391983eb5b9925d78bd3eb931363c00f815739a62b38107"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_expr::emit_json_expr (cognitive 49): pgls_pretty_print::nodes::json_expr::emit_json_expr has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (40 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed0274aaf64c4dec230307d1bf7754cc530eb1e02479b1d834d43dcaabb6493"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner (cognitive 48): pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (40 pts), loops 2 (6 pts), match/switch 1 (2 pts) (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":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7c23520bdbaf3a836ce9c9a90ac756c81759ee7aa1ce9eb30a7718d5edb0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsPrinter::run (cognitive 46): DiagnosticsPrinter::run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 3 (12 pts), loops 3 (9 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/execute/walk.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d238b74991c536ed7f34404ed4fe1480d245cbe66c2459fef7de196952fc5c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::drop_stmt::apply_drop_stmt (cognitive 44): pgls_catalog::catalog::ddl::drop_stmt::apply_drop_stmt has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/drop_stmt.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5169b1f932b777c37346c590ca55ece93a852dd9c996479dd096258e63cb37c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt (cognitive 42): pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (35 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8c27bf9866ebfc9951d5cb98aa217f0643c1f3aeeb0e1378370fccee4a7379"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::define_stmt::emit_collation_definition (cognitive 42): pgls_pretty_print::nodes::define_stmt::emit_collation_definition has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/define_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d85c87cc1a1a1589f4b39f0a182555fb5fbcd05b4f7b6d4a74303f7e508d33"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_statement_splitter::split_region (cognitive 42): pgls_statement_splitter::split_region has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 9, loops 6 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"af19b4bab9ad1da69efab00006b9eacf5b2e1bfd780c1bb9b9be0b3d58d75d07"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::create_stmt::create_table (cognitive 41): pgls_catalog::catalog::ddl::create_stmt::create_table has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 6 (11 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_stmt.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0168c83e6f9717288684f0622b207eb1528d19c65f12121380035a5760293303"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_semantic_tokens::semantic_tokens_of_references (cognitive 40): pgls_semantic_tokens::semantic_tokens_of_references has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 4 (12 pts), loops 2 (4 pts), boolean chains 1 (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":"crates/pgls_semantic_tokens/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"abba241157e1170e11f6dba976066c58fd23f2b399acd9340e1b07df475e3cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::overload::candidates::expand_candidates (cognitive 39): pgls_catalog::typing::overload::candidates::expand_candidates has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 8, 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":"crates/pgls_catalog/src/typing/overload/candidates.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2f57141a8ba6ce0353000cac35b6ce21d07561edf5057ec381c428226d0660"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionFilter::valid_keyword (cognitive 39): CompletionFilter::valid_keyword has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 2 (4 pts), boolean chains 3 (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":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"196741e2194157a2b4034be87c0e3af75777cfc85dc2e5153f748bc8f4d032f1"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::do_stmt::emit_do_stmt (cognitive 39): pgls_pretty_print::nodes::do_stmt::emit_do_stmt has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 3 (6 pts), 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":"crates/pgls_pretty_print/src/nodes/do_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106c7c9b4fc8d0347897ffe269901f47f1f3b536ea704c1bdf3b0bfad3de902"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::join_expr::emit_join_expr (cognitive 39): pgls_pretty_print::nodes::join_expr::emit_join_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/join_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7695724bcbb1421e8ba7fb9dfe1629c2f4042941181972249367f7a356fe715a"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_diagnostics::display::diff::print_full_diff (cognitive 37): pgls_diagnostics::display::diff::print_full_diff has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (9 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/diff.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd40a0e3fa258955f7a4b1b9a85d164700e6790a8966eeb640537e3fddef657"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::variable_set_stmt::emit_transaction_option (cognitive 37): pgls_pretty_print::nodes::variable_set_stmt::emit_transaction_option has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce0f8490f42cbdd9b50bee91a309c7b6c7843611f4b55f197c0ab9eefed33cd"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::xml_expr::emit_xml_expr (cognitive 37): pgls_pretty_print::nodes::xml_expr::emit_xml_expr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/xml_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd88f394b7f3cbe2fec031128565d0c2679c88ff7937b8823c7201da753b2a69"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::sub_link::emit_sub_link (cognitive 36): pgls_pretty_print::nodes::sub_link::emit_sub_link has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/sub_link.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9774ffe4736401be355e715f80942e4d77e3f8a94f7b5497b3ef1f03facd7328"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_statement_splitter::splitter::common::unknown (cognitive 36): pgls_statement_splitter::splitter::common::unknown has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 3 (8 pts), loops 1 (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":"crates/pgls_statement_splitter/src/splitter/common.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71f4b08803c5cb7db6e50ed48a1ae50c02c789c16f9c2a2291d646e91648bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt (cognitive 35): pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, match/switch 4 (5 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"44375b87e140e5e0e63df73eac2e11a8bd52b1eb7084fa94ae0a7b43d22e54cd"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::func_call::emit_standard_function (cognitive 34): pgls_pretty_print::nodes::func_call::emit_standard_function has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 5, loops 1 (4 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"8734ee20fda1545b75b469184ca106906738de4ca4b9b5cec01466802c3a6bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog::snapshot (cognitive 33): Catalog::snapshot has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 8 (10 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/materialize.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9e8e1313e75e953bc6a227d7d4424364b261c91366935609a6c5bbf716dcda"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::advance_token (cognitive 33): Cursor::advance_token has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 7 (10 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_tokenizer/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd385c8b4788955a44720aa194c0310c040fa4b7b806eb5c020d87990e4b9594"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogBase::new (cognitive 32): CatalogBase::new has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 8 (9 pts), match/switch 6 (9 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/base.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"79927dfce3907112e4bba58f1570dc91fd5bce879a374b14084834f74c97d5aa"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::options::emit_sequence_option (cognitive 32): pgls_pretty_print::nodes::clauses::options::emit_sequence_option has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89408b7000a18d35448c45122c382c1f29281306f7bf47f227ddfebe0b77843"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_diagnostics::display::frame::print_invisibles (cognitive 31): pgls_diagnostics::display::frame::print_invisibles has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 7, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce065fa71eec2ca2151272aaba96dd78a241be4111b27beeaeeb8328921f2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_publication_stmt::emit_create_publication_stmt (cognitive 31): pgls_pretty_print::nodes::create_publication_stmt::emit_create_publication_stmt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_publication_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"37547e24f1039da528fa64d6dab6bd57645fc5cc949b06f40aa268250bfabe3a"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::insert_stmt::resolve_insert (cognitive 30): pgls_catalog::resolve::nodes::insert_stmt::resolve_insert has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/insert_stmt.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"358aa4b2fd82dbadd8ca10a8b177e42621edb5f305dd727b932b52439b5e277b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::unify::select_common_type (cognitive 30): pgls_catalog::typing::unify::select_common_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (10 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c38a62c7071c53b72d468ebd751ece07f47086e0d0d2adacf63702c8739bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_diagnostics::display::backtrace::print_backtrace (cognitive 30): pgls_diagnostics::display::backtrace::print_backtrace has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/backtrace.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b96d6de16c92d46507a6e77d347b32e57c924f5e13769c185375a5ef0c0c8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_plpgsql_check::diagnostics::find_text_outside_strings (cognitive 30): pgls_plpgsql_check::diagnostics::find_text_outside_strings has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 5, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_plpgsql_check/src/diagnostics.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2c8fc2b3acbbf2e0e7426507eff3c8eaa5d6cf119bed46fd3d5b73427052b5"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt (cognitive 30): pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (22 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0315691f69f71095d631b85c2dcb218e939a0fd4f81be4463fec641d9d1f028"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::range_table_func::emit_range_table_func (cognitive 30): pgls_pretty_print::nodes::range_table_func::emit_range_table_func has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (30 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/range_table_func.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5749138d28cb793923e2e382ac565fdaf7a27e0a6d91f89279b8fff2c05ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionFilter::check_clause (cognitive 29): CompletionFilter::check_clause has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 16, match/switch 6 (11 pts), if/else 2 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"150b536df441428f12a301f5fc9fece87684abbca310890ea32307e6156ace6b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::range_function::emit_range_function (cognitive 29): pgls_pretty_print::nodes::range_function::emit_range_function has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (29 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/range_function.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"272dd45de559f7f24ea62d53d4579056493a4268ca237e4c1a3667412cd5a065"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_typecheck::diagnostics::create_type_error (cognitive 29): pgls_typecheck::diagnostics::create_type_error has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26 (27 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_typecheck/src/diagnostics.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cef0eab214b755248cee46733bbae411a47248fdad6e12e8757e1a175823a6"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintHeader::fmt (cognitive 28): PrintHeader::fmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (27 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1da6fa451f0f27d63307045855fa0e9a875a8f97374c81c059a4ef7d4c63d11"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_inlay_hints::inlay_hints_of_references (cognitive 28): pgls_inlay_hints::inlay_hints_of_references has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_inlay_hints/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"66efe42b55e57884cc408c076839f5ce95e967592d761f7efd696b2897ed6792"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_extension_stmt::emit_alter_extension_stmt (cognitive 28): pgls_pretty_print::nodes::alter_extension_stmt::emit_alter_extension_stmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_extension_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21f74d70a4246bece30fb330c99dacf2250072baef0f411c866dd083cf96707"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::configuration::layers::apply_override (cognitive 28): pgls_workspace::configuration::layers::apply_override has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (26 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":"crates/pgls_workspace/src/configuration/layers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c1bf1226349cee074d036999052ae6a4184e62f3f55f885554dbea5fcf709"}},{"ruleId":"D2","level":"warning","message":{"text":"docs_codegen::schema::rename_partial_references_in_schema (cognitive 28): docs_codegen::schema::rename_partial_references_in_schema has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/codegen/src/schema.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a56ace296ce7bd7ce25e4d9dad0686934d90a37fd7578e443a999bd99d04aa"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::range_function::typed_return_columns (cognitive 27): pgls_catalog::resolve::nodes::range_function::typed_return_columns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (12 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/range_function.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"573b5f2f7f94b050d2b3063fcaa538384f7387fc0d61a524d6ab315cb13d681b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::overload::function::select_function (cognitive 27): pgls_catalog::typing::overload::function::select_function has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/function.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d0defe3bfb89d2c227999bb48739fcfaffa48a0a72c5720bb87fa0177cc710"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintAdvices::record_table (cognitive 27): PrintAdvices::record_table has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e3ee0962d39f46e74c516a456eb1d6d231709919590a25ac3d59068a0e78d3"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_default_privileges_stmt::emit_alter_default_privileges_stmt (cognitive 27): pgls_pretty_print::nodes::alter_default_privileges_stmt::emit_alter_default_privileges_stmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 1 (3 pts), 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":"crates/pgls_pretty_print/src/nodes/alter_default_privileges_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b032fbeb51bcc31164bc455705137f36d308485803f18468916840b77c7f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::window_frame::emit_frame_bound (cognitive 27): pgls_pretty_print::nodes::clauses::window_frame::emit_frame_bound has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/window_frame.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89d802c1eb1961e034365b4cd24d06a08ee9b0666daa4e8b2553f8edfc9a3dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::apply_variable_set (cognitive 26): Settings::apply_variable_set has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/settings.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"31862a78a2a6c4c3ec87b788fcb83a4c9ef69bf3e0c6f354be5b381c4b167c44"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::alter_table_stmt::apply_inheritance_changes (cognitive 26): pgls_catalog::catalog::ddl::alter_table_stmt::apply_inheritance_changes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda94e7b85623fc7c2abb7e7fc35a91881d9f49598673ec377dd51c434a9e09c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::select_stmt::resolve_select (cognitive 26): pgls_catalog::resolve::nodes::select_stmt::resolve_select has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 7 (9 pts), boolean chains 3, match/switch 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":"crates/pgls_catalog/src/resolve/nodes/select_stmt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c778c63007ed74300e79f13fd662645f1f71125cf00e5612e94a0ea676568346"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_splinter::run_splinter (cognitive 26): pgls_splinter::run_splinter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_splinter/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a170d1a9b593284633d98f0a2e1949c702b6aa431a0ae9410fe6cc1df4570e"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_lexer::params::convert_to_positional_params_with_metadata (cognitive 25): pgls_lexer::params::convert_to_positional_params_with_metadata has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/params.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d95b29f108f63eb8e83e8cd83c843ec3093138d2e6ed66803d997a2bf91667"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt (cognitive 25): pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22 (25 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40526df16e7c0ef6f6b3336fe9d413adf9db7d41be2ad5d98f2dd821700409a"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog::drop_column_indexes (cognitive 24): Catalog::drop_column_indexes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (8 pts), match/switch 1 (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":"crates/pgls_catalog/src/catalog/overlay.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec23f2404ed5f1bcff6cd5569d80e3e2d2d3648ad99f568e27d759ab760131be"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::column_ref::resolve_qualified_column (cognitive 24): pgls_catalog::resolve::nodes::column_ref::resolve_qualified_column has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, match/switch 1 (3 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":"crates/pgls_catalog/src/resolve/nodes/column_ref.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9733844283ddfa25cb0d28e149842531795b0132433e7ff9a938806df2665838"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::insert_stmt::check_generated_insert (cognitive 24): pgls_catalog::resolve::nodes::insert_stmt::check_generated_insert has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 7 (10 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/insert_stmt.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e686124953e5a8982e5b8b0961e9cd19fa5db3507826e626ad86b05954ca383"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::range_function::resolve_range_function (cognitive 24): pgls_catalog::resolve::nodes::range_function::resolve_range_function has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/range_function.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"261cdb26afee803d129d59ede4b6c51202e45b1af6c64ee7967dc8452eb632a6"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_migrations::goose::envsub::substitute (cognitive 24): pgls_migrations::goose::envsub::substitute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_migrations/src/goose/envsub.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b32c5a26b3125a4e634e109b7226e8fad36cb794f6eeac925bef9c528a8128"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::bool_expr::emit_variadic_operands (cognitive 24): pgls_pretty_print::nodes::bool_expr::emit_variadic_operands has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/bool_expr.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7d5ec377f845bf3b078152776d0dcc1647e7b1aa5a8af0579ffc9d099ed354"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::workspace_types::generate_type (cognitive 24): pgls_workspace::workspace_types::generate_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace_types.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"071d01d2446776af82fa3a171ec95f55bc21a299becfbf94f0773e0a42333f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::alter_table_stmt::apply_index_changes (cognitive 23): pgls_catalog::catalog::ddl::alter_table_stmt::apply_index_changes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb47803408c3573dd016bd68806257f16bbc2eb9d10bd7f70e7a5c0b8bd666c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_change (cognitive 23): pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_change has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"de26ae1d0270bbfe6fcf66483fd30b3706a628ea041e34cdcc1e6231b70f793d"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::column_name::step (cognitive 23): pgls_catalog::resolve::column_name::step has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 12 (23 pts) (nesting depth added 11). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/column_name.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7c38319ac88699de7d731dfd02f52d51d7e4e0924cce811d512aa9fe1bcfcb"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_event_trig_stmt::emit_create_event_trig_stmt (cognitive 23): pgls_pretty_print::nodes::create_event_trig_stmt::emit_create_event_trig_stmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_event_trig_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc165ba374e5cb94f1431afc813e06be83e3ddbb5b954bbf9bd48b9b4dd22233"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_function_stmt::emit_create_function_stmt (cognitive 23): pgls_pretty_print::nodes::create_function_stmt::emit_create_function_stmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_function_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"850c4a41edbe698c8c7fd75c3fa39910f840955a2011cb13083b2ad9483b0b27"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_table_column::emit_json_table_column (cognitive 23): pgls_pretty_print::nodes::json_table_column::emit_json_table_column has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_table_column.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8234f19655c611b5fa1afb776118794410bb352408fdb32f5186c8bc716c620e"}},{"ruleId":"D2","level":"warning","message":{"text":"SanitizeAdapter::write_str (cognitive 22): SanitizeAdapter::write_str has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_console/src/write/termcolor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6786f7f61c3b68723e1584a54fa4ae458cf6cf1989ea1050fc5891b9c495f4"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_plpgsql_check::check_plpgsql (cognitive 22): pgls_plpgsql_check::check_plpgsql has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_plpgsql_check/src/lib.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"615254f716197db71ffc18dca53b9aabe08783f0c8f73b5c7eedc562119468f1"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_role_stmt::emit_alter_role_stmt (cognitive 22): pgls_pretty_print::nodes::alter_role_stmt::emit_alter_role_stmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (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":"crates/pgls_pretty_print/src/nodes/alter_role_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"811bf6eced656b3d479c2bf4e2814934628c9c3c14611c12f3e6906724db273d"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::func_call::emit_sql_syntax_call (cognitive 22): pgls_pretty_print::nodes::func_call::emit_sql_syntax_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"479c8c843fffeee665b61377bb138a8c3e1033b6cca2ad9f16a2c1cf4da43fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::into_clause::emit_into_clause (cognitive 22): pgls_pretty_print::nodes::into_clause::emit_into_clause has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/into_clause.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"52acca528a1268e5626447f32f83016d97116283dbfddacb06e6a52cb173e173"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_object_agg::emit_json_object_agg (cognitive 22): pgls_pretty_print::nodes::json_object_agg::emit_json_object_agg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_object_agg.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6628bc4f01cb0ce450f39e2b32a3c572c754773347d8bb740b8ae8aeb3482f13"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::func_call::resolve_func_call (cognitive 21): pgls_catalog::resolve::nodes::func_call::resolve_func_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (2 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":"crates/pgls_catalog/src/resolve/nodes/func_call.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc0e65831e3434c29ef90bfd57e044b49fcf830f48338614cebf2f1777cf9d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystem::auto_search (cognitive 21): FileSystem::auto_search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f68dd4e776dbaf6de7db523deb3ce9199c62fbd650bf2a6317108aae7fd1aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_fdw_stmt::emit_alter_fdw_stmt (cognitive 21): pgls_pretty_print::nodes::alter_fdw_stmt::emit_alter_fdw_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_fdw_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfab9109ed8e655bd71b2df56358838dd81a3f0e90cd38487a56321300ba101"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::define_stmt::emit_define_stmt (cognitive 21): pgls_pretty_print::nodes::define_stmt::emit_define_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/define_stmt.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b42633ff3cf28306f6a83a7de5250d517fcb8ae77ce132593eb2742c538f17"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::grant_role_stmt::emit_grant_role_stmt (cognitive 21): pgls_pretty_print::nodes::grant_role_stmt::emit_grant_role_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c0648b7bfc93941e47a16f8d592cacc9127def14619c4c4788ae8c7278f57e"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_array_agg::emit_json_array_agg (cognitive 21): pgls_pretty_print::nodes::json_array_agg::emit_json_array_agg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f6d7201a37cdcb863ce7b30b05acb8929d244078ca5d2b244215b82ab9bd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::object_with_args::emit_object_with_args_as (cognitive 21): pgls_pretty_print::nodes::object_with_args::emit_object_with_args_as has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/object_with_args.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e27fb160093f6137c4ff4657520e1642c31db80eb557889088993fc04f986f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::number (cognitive 21): Cursor::number has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_tokenizer/src/lib.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f7441f665806e48df6dc7c78d03061ae2527280f67e3a115fb9ca147c40ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::dollar_quoted_string (cognitive 21): Cursor::dollar_quoted_string has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_tokenizer/src/lib.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc10301145e0acb84cffe8e3b0333800bc0fc3a257adfa2f3faf39aea5b15c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Locks::apply (cognitive 20): Locks::apply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/locks.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfd06d5081cc79e7f7717849cd182c8d96c78502a7ec7edc72322a08c8c649b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::rename_stmt::apply_rename_stmt (cognitive 20): pgls_catalog::catalog::ddl::rename_stmt::apply_rename_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/rename_stmt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a08d299d5e7d91cc8701a5662e990b6dd8a3240131000f81a35962ff847197"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::typing::coerce::can_coerce (cognitive 20): pgls_catalog::typing::coerce::can_coerce has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 6 (7 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/coerce.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"515e6fac36f4d7c605f2aa603a65058216cdc7afd60fd25faf48aed6d7651e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_completions::sanitization::cursor_between_parentheses (cognitive 20): pgls_completions::sanitization::cursor_between_parentheses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/sanitization.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ea805d3c3b79de61ce1e3df786f31f39444df2a5dfb5176b8f8f762f1284a5"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::comments::attach_comments (cognitive 20): pgls_pretty_print::comments::attach_comments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, match/switch 3 (5 pts), 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":"crates/pgls_pretty_print/src/comments.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2522f815f86bd303797b147193556fa40eb4d34942e1df3d49e1395bfd74ee"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::create_fdw_stmt::emit_create_fdw_stmt (cognitive 20): pgls_pretty_print::nodes::create_fdw_stmt::emit_create_fdw_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_fdw_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ddb68babb74f238c1ea148e128702190e8f2a4615fc80145a26480d15a5d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause (cognitive 20): pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/merge_when_clause.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5848a5afb9714398eac0b5fb71e3a41daf6f0e7891d02ed9364a32e62711b170"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_configuration::generate_lint_mod_file (cognitive 20): xtask_codegen::generate_configuration::generate_lint_mod_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2993ff13f1428d4437c4ddf4f430234be53389686e571779390312ec1648925"}},{"ruleId":"D2","level":"warning","message":{"text":"rules_check::assert_lint (cognitive 20): rules_check::assert_lint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (9 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7470a62d77780ff3cc02a56103eee5f1374c5b8267797129424a1622633dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_analyser::lint::correctness::identifier_too_long::unicode_identifier_value (cognitive 19): pgls_analyser::lint::correctness::identifier_too_long::unicode_identifier_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/correctness/identifier_too_long.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe36bceac0ca5e423eb6108cc86ca2cd7915ce5cb18413d62688d68d69b0adf"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_changes (cognitive 19): pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_changes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd690611725499fa1d2766570c299706c8557d130200bd2a72bbf7b0556903"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::expr::a_indirection::infer_a_indirection (cognitive 19): pgls_catalog::resolve::expr::a_indirection::infer_a_indirection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/expr/a_indirection.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f21e9214c4fa329a22af4baa43a9930215e58211700f45aa8de8575aa2ff1ea"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::roles_and_schemas::record_roles_and_schemas (cognitive 19): pgls_catalog::resolve::roles_and_schemas::record_roles_and_schemas has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/roles_and_schemas.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d933620ea33e919e31f520131ca0e515185de72dd4f06bd214d0d22b133c85"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::roles_and_schemas::record_schema_names (cognitive 19): pgls_catalog::resolve::roles_and_schemas::record_schema_names has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/roles_and_schemas.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bfa8d4ecf76a92c119096d02012790d0815e5071152783ea597922028f3d91"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::scope::find_column_type (cognitive 19): pgls_catalog::resolve::scope::find_column_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/scope.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"83576d0ca5840b855ca3c2343ecc0ee8c3145cdf97944b02777544a6fe24dc14"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_cli::commands::daemon::start_lsp_proxy (cognitive 19): pgls_cli::commands::daemon::start_lsp_proxy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/commands/daemon.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7a9580655eac5058089fa1d2d507eded8802add3c2c97ef6646ba9cac54c52"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_cli::service::read_task (cognitive 19): pgls_cli::service::read_task has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f1a30e5e12f35a6e4a88087879069e7474afa532a1c628143d942dd39b90bf"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionFilter::completable_context (cognitive 19): CompletionFilter::completable_context has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 7, match/switch 2 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"825057fd23e6592c4202c8041315d4ccb1f061a663f2d33cc15d2fe29785fff2"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::extend_literal (cognitive 19): Lexer::extend_literal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/lexer.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aa1b4f36d773eba01b3c352eec8b7b1aa3f7e292b4258a7c576c8d2aab2baf"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pglinter::run_pglinter (cognitive 19): pgls_pglinter::run_pglinter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pglinter/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35fcde0e459aa15079b99982c754ca133baa9c39740082b6a7518e510841342"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::clauses::set_clause::emit_multi_assign_clause (cognitive 19): pgls_pretty_print::nodes::clauses::set_clause::emit_multi_assign_clause has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/set_clause.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"89191d9a3ab0de3e57f057c99634c81bb9bdd32774e9ad3f1c8237428cfe7e38"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::explain_stmt::emit_explain_option (cognitive 19): pgls_pretty_print::nodes::explain_stmt::emit_explain_option has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (4 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/explain_stmt.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7db2252fb52b5d096de7ed1dd8c8dad3b2853215cc3dc5fb5dbec4c853d2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServer::database_diagnostics (cognitive 19): WorkspaceServer::database_diagnostics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"23429921226e72e19076a988668088ef4b1c018401fa4b9cddbd9fe78bc301e4"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::features::code_actions::lint::fix_file (cognitive 19): pgls_workspace::features::code_actions::lint::fix_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/features/code_actions/lint.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c385c1eaa64030f6e518bf559dc1bb55cb5689be6fe19e8055a1184e9ad06ded"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyser::analyse_until (cognitive 18): Analyser::analyse_until has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (7 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d596a45f7b07f79d3da1b642b7db844e481199eb93e9173863fc561d7db90fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog::move_relation (cognitive 18): Catalog::move_relation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/overlay.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a93a6705870b39e9e9bceba0d98b0005239c76de71b59b8a55f4a80ac9820c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::scope::find_column_item (cognitive 18): pgls_catalog::resolve::scope::find_column_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/scope.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01ed874644372a34ff73d2382539f9e3db4ab26b3d809f82392d055dd3c81c1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionScore::check_matching_clause_type (cognitive 18): CompletionScore::check_matching_clause_type has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 2 (4 pts) (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":"crates/pgls_completions/src/relevance/scoring.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a814537222e8379b8beeb033a64d3577f2483d2fc1200f4cfcdec692c67a8337"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_diagnostics::display::diff::process_diff_ops (cognitive 18): pgls_diagnostics::display::diff::process_diff_ops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/diff.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"323635d5cd327beb9061e8b6dce354bdce70364a6853e9b97a1db6dab7c88808"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_fs::fs::os::handle_any_file (cognitive 18): pgls_fs::fs::os::handle_any_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/os.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"204b2e43152a9f755500e37966465dd3cc2fbcf01ffff1ad4e2749bf2e29a7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::single_line_if_fits (cognitive 18): Renderer::single_line_if_fits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/renderer.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c60ab75e3920c9b0951ed3261af6c3e028a30146c607fe40743712848872deb"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_func_expr::emit_json_func_expr (cognitive 18): pgls_pretty_print::nodes::json_func_expr::emit_json_func_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_func_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66cad8255a2a526a6082bb5fc7a45ad91b7ae333a420046ffc9ff413816371a"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_query_ext::function_body::atomic_body (cognitive 18): pgls_query_ext::function_body::atomic_body has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_ext/src/function_body.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b38d85cfd4e7f6afe0ca343c6326d2c08e264b45e9f061e1bbe2a61aee68a6"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSettings::from (cognitive 18): DatabaseSettings::from has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/settings.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"e234b91426f0c1078c5f8735199f46a8e0bf5d0fe2dd70717e7171cf84ee45be"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServer::check_database_connection (cognitive 18): WorkspaceServer::check_database_connection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"840d52838e222fff65e7dec71676a6c43d7182472898cfc35c3fe5953b2387f1"}},{"ruleId":"D2","level":"warning","message":{"text":"docs_codegen::schema::rename_partial_references_in_schema_object (cognitive 18): docs_codegen::schema::rename_partial_references_in_schema_object has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/codegen/src/schema.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf19dffb0c7019b4bf76a0897e7c815ed02a75fc4c432ddcfd2907fe99412e6"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_analyser::lint::correctness::identifier_too_long::may_contain_long_identifier (cognitive 17): pgls_analyser::lint::correctness::identifier_too_long::may_contain_long_identifier has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/correctness/identifier_too_long.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a6a449ab63c1d0e68964cbd105a602e17416f305505b7adecdc1ab18225ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::scope::find_column (cognitive 17): pgls_catalog::resolve::scope::find_column has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (4 pts), loops 2 (3 pts), boolean chains 2 (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":"crates/pgls_catalog/src/resolve/scope.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"418640a69e8c7ba8e51d32a7c165f49f2de6f115236afe3829f81ccb251b7242"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionScore::check_matches_query_input (cognitive 17): CompletionScore::check_matches_query_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 6 (7 pts), boolean chains 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/scoring.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"af190dbf7b78fdbb63d2e0494c0e73fe0574ae47848a37f8ecf04513b50141e5"}},{"ruleId":"D2","level":"warning","message":{"text":"SanitizedCompletionParams::with_adjusted_sql (cognitive 17): SanitizedCompletionParams::with_adjusted_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/sanitization.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"85768ff2eddc6985257c130766d7e11b83d7f7e7e76bd13c9104fb426cbf536b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeriveInput::parse (cognitive 17): DeriveInput::parse has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration_macros/src/partial_derive/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfbc84127eab4675bc486f8eb81ba76bcd89f0131d72737b0782f68df6ba609"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_diagnostics::display::diff::process_diff_lines (cognitive 17): pgls_diagnostics::display::diff::process_diff_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/diff.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bf673797ad5ebfdf887247503fad3607586c015f78dab425d7f89c123bb9db"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_object_schema_stmt::emit_alter_object_schema_stmt (cognitive 17): pgls_pretty_print::nodes::alter_object_schema_stmt::emit_alter_object_schema_stmt has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (8 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_object_schema_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6c9c80a065322a6b66e86205e5567cd79ed6b0b00affe5a80b8ef6e4d50cd"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::drop_stmt::emit_drop_stmt (cognitive 17): pgls_pretty_print::nodes::drop_stmt::emit_drop_stmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/drop_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a472e3a47960c9425c9b31b9097311794ef7ba102f2c10967738f750eb47b1bd"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::transaction_stmt::emit_transaction_stmt (cognitive 17): pgls_pretty_print::nodes::transaction_stmt::emit_transaction_stmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/transaction_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f09452081734efb0eeff032edc2dc45c5ea99c4c1f032a64466b194f897558b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::configuration::find_nested_configurations (cognitive 17): pgls_workspace::configuration::find_nested_configurations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/configuration.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0960f6c0037a405594a14853a5e3fd3a70fa00fa775796ac0cf0e42dd75584e8"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::features::code_actions::execute_statement::execution::collect_result (cognitive 17): pgls_workspace::features::code_actions::execute_statement::execution::collect_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/features/code_actions/execute_statement/execution.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b1719d1a1b4f4865c8d7e0e53db0374b2f54642089e11301a9e6d970de4775"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::features::code_actions::expand_star::is_at_star_in (cognitive 17): pgls_workspace::features::code_actions::expand_star::is_at_star_in has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/features/code_actions/expand_star.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"159ba7b67280d041f610ebc9f0e62b2293386390c2544c65a87496180d6a2446"}},{"ruleId":"D2","level":"warning","message":{"text":"Role::hover_body (cognitive 16): Role::hover_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 3 (6 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_hover/src/hoverables/role.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ced7e025e7f37ac3eed6d6568bd5ee7e98daa91ea1919dd02bec1dcc106fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::create_function_stmt::compare (cognitive 16): pgls_catalog::resolve::nodes::create_function_stmt::compare has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (4 pts), loops 1 (2 pts) (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":"crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d138744c76858e87bcd43d55cfbe9e58227157a230e129b7112ede5b59fd5634"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::create_function_stmt::declared_type (cognitive 16): pgls_catalog::resolve::nodes::create_function_stmt::declared_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 3 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8377a1be0a1e94f2838d654d8a5a1e88ab2052136e6c41aaae2a4b87d084f6"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_catalog::resolve::nodes::with_clause::resolve_with_clause (cognitive 16): pgls_catalog::resolve::nodes::with_clause::resolve_with_clause has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/with_clause.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff7ab476ffadf3a03b73e1a0446ae13f2a15645177fa455f56b6e283f2b78e1"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryTraversalScope::evaluate (cognitive 16): MemoryTraversalScope::evaluate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/memory.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d885fc0e8096969c2c99ee71d5566fd8252001b0510e2d6b3d55ce9086047d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_fs::path::normalize_path (cognitive 16): pgls_fs::path::normalize_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/path.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cbfc5a5938bc69e82bbfcb8412e8f42895b569086cdf89318648c67741a12b"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::comments::keywords_after_comments (cognitive 16): pgls_pretty_print::comments::keywords_after_comments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/comments.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0027b9c2d1c5648adbff6ca81985fa46036c193c5b29c2985ee931e6af4b9ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_domain_stmt::emit_alter_domain_stmt (cognitive 16): pgls_pretty_print::nodes::alter_domain_stmt::emit_alter_domain_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6110c341aeffd99aa1a8e8fd7ffcdf2193ecdbb723d0c4f8f5da6efdf7608f"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::alter_owner_stmt::emit_alter_owner_stmt (cognitive 16): pgls_pretty_print::nodes::alter_owner_stmt::emit_alter_owner_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_owner_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd794108e891e3f538fdcffcce22dbb1bb906a36e1bcc83a86bfae6e356c7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::define_stmt::emit_aggregate_args (cognitive 16): pgls_pretty_print::nodes::define_stmt::emit_aggregate_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/define_stmt.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"713b34cd1f823ab25143343348196800b8681a5d55c3aeda6b94d2b0ad7a88bb"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::fetch_stmt::emit_fetch_stmt (cognitive 16): pgls_pretty_print::nodes::fetch_stmt::emit_fetch_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/fetch_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8122e82bc78634f0078f5ec03295318258cdda5ba1a904bacac43de9f1deef"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::json_constructor_expr::emit_json_constructor_expr (cognitive 16): pgls_pretty_print::nodes::json_constructor_expr::emit_json_constructor_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_constructor_expr.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2657fe444aed10554c2c88a8df84b6fc6cc52b2a09ed88c736ecde1834d32c"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_pretty_print::nodes::res_target::emit_res_target (cognitive 16): pgls_pretty_print::nodes::res_target::emit_res_target has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/res_target.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e904b33ce9970a6f9710e89655a1874b609157f576fefe72bfa8181cc0acab7"}},{"ruleId":"D2","level":"warning","message":{"text":"SuppressionsParser::parse_suppressions (cognitive 16): SuppressionsParser::parse_suppressions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_suppressions/src/parser.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b6a2bf94c548a96ec8c877e7713a67da5f36d0b7c2d618dfad396619e5f8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::configuration::apply_extends_transitively (cognitive 16): pgls_workspace::configuration::apply_extends_transitively has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/configuration.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62017eda6f088a2b6ee4c73a6dcfaf64a9f1af0a1dcd36665e99959d1bdc2f"}},{"ruleId":"D2","level":"warning","message":{"text":"pgls_workspace::workspace_types::make_union_type (cognitive 16): pgls_workspace::workspace_types::make_union_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace_types.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba467076646ee02dadaec6489cbb171c74d6f44345f0d3622f7e90e584f103"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.processIncomingBody (cognitive 16): Transport.processIncomingBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d356a4a45906a52ca321b69ac9ba9b1c14d214f81f724957e3a5ba212e65713d"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.processIncomingBody (cognitive 16): Transport.processIncomingBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/backend-jsonrpc/src/transport.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4325a24366640de2e118384c5d0141bd960c8cbe52875dae3193bb16258fa6d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pgls_treesitter_grammar/grammar.js: FileTooLong \u2014 3078 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 2578 over it, 6.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cbb3e31e6344f798c42cfe5a76bec3d6d0303c41fefec9257303825aa53086"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of: FunctionTooLong \u2014 pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of runs 571 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 471 over it, 5.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":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8514fd865ca7858e76dc6e5f419aa885c841d595fcc4da7a25087ffb7d0079"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::constraint::emit_constraint_of: FunctionTooLong \u2014 pgls_pretty_print::nodes::constraint::emit_constraint_of runs 312 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 212 over it, 3.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":"crates/pgls_pretty_print/src/nodes/constraint.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e942ac9bec37e698226f3d7de93f29340d01990280c8504602a47f2b895a092a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogBase.new: MethodTooLong \u2014 new runs 296 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 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/base.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"369ee8103d3082863d6b9cc59bcf061d4eeda1f34b8be1ac773476fab46693f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::emit_node_enum: FunctionTooLong \u2014 pgls_pretty_print::nodes::emit_node_enum runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/mod.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8f681ffa3f1ae19c4aa13dc2446f614d38e870a491bf6557540e23f6073112"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::select_stmt::emit_select_stmt: FunctionTooLong \u2014 pgls_pretty_print::nodes::select_stmt::emit_select_stmt runs 244 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 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"972a484418ced941022e4c95c1943591ac92253ae39bfe7879f4948b995414f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workspace/server.rs: FileTooLong \u2014 1204 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 704 over it, 2.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d911b3a4099315cb0ba198e4f0225df95cba9ca5086d6f0125077c015552750c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::normalize::clear_location: FunctionTooLong \u2014 pgls_pretty_print::normalize::clear_location runs 235 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 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/normalize.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7fc4881fc005dace4e5265538122c92255255e51ebb9f33b4a68e42f31e979"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Catalog: TooManyMethods \u2014 66 methods, declared across 5 files: catalog/overlay.rs (32), catalog/mod.rs (31), ddl/mod.rs (1), catalog/derive.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/mod.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad22ab53c683d743208339fb7d3356406f96b1d4a769a72feef469b697a0312"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_catalog::resolve::expr::a_expr::infer_a_expr: FunctionTooLong \u2014 pgls_catalog::resolve::expr::a_expr::infer_a_expr runs 219 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 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/expr/a_expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e15fe68c5cdec0035485c5759b72684a98245a1d6c99c243666c5fe90c28e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::create_stmt::emit_create_stmt: FunctionTooLong \u2014 pgls_pretty_print::nodes::create_stmt::emit_create_stmt runs 168 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 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11dd0fca91aaaa690b53d9a09a1178d9cf8389e7c9481c41a54f426edd672eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::func_call::emit_sql_syntax_call: FunctionTooLong \u2014 pgls_pretty_print::nodes::func_call::emit_sql_syntax_call runs 168 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 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fd52d6c19603ede5f8ab93773573fff3872a2dfb24ca8582359f5d6efec82a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nodes/mod.rs: FileTooLong \u2014 829 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 329 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd29fff213bc5ac4207eeb27394386969c32925e28c91fee93f688f0676a1011"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce0ccd4d24a32264fff5e923e9226ab3ae9a489b427b172944edeeef0566e85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::clauses::function_options::format_function_option: FunctionTooLong \u2014 pgls_pretty_print::nodes::clauses::function_options::format_function_option runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/function_options.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d81d3a78723664abdf6507a37dde63505ce20bf543319b341e5b55526d5b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_walk::walk::walk_statements: FunctionTooLong \u2014 pgls_walk::walk::walk_statements runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/walk.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"587d4407f8722a0cd92481d0b8ff8a4329fd9eb624d40276e155dfde9c1b0f81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f879b55e637ac6a35b0e4a29ae05a87b7c379db2a2b7f7d53482ca20ca40a151"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionFilter.check_clause: MethodTooLong \u2014 check_clause runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8eed80e5a46530c85ef903c2bd1ca3a3c78407368c62ceb4ce53d4ba6f69b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_diagnostics::display::frame::print_frame: FunctionTooLong \u2014 pgls_diagnostics::display::frame::print_frame runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a32fb70d8d39544a2e7d2715056edbe7c1add18433811447e5f7431075a1c51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt: FunctionTooLong \u2014 pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt runs 129 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 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a3ab4bc3169023c90a2749d049f85773d316e52648e3cb5cb157b3446fc7f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cb247baa5f9d1cdddd5b1e878161fd0584d160923e4f9bf927d0cba0f57bba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cursor.advance_token: MethodTooLong \u2014 advance_token runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_tokenizer/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb1d004b598ac3a9e000f25d873f5ca066c8255333d92f0ac99df43016fcb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner: FunctionTooLong \u2014 pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c59bb078af3b1a8951f5bbc369a3a27caa1d299d3e1809a0d1d7ec5182d635"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/configuration.rs: FileTooLong \u2014 601 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 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eab1b85898d6e4b124570ced02063d5cf9938c9bdc7e9621a72d55b0d10d66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::xml_expr::emit_xml_expr: FunctionTooLong \u2014 pgls_pretty_print::nodes::xml_expr::emit_xml_expr runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/xml_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10377a894e8acb0326bbe726165f219f8921c06de8572905060d2e50d44f6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_workspace::workspace::server::formatting::format_document: FunctionTooLong \u2014 pgls_workspace::workspace::server::formatting::format_document runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/formatting.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a51de92f03b3d6d24e14c92a36e2285e508728c592c92a8788e10d73355ec12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/overlay.rs: FileTooLong \u2014 589 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 89% of them inside a single declaration: Catalog (17-818). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/overlay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3055e4b348a03fddddb7bd0064a1a4fc69761ae62a089eacb667c2f7edec142"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_statement_splitter::splitter::common::unknown: FunctionTooLong \u2014 pgls_statement_splitter::splitter::common::unknown runs 117 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 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/splitter/common.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acafc189f6d3afde90e53d249f1901810c2f4dfeb852ee526379cc298e4f2e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_catalog::typing::overload::select_candidate: FunctionTooLong \u2014 pgls_catalog::typing::overload::select_candidate runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f587dba89782b0e4a9e29b25511cd56a32fcd08fabdd1ce288281c84e4f8e4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nodes/alter_table_cmd.rs: FileTooLong \u2014 576 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 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7f0a774d16313204029c6a2f107947afadf7319dfedc38b47da582b976b572"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::create_role_stmt::format_role_option: FunctionTooLong \u2014 pgls_pretty_print::nodes::create_role_stmt::format_role_option runs 114 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 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_role_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bedbe7701dc6046bf0e6dcc758ce934a70c2ce2c99bfc70336629cdc474581"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::clauses::options::emit_role_option: FunctionTooLong \u2014 pgls_pretty_print::nodes::clauses::options::emit_role_option runs 113 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 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"217667ac5baa5ba959040f28753c1cee5ce189248137d36b98248f7053ceb8ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CliSession.run: MethodTooLong \u2014 run 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":"crates/pgls_cli/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a6795b76325bac216231fd510fd4766ee7b0d442f420203081424dcec51843"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause: FunctionTooLong \u2014 pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause runs 111 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 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/merge_when_clause.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9325a85c4f27f30e7b566080b40176caaaac094ad0904fe08bdfca844c45dea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EventEmitter: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.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":"crates/pgls_pretty_print/src/emitter.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1931395ff4c360a1b2c04f6ec1e7f604b4c16c7d741f20310a765ef25050a353"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_lsp::handlers::code_actions::get_actions: FunctionTooLong \u2014 pgls_lsp::handlers::code_actions::get_actions runs 109 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 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/code_actions.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3380ac9562f7cd52af976ec6e7ee1ffe699fc4e9cb3a7ebea73db883a9b86e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt: FunctionTooLong \u2014 pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc723b32fee423fc88277451a5f461e4cd5eafd8c3bf36ee4e2ce9e78693e4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print_codegen::token_kind::token_kind_mod: FunctionTooLong \u2014 pgls_pretty_print_codegen::token_kind::token_kind_mod runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print_codegen/src/token_kind.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4df6ddd46c9fe476061261742d7842bd3927966b896d4716a7fbda248e91bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceServer: TooManyMethods \u2014 32 methods, declared across 3 files: workspace/server.rs (21), server/walk.rs (7), server/analysis.rs (4). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"419fe7b15f1f1b0b7892e7d7f1e747d724ff4f6931bde861b2969288e229d3ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_typecheck::diagnostics::create_type_error: FunctionTooLong \u2014 pgls_typecheck::diagnostics::create_type_error runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_typecheck/src/diagnostics.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ee7bacc34188587aa5cbab7d4fa5f2a4e421dc42503664d3790372113f10d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt: FunctionTooLong \u2014 pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt runs 104 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 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fad6e5367b9e52c2163d7a18b6eea1f1295b4c4f37cb342ab6fc8fb1aa6855"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::json_expr::emit_json_expr: FunctionTooLong \u2014 pgls_pretty_print::nodes::json_expr::emit_json_expr runs 104 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 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c42435630cbdfa4c206f360d3b8fc768002525bfc4a47245c6ed1e844a4e00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/resolver.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d8a8bf4e882aa7025687704b447af8e9003e1a97bc6889ee9abf2b7415a778"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt: FunctionTooLong \u2014 pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt runs 103 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 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5a25156c99c02a1f2a626b15f4afddb65d566f51435c2c6b2b0506625c506"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_statement_splitter::split_region: FunctionTooLong \u2014 pgls_statement_splitter::split_region runs 103 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 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfca26f3b99951bb356acac28f8378c188cfae9a03de54f36abcff89dea08332"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/document.rs: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4124f09efa361b74c4a6d9cf27dd85a8d976248a3609cfb5c755a2036ec1fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt: FunctionTooLong \u2014 pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/comment_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3ffb00aaacea6dbc25a6b42a4a6ca728ed68ac6779f9ae22ffe62e7630b5c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): xtask/codegen/src/generate_configuration.rs:700-957 | xtask/codegen/src/generate_configuration.rs:1328-1475 \u2014 These two members are variants of one another: 68 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b0dc0248c12f4fbf647f404fabd1cdb5e7e2145fc792270f35731a7734e17a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): crates/pgls_pretty_print/src/nodes/json_array_agg.rs:6-92 | crates/pgls_pretty_print/src/nodes/json_object_agg.rs:5-102 \u2014 These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e47fdfd6b47966bf2fd2652690e44190f87aeada37035c2c6e0158e48dd285"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): xtask/codegen/src/generate_configuration.rs:964-1191 | xtask/codegen/src/generate_configuration.rs:1481-1563 \u2014 These two members are variants of one another: 42 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aa66e6a034e0e377d86fd48dc20927a627ce2dff366a3978a89d66ce60e7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/pgls_query/src/deparse.rs:32-53 | crates/pgls_query/src/fingerprint.rs:24-41 | crates/pgls_query/src/normalize.rs:16-30 | crates/pgls_query/src/parse.rs:22-43 | crates/pgls_query/src/plpgsql.rs:25-38 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query/src/deparse.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"892d4dcd86e49f9c8c6fc96770ae2ba15eacb4af1718e00cb60e2c179ffc4e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/pgls_workspace/src/workspace/server.rs:882-954 | crates/pgls_workspace/src/workspace/server.rs:1519-1567 | crates/pgls_workspace/src/workspace/server.rs:1574-1623 | crates/pgls_workspace/src/workspace/server.rs:1633-1702 | crates/pgls_workspace/src/workspace/server.rs:1712-1782 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc60ca175bf51fbbe5fb5b43387fef4c6f90cd923f6f1d25ca1649d1ff8cbf6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/pgls_cli/src/service/windows.rs:130-147 | crates/pgls_cli/src/service/windows.rs:159-172 | crates/pgls_cli/src/service/windows.rs:263-280 | crates/pgls_cli/src/service/windows.rs:292-305 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/windows.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f7e53efd2190a3170d7ca792c0ff6d512207cf3ca5f1847ce40c77a93accd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/pgls_pretty_print/src/nodes/a_expr.rs:425-450 | crates/pgls_pretty_print/src/nodes/a_expr.rs:453-480 | crates/pgls_pretty_print/src/nodes/a_expr.rs:483-510 | crates/pgls_pretty_print/src/nodes/a_expr.rs:513-542 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e460c562c2e5e676d56b5f3708867837a7e40419c2f774dd653674dfea687e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): crates/pgls_pretty_print/src/nodes/alter_fdw_stmt.rs:5-72 | crates/pgls_pretty_print/src/nodes/create_fdw_stmt.rs:5-70 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_fdw_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8446f4aed21a08414c5cc2b46039a77a4272c07b41fe50bbf3240c81938f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): xtask/codegen/src/generate_pglinter.rs:573-666 | xtask/codegen/src/generate_splinter.rs:626-695 \u2014 These two members are one piece of code written twice and then edited apart: 70 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":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f767fc3938ecd77f418c6ba92c78145a8bc9a085408802193dce8a721388bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/pgls_pretty_print/src/renderer.rs:72-121 | crates/pgls_pretty_print/src/renderer.rs:209-276 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/renderer.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b9db89091904c174abe29036f271151f9f8755caf2215d3aa888a6c9b551fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/pgls_pretty_print/src/nodes/delete_stmt.rs:5-47 | crates/pgls_pretty_print/src/nodes/update_stmt.rs:5-56 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/delete_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c855959513c4d34d2e375b94d67168aef319d376e394f773dc626c81ee44e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/pgls_pretty_print/src/nodes/window_clause.rs:19-71 | crates/pgls_pretty_print/src/nodes/window_def.rs:55-121 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/window_clause.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"14789f2e1a8fb06035d1cc66ff2ad4e87f81fa2feba515eb5e286ffefd58a0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/pgls_query_macros/src/iter_mut.rs:105-147 | crates/pgls_query_macros/src/iter_ref.rs:74-110 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/iter_mut.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4c4d986ea12f40d437cad226bf2737715e96fbb8f84ca352ad43d260153366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): xtask/codegen/src/generate_pglinter.rs:343-384 | xtask/codegen/src/generate_splinter.rs:342-383 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3222560ff5286b1dfe23a7d870424baa4b0e58fe1fea65ae19d06f10ede697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/pgls_query_macros/src/node_mut.rs:5-50 | crates/pgls_query_macros/src/node_ref.rs:5-46 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/node_mut.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8985ce20fe6fcbf7c1cbd58195e94779c6646a26a4463ce734be11a16e1df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): xtask/codegen/src/generate_pglinter.rs:390-430 | xtask/codegen/src/generate_splinter.rs:389-429 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00879ea6e121f82a0da0a34dd74611b603a280c30799a3989e59091df15d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/pgls_wasm/src/lsp.rs:250-296 | crates/pgls_wasm/src/lsp.rs:298-340 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/lsp.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bc42b118ed9be701f020569854cedca5d232847f8343db871166a6d179174d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/pgls_query/src/split.rs:24-46 | crates/pgls_query/src/split.rs:59-86 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query/src/split.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaee14f681bd66bb600f775fa6b078c17c388cae25520eeed9c8d1c7c101754a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/pgls_lexer_codegen/src/keywords.rs:11-40 | crates/pgls_pretty_print_codegen/src/keywords.rs:5-32 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer_codegen/src/keywords.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"059f1e5f0c1bf039c0844a3341be98c88a8bbaeaf3c2deff644b0ede6d408ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): docs/codegen/src/rules_index.rs:48-89 | docs/codegen/src/rules_index.rs:218-253 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"docs/codegen/src/rules_index.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb460499650c8dfdee00b441ab47e8d0b2eaffe84658f663c27d072be0dbb92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/pgls_pretty_print/src/nodes/create_user_mapping_stmt.rs:5-39 | crates/pgls_pretty_print/src/nodes/drop_user_mapping_stmt.rs:5-35 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_user_mapping_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2a3e919900dcc029343e4a4edb9233914ec2243d937b0b7895bb45259900f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/pgls_pretty_print/src/nodes/alter_tsdictionary_stmt.rs:5-33 | crates/pgls_pretty_print/src/nodes/create_range_stmt.rs:5-32 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_tsdictionary_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0f5dec1db357eddf728882ba773574790ac69ecd441c2c303417f9e960e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): xtask/codegen/src/generate_pglinter.rs:177-211 | xtask/codegen/src/generate_splinter.rs:175-208 \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":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0b428cca5b8d97c80914aa35d361c2964e9f0db426b339e5598e4be279bddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): docs/codegen/src/rules_docs.rs:22-44 | docs/codegen/src/splinter_docs.rs:21-43 \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":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa6454556563e07d8d022f8f802073dca093144777f4585b8177494dd7a0c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/pgls_pretty_print/src/nodes/a_expr.rs:153-177 | crates/pgls_pretty_print/src/nodes/a_expr.rs:180-204 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f5a0ab5529f6feda6786fa5a11ef2bd2cf139b26d999b486c8a0af3630a679"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs:5-34 | crates/pgls_pretty_print/src/nodes/dropdb_stmt.rs:5-34 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd99fc256457d592508587d50c8b77c1aa95e936025d3f7b4807792469cea535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/pgls_cli/src/service/unix.rs:62-103 | crates/pgls_cli/src/service/windows.rs:77-101 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"315f417165ef22f2c699cfcec0dca3e977e3b2bbc01167c85263b2f096d55372"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/pgls_analyse/src/categories.rs:267-295 | crates/pgls_diagnostics/src/serde.rs:349-374 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyse/src/categories.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3687b14dadb467916ce435751326eed1f2c56b84bb2eb189082c9d7a8a929e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/pgls_pretty_print/src/nodes/a_expr.rs:207-230 | crates/pgls_pretty_print/src/nodes/a_expr.rs:233-258 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"751f895b32121a8473acd0a78d470cbcb4c9d51b68fc24a1dc3763e7b7a04a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): docs/codegen/src/rules_index.rs:19-42 | docs/codegen/src/rules_index.rs:189-212 \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":"docs/codegen/src/rules_index.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd27592a37a06e3e9200e589ec27673a252d7bf1762e8ddfd09a8b52f8d0401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/pgls_pretty_print/src/nodes/range_table_sample.rs:5-37 | crates/pgls_pretty_print/src/nodes/table_sample_clause.rs:5-31 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/range_table_sample.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"af726f385886d8dbcafd3d26a13f5132efdd7b855a6771e195330e97fce35ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs:26-43 | crates/pgls_catalog/src/resolve/nodes/update_stmt.rs:30-48 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f3bb32bea843d98b5fd0dedbd267f0e515bb1dd52c0fe4a91000adc288b0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/pgls_configuration/src/format.rs:357-378 | crates/pgls_workspace/src/settings.rs:696-717 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration/src/format.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae76f9909d5b28e9ff834cddb2459244098bb82d1d02fd98fb38ec4a6f6a3319"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/pgls_completions/src/providers/policies.rs:16-43 | crates/pgls_completions/src/providers/roles.rs:15-40 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/policies.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a71d205871a2de662f7e6e44de7a7800b5f55d40d2f519a84d018ae236ff6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/pgls_wasm/src/lsp.rs:471-487 | crates/pgls_wasm/src/lsp.rs:489-510 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/lsp.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c354393bbbfb4e13876f391431c4b213101e8ba8574ab2307f13c01a381dede3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pgls_wasm/src/ffi.rs:239-257 | crates/pgls_wasm/src/ffi.rs:270-288 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/ffi.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8d42e968014dfcc513ebaed1d905d518bde87b3a4c6bedb466f4ca47ec020e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/pgls_configuration/src/database.rs:68-87 | crates/pgls_workspace/src/settings.rs:883-907 \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":"crates/pgls_configuration/src/database.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b5aa7423b1341bce89f7f6e6623d6b29b542f452f6e9d45f1d5bb000cfcb4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/pgls_console/src/markup.rs:201-221 | crates/pgls_console/src/markup.rs:223-242 \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":"crates/pgls_console/src/markup.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e391fe138dc221c40c1068122146bb4c896fa63a8f39e3c56c6db9af89c1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/pgls_pretty_print/src/nodes/a_expr.rs:328-350 | crates/pgls_pretty_print/src/nodes/a_expr.rs:353-375 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c09aa28b09e2370e736e9b178f774fe2d3162c7869a0b9436033646b55b000a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): docs/codegen/src/rules_docs.rs:423-450 | xtask/rules_check/src/lib.rs:199-224 \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":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66ca2e2e647a1b7efb7f3b2eb4092f3c1611e55a8d6d42583519b328673414e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/pgls_cli/src/service/unix.rs:28-43 | crates/pgls_cli/src/service/windows.rs:31-46 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"903f94dff8197c6a9f6e02b3d379de49b9c05a1d0fcd865bb7248aa5d73e2b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pgls_completions/src/providers/columns.rs:17-35 | crates/pgls_completions/src/providers/functions.rs:17-35 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/columns.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa497f3297e398a40e6299cfa6dc5c0de365f33680f089f422053886cc7c140d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/pgls_statement_splitter/src/splitter/common.rs:70-97 | crates/pgls_statement_splitter/src/splitter/common.rs:99-126 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/splitter/common.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36c1897966709a203811248b3a61694b0759809d51309a23416fbc18f95d730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pgls_pretty_print/src/nodes/distinct_expr.rs:6-25 | crates/pgls_pretty_print/src/nodes/op_expr.rs:8-26 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/distinct_expr.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"587c09e626ada1c478c54ac703c9d69aecb7c34e332f5a93f98df30ee5d458a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/pgls_cli/src/metrics.rs:189-206 | crates/pgls_cli/src/metrics.rs:210-228 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/metrics.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6654c9a9803ba387b0e1deaadfae463417a9f476d523897d87977ee17c438713"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/pgls_pretty_print/src/nodes/json_array_query_constructor.rs:8-36 | crates/pgls_pretty_print/src/nodes/json_scalar_expr.rs:5-25 | crates/pgls_pretty_print/src/nodes/json_serialize_expr.rs:6-26 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_query_constructor.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f216f9721f96f68edf3180a4be46417269756e17a1903935352ad854cd1a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/pgls_query_ext/src/function_body.rs:78-90 | crates/pgls_query_ext/src/function_body.rs:101-113 | crates/pgls_query_ext/src/function_body.rs:117-129 \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":"crates/pgls_query_ext/src/function_body.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d514cb3d8a2bc4701c36a062b6e7373ffc7377096050626cb68e6521a316f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pgls_catalog/src/catalog/ddl/create_seq_stmt.rs:9-27 | crates/pgls_catalog/src/catalog/ddl/into_clause.rs:14-32 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_seq_stmt.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dddd68a2f11f6a19260a2afc650c9b4dca1fa3de890bdfd0ffa4a8eda213c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/pgls_pretty_print/src/nodes/a_array_expr.rs:5-26 | crates/pgls_pretty_print/src/nodes/coalesce_expr.rs:5-22 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_array_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"457582e5416ff7842ed7e1b7b08dd12e914eca50702907e36e445b0d47e54249"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pgls_pretty_print/src/nodes/clauses/operators.rs:39-56 | crates/pgls_pretty_print/src/nodes/object_with_args.rs:97-110 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/operators.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264c6f41a446ecd450dcf6bb7dbfe3af7c561d6fc21ff802b19ce99f24acb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/pgls_pretty_print/src/nodes/cluster_stmt.rs:5-31 | crates/pgls_pretty_print/src/nodes/create_op_family_stmt.rs:5-25 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/cluster_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"32023e79f1778a65bbfae5400a8e43f1285e633a9b59d9e5b67900e4305ab0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/pgls_treesitter/src/queries/insert_columns.rs:50-68 | crates/pgls_treesitter/src/queries/relations.rs:60-76 | crates/pgls_treesitter/src/queries/select_columns.rs:66-87 | crates/pgls_treesitter/src/queries/table_aliases.rs:99-121 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/insert_columns.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ab95c199df0761efe29dee6a045ccda12a412752baaa30e619f0fe548990ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pgls_diagnostics_macros/src/generate.rs:185-198 | crates/pgls_diagnostics_macros/src/generate.rs:200-213 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics_macros/src/generate.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cb046000be5e5c1afa218978d400056e81be8a62d6cf971dee6ff3d32cc4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pgls_console/src/write/termcolor.rs:21-41 | crates/pgls_console/src/write/termcolor.rs:43-61 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_console/src/write/termcolor.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd595ea09482576780cb82abed796b6fc5cb776b0a4c7ddb48936c0c1b72dc69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/pgls_statement_splitter/src/lib.rs:136-150 | crates/pgls_statement_splitter/src/lib.rs:153-169 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/lib.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8f148f6a042cfbab1d4af6e52d42bf6a1dd9acde528cd3dacbccc3fdce48ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pgls_catalog/src/session/settings.rs:63-76 | crates/pgls_catalog/src/session/settings.rs:79-92 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/settings.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0119bb8962e309dc87bcc7141794816b0a872657b9b6ffcf8b1195e09c585381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/pgls_pretty_print/src/nodes/alter_database_refresh_coll_stmt.rs:8-28 | crates/pgls_pretty_print/src/nodes/alter_database_set_stmt.rs:5-23 | crates/pgls_pretty_print/src/nodes/alter_database_stmt.rs:5-23 \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":"crates/pgls_pretty_print/src/nodes/alter_database_refresh_coll_stmt.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1715273f165211285199e52cf5d07fe5a88ca902182ed4ef536db1d3c607262"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pgls_wasm/src/ffi.rs:200-213 | crates/pgls_wasm/src/ffi.rs:297-310 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/ffi.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2a0a4df403b3541b083aa55120a3d167294cbcf0759650b2fbabe03a26c865"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/pgls_diagnostics/src/display_github.rs:93-109 | crates/pgls_diagnostics/src/display_github.rs:111-129 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display_github.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"946e526390f35761684bc5ed5221446f5253ae96913927159f3f536993b29347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/pgls_pretty_print/src/nodes/drop_owned_stmt.rs:5-23 | crates/pgls_pretty_print/src/nodes/drop_role_stmt.rs:5-23 | crates/pgls_pretty_print/src/nodes/drop_subscription_stmt.rs:5-25 \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":"crates/pgls_pretty_print/src/nodes/drop_owned_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"994e9b5dc0b8ea47c7267a472cf3df6d1432d5403bc90472a64155f33344129f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/pgls_wasm/src/ffi.rs:341-353 | crates/pgls_wasm/src/ffi.rs:362-374 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/ffi.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd4f424250edcd421489eb4b0c7525c3a1305aa9a3c1d5b5d33b298d0b2c58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/pgls_treesitter/src/helper.rs:87-101 | crates/pgls_treesitter/src/helper.rs:103-119 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/helper.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ea960467701608b19a6a274d4b6b016ffad99f5ba48c40593712677f31aa53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pgls_workspace/src/workspace/server.rs:158-171 | crates/pgls_workspace/src/workspace/server.rs:175-186 \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":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b38ef18e7d3c8498162583dd7e1020c59dd65ee71f196331d3ac3aa8e80143a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/pgls_diagnostics_macros/src/generate.rs:54-70 | crates/pgls_diagnostics_macros/src/generate.rs:72-88 | crates/pgls_diagnostics_macros/src/generate.rs:232-251 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics_macros/src/generate.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a07c7fbad8dbf37191f7f249982476ea398d50e32cad127a2345fbf5163e886"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/pgls_wasm/src/ffi.rs:114-125 | crates/pgls_wasm/src/ffi.rs:141-152 | crates/pgls_wasm/src/ffi.rs:320-332 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/ffi.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3999dcc1e7bf24c917c279a5a822e5d2488c5df88a37eaa0b0a060c6317f840f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pgls_wasm/src/lib.rs:397-410 | crates/pgls_wasm/src/lib.rs:414-429 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2164d5a1b3fd85ffa904318d15f4f33573e447b6bbd3b3eedb354fc42b0dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pgls_pretty_print/src/nodes/rename_stmt.rs:173-189 | crates/pgls_pretty_print/src/nodes/rename_stmt.rs:207-218 \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":"crates/pgls_pretty_print/src/nodes/rename_stmt.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92a080231426e99dc3bbe67842e6a3a2bbd9d1cd08e8ea2ad180e433384aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/pgls_workspace/src/workspace/server/document.rs:534-543 | crates/pgls_workspace/src/workspace/server/document.rs:555-564 | crates/pgls_workspace/src/workspace/server/document.rs:576-587 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/document.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"692e3c3299be837b4eeaf3f370a3466394be045adef705e92eab9da76311ccb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/pgls_pretty_print/src/nodes/json_argument.rs:5-20 | crates/pgls_pretty_print/src/nodes/target_entry.rs:5-20 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_argument.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e72c5a9a6df82813f2c27dbd9923ad41ba6d31438087f7ffa9e505ae1e016f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pgls_analyser/src/lint/style/prefer_text_field.rs:67-85 | crates/pgls_analyser/src/lint/style/prefer_timestamptz.rs:81-102 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/style/prefer_text_field.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b601742c0f832baeb84023b8b09f0fe5938ceb62f7808ec3858610d94e72cf8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/pgls_pretty_print/src/nodes/utils/layout.rs:75-85 | crates/pgls_pretty_print/src/nodes/utils/lists.rs:110-120 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/utils/layout.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb53c80e63c60eeb1da286f499106441a4266a7e926f61753b057d120ad525da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/pgls_pretty_print_codegen/src/proto_analyser.rs:18-35 | crates/pgls_query_macros/src/proto_analyser.rs:48-71 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print_codegen/src/proto_analyser.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6356a8ffb787050a458743bc34765563a23c82df6f1585d78b2e40c8e5eb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/pgls_analyser/src/lint/style/ban_char_field.rs:84-93 | crates/pgls_analyser/src/lint/style/prefer_text_field.rs:88-96 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/style/ban_char_field.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f23e9fbad8b820cd1f6ca86b1dbc945a879ae393705ba1a1abe0ed4ac579c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pgls_console/src/lib.rs:143-154 | crates/pgls_console/src/lib.rs:156-167 \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":"crates/pgls_console/src/lib.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a80d6d7c75c17bee7ac42ea0424167f6abe419eb03013b5a013d3e0ab31839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/pgls_pretty_print/src/nodes/transaction_stmt.rs:160-169 | crates/pgls_pretty_print/src/nodes/transaction_stmt.rs:171-181 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/transaction_stmt.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"668e6bc64280502d5c8e6f835d70b5eb896675df3412c3192f4a22ddfa07e727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/pgls_analyse/src/filter.rs:43-52 | crates/pgls_analyse/src/filter.rs:55-64 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyse/src/filter.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8afde30e27e2f6da973ee1f3fd951543f19f4b6c44cbf1110a1c5a0235ca19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/pgls_pretty_print/src/nodes/clauses/json.rs:15-32 | crates/pgls_pretty_print/src/nodes/json_output.rs:5-21 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/json.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"79866c3c6f5b36453b2ad1c831e8f8b8c5f73752afa9599701a26460022dcc78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pgls_diagnostics/src/display/message.rs:88-96 | crates/pgls_diagnostics/src/display_github.rs:131-137 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/message.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba32bdf1908ad569697e09cf0a4bd7ef74c028f99eac1ff8c346aaf8676e999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pgls_fs/src/fs/os.rs:287-298 | crates/pgls_fs/src/fs/os.rs:351-363 \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":"crates/pgls_fs/src/fs/os.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d5657467ec4df715bfa32b30513fa5310229c704744778cdbd462702cb48dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/pgls_fs/src/fs/os.rs:35-44 | crates/pgls_fs/src/fs/os.rs:48-57 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/os.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a875d14b0d670a3e1e96b47ab8a1c7d74979fce59be322ed4404880662b05a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/pgls_lsp/src/session.rs:1194-1208 | crates/pgls_matcher/src/pattern.rs:330-347 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69ecae872545ac0518b5395b31df7f620e660dec18256ef94493e462a3da329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/pgls_analyser/src/fix.rs:50-61 | crates/pgls_analyser/src/fix.rs:74-89 | crates/pgls_catalog/src/resolve/span.rs:110-125 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/fix.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6bdced852151d6e0175692037bf16c15ab0bf11a75e54aa9d44545f04231a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pgls_diagnostics/src/context.rs:572-583 | crates/pgls_diagnostics/src/context.rs:585-596 \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":"crates/pgls_diagnostics/src/context.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f905e9c3ce5668e86eaafb8d7c80d9b308302f6d14f0baa7a7a62d68f8b848f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/pgls_inlay_hints/src/lib.rs:56-67 | crates/pgls_semantic_tokens/src/lib.rs:62-73 \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":"crates/pgls_inlay_hints/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7460bf88998336ae4b6d4a7dceb3f25196256932312a2caf6b0b2b14540bfc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/pgls_pretty_print/src/nodes/close_portal_stmt.rs:5-18 | crates/pgls_pretty_print/src/nodes/deallocate_stmt.rs:5-18 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/close_portal_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020e392819ab39218c7395f6c383f102e8d016908c5f5f2f07443698892ede7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/pgls_catalog/src/resolve/nodes/alias.rs:40-53 | crates/pgls_catalog/src/resolve/nodes/with_clause.rs:145-157 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/alias.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"656ddd9fe08e82e76ebb15f985682c5a92c6f92d31552963ea81d6d5b46d0abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/pgls_pretty_print/src/nodes/inference_elem.rs:5-15 | crates/pgls_pretty_print/src/nodes/json_value_expr.rs:5-19 | crates/pgls_pretty_print/src/nodes/table_func.rs:5-17 \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":"crates/pgls_pretty_print/src/nodes/inference_elem.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc056f02d121102a8699332534a422057643f0e5ab7b4a8562f599943da61d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/pgls_walk/src/walk.rs:426-436 | crates/pgls_workspace/src/features/code_actions/execute_statement/execution.rs:73-83 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/walk.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb844980b42feae5ceae51bddc7ef4b9a0df7aa11eb5d277177268918dfcb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/pgls_fs/src/fs.rs:534-543 | crates/pgls_fs/src/fs.rs:547-556 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3937a7a9db30c17fcb917e13996907c4bcfe14deee4b1d994bff75b6c47c3be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): docs/codegen/src/rules_docs.rs:151-170 | docs/codegen/src/splinter_docs.rs:132-153 \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":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fccd813e3e487c84214c183ec8491c3b07bef4163d5cd37b641899d79685f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/pgls_query_ext/src/function_body.rs:208-217 | crates/pgls_semantic_tokens/src/lib.rs:254-262 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_ext/src/function_body.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb0e509bdddef0d0c55e1a9b47ff7a788f03d37ef824d4898c1f95a372f7af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/pgls_pretty_print/src/nodes/a_expr.rs:617-625 | crates/pgls_pretty_print/src/nodes/func_call.rs:506-514 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ca7e2ffdc6f5974197736a69539293c86c8f39fe48917227ce97ca0fc7090c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/pgls_pretty_print/src/nodes/window_clause.rs:5-16 | crates/pgls_pretty_print/src/nodes/window_def.rs:47-53 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/window_clause.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd19de7691f35cf367d7d088409a4fb737edf87540dd510dc68ed349e63b7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/pgls_pretty_print/src/nodes/transaction_stmt.rs:183-190 | crates/pgls_pretty_print/src/nodes/utils/tokens.rs:77-84 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/transaction_stmt.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30427f406fa2385edee332a4bb90f4c3be9ffe3a28bc0ee6af7b70931bfddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/pgls_pretty_print/src/nodes/alter_tsconfiguration_stmt.rs:67-72 | crates/pgls_pretty_print/src/nodes/define_stmt.rs:156-161 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_tsconfiguration_stmt.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74040ea026d21deb1f39ccfbfc180c42e55d247ee7bbc50131990e196b0e773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/pgls_catalog/src/snapshot/functions.rs:87-91 | crates/pgls_catalog/src/snapshot/types.rs:23-27 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/snapshot/functions.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55ab5009afa33f6892d84f29102c4410bbff97c6eb1571c2e9d25a136a7f9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/pgls_walk/src/statement.rs:70-74 | crates/pgls_workspace/src/workspace/server/document.rs:439-443 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/statement.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"662b78beae1b8fb2370511c646cfb33690c07968aed2dfcf6542bc44e51d422c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): docs/codegen/src/utils.rs:49-56 | xtask/codegen/src/generate_configuration.rs:112-117 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"docs/codegen/src/utils.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af4395a1af087af82ed9276b8f4ed6247b423d8c74747c83f1636a711849999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/pgls_treesitter/src/queries/parameters.rs:47-54 | crates/pgls_treesitter/src/queries/relations.rs:45-52 | crates/pgls_treesitter/src/queries/returning_aliases.rs:95-102 | crates/pgls_treesitter/src/queries/table_aliases.rs:84-91 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/parameters.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e68de53ad65609865e0b3e6bd665e5acd373e2e2b089a2e927c9874b9725689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/pgls_cli/src/service/unix.rs:195-199 | crates/pgls_cli/src/service/windows.rs:217-221 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"316e7594c94c8ee4313c317fb6f4871d43c4a8f41c361cbdf1be2acf1c6e4873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): docs/codegen/src/rules_docs.rs:473-515 | xtask/rules_check/src/lib.rs:110-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/codegen/src/rules_docs.rs:473\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc85f9bc0eaf9584d6523f7287b0577499785ec327271b3c973cae62e66bfc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_fdw_stmt.rs:26-58 | crates/pgls_pretty_print/src/nodes/create_fdw_stmt.rs:23-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_pretty_print/src/nodes/create_fdw_stmt.rs:56\u0060 calls \u0060space\u0060 and \u0060crates/pgls_pretty_print/src/nodes/alter_fdw_stmt.rs:59\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_fdw_stmt.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1b2b7bf1a022d2cd1c232d12ad1548ed446f42ad0389e73acb816b191d9844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/json_array_agg.rs:60-92 | crates/pgls_pretty_print/src/nodes/json_object_agg.rs:70-102 \u2014 before extracting anything, compare \u0060crates/pgls_pretty_print/src/nodes/json_array_agg.rs\u0060 and \u0060crates/pgls_pretty_print/src/nodes/json_object_agg.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/json_array_agg.rs:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026JsonArrayAgg\u0060 in one and \u0060\u0026JsonObjectAgg\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ec8e20eb2f894d1f16993cb5a5c15b22230770916ca19d262dbf4b21a6f82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/constraint.rs:222-252 | crates/pgls_pretty_print/src/nodes/constraint.rs:287-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/constraint.rs:222\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/constraint.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cf1c4ffbffdc50443639797e5656efb1503aa934a9fb1cf180beb7e10bcd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/insert_stmt.rs:39-65 | crates/pgls_pretty_print/src/nodes/merge_when_clause.rs:87-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/insert_stmt.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/insert_stmt.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a986d5f41b6222e2ad38fff8dcb392d13222f1d2143af46ee8db6055071490dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:797-822 | xtask/codegen/src/generate_configuration.rs:1376-1402 \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 \u0060xtask/codegen/src/generate_configuration.rs:1376\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a4414fdb58cc86f6c935a54d40674b3342d48213e5ee3fdc2c981af736f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/pgls_pretty_print/src/renderer.rs:96-121 | crates/pgls_pretty_print/src/renderer.rs:251-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/renderer.rs:96\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/renderer.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b994acc77fc43746d1850ff9e1f9daec63b91ba0b182458555d2ca8c2a7da33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:391-416 | xtask/codegen/src/generate_splinter.rs:390-415 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_pglinter.rs:391\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rules_by_category\u0060 to \u0060\u0026BTreeMap\u003CString, Vec\u003C\u0026PglinterRuleMeta\u003E\u003E\u0060 in one and \u0060\u0026BTreeMap\u003CString, Vec\u003C\u0026SqlRuleMetadata\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29318ef0aa14a99b6f70e69523ea6e2340c7ff1f5dbaf7225d0ab6c5dfa822d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:361-384 | xtask/codegen/src/generate_splinter.rs:360-383 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_pglinter.rs:361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rules\u0060 to \u0060\u0026[\u0026PglinterRuleMeta]\u0060 in one and \u0060\u0026[\u0026SqlRuleMetadata]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7da11d9db1100d5b920206c6ef4be91d36832fd4497c85b2f73dcd5c4e19c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:225-242 | xtask/codegen/src/generate_splinter.rs:219-241 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_pglinter.rs:225\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rules\u0060 to \u0060\u0026BTreeMap\u003CString, PglinterRuleMeta\u003E\u0060 in one and \u0060\u0026BTreeMap\u003CString, SqlRuleMetadata\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"499fb719eecec4bac17e27a228b6101ac480c08dc627f326e8b712a029765583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/pgls_query_macros/src/iter_mut.rs:7-26 | crates/pgls_query_macros/src/iter_ref.rs:7-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_query_macros/src/iter_mut.rs:7\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/iter_mut.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64cee36fc119dec6261183bf473610adb84d96484637b354f5ddb4bc407dec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): crates/pgls_pretty_print/src/nodes/a_expr.rs:432-450 | crates/pgls_pretty_print/src/nodes/a_expr.rs:462-480 | crates/pgls_pretty_print/src/nodes/a_expr.rs:492-510 | crates/pgls_pretty_print/src/nodes/a_expr.rs:524-542 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:432\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:459\u0060 calls \u0060token\u0060, \u0060space\u0060 and \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:429\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b2792541596b7049a12e7690ef4398d5d1eca2bb8243fc3556b7c6ea0c6522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/json_object_constructor.rs:31-49 | crates/pgls_pretty_print/src/nodes/json_parse_expr.rs:20-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/json_object_constructor.rs:31\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026JsonObjectConstructor\u0060 in one and \u0060\u0026JsonParseExpr\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_object_constructor.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"154243d295fda833d856512ff4e2792cf7345da6d724affc86daaf21b652f062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): docs/codegen/src/rules_docs.rs:517-535 | xtask/rules_check/src/lib.rs:154-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/codegen/src/rules_docs.rs:517\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/codegen/src/rules_docs.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0798417f759ea265e79237c024ae019fb97579de55f602bc65b2f5cd48bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201319 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:787-794 | xtask/codegen/src/generate_configuration.rs:1355-1373 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d327f9c7e0e773182a23694fe58536bd22c0ef74b38449dbeee2acdd2ce326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/json_table.rs:41-58 | crates/pgls_pretty_print/src/nodes/json_table_column.rs:19-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_table.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"490e7004e96d7e068d8905dff80fb7ff0394c17c250e1ec4bd55fefacf6318d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:1026-1043 | xtask/codegen/src/generate_configuration.rs:1502-1519 \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 \u0060xtask/codegen/src/generate_configuration.rs:1026\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"00efff762564df23ad8ba3b59d62b5a56248f6bab7ace07dfa9372a902b43d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/pgls_cli/src/service/windows.rs:131-147 | crates/pgls_cli/src/service/windows.rs:264-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/windows.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5667e0f4b81dbf6d7f0959db7b487b7b719bb915fcdadaedebe291d3afd98e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:727-743 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:746-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:727\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"7286c39bf2b06884c9d42fa413f8c3d4cd933b99a6621cd2b5c89d8588ac0dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/delete_stmt.rs:31-47 | crates/pgls_pretty_print/src/nodes/update_stmt.rs:40-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/delete_stmt.rs:31\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026DeleteStmt\u0060 in one and \u0060\u0026UpdateStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/delete_stmt.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"081297183f40e26679ca836d3f596f6c200650639329f39584aaca455b757f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs:289-305 | crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs:316-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb864ef5b68fcd4e0c9e0a0428cab74ab1046e7b6e177691e6a5b0b4127cacf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/pgls_lexer_codegen/src/keywords.rs:13-28 | crates/pgls_pretty_print_codegen/src/keywords.rs:7-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_lexer_codegen/src/keywords.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer_codegen/src/keywords.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"af450480e6717e584f58f94f4d7eb0686dd588bef50f06e148eef92d27d64f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/grant_stmt.rs:51-66 | crates/pgls_pretty_print/src/nodes/grant_stmt.rs:76-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/grant_stmt.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_stmt.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca415c411d2b655994d53c87cae5b9de77ad3371b89831e53bea36fcf904603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:344-359 | xtask/codegen/src/generate_splinter.rs:343-358 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_pglinter.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rules\u0060 to \u0060\u0026[\u0026PglinterRuleMeta]\u0060 in one and \u0060\u0026[\u0026SqlRuleMetadata]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecddd99fe316d09242d601afb82c5ed8e6b1990b17ce89a8341394b3f75ac7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/pgls_cli/src/service/unix.rs:67-81 | crates/pgls_cli/src/service/windows.rs:81-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b89f01537b3722736763a3228c599135c69eb643627c6fa68e3b8339f2b2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:605-619 | xtask/codegen/src/generate_configuration.rs:639-653 \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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bc02c438a6b5f481d19999224a5328c12507009dbb762d70717e1f30233759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:841-855 | xtask/codegen/src/generate_configuration.rs:1412-1426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b865df2a6e55336bb794f987c0b456c7749e8c4e0be77bc58ac2d24935c1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:675-689 | xtask/codegen/src/generate_splinter.rs:704-718 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eef7fe28d4773b1d1a877cb71a35ae2fe0b717ad96135dd270e086c9e1ae47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/pgls_pretty_print/src/nodes/comment_stmt.rs:59-72 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:77-90 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:95-108 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:113-126 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/comment_stmt.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/comment_stmt.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3bee0b42c69b67d93cfcd75d06a07fdf81d623a2393c03cd777c4520c6923f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_catalog/src/resolve/mod.rs:336-349 | crates/pgls_catalog/src/resolve/mod.rs:352-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/mod.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f9b411cb29adee3b518e8b0697c09d69b9da75d8437346f00cc51a638dca57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:96-109 | crates/pgls_pretty_print/src/nodes/column_def.rs:22-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fa1d9645778d534d7ac7306d270347126fd97754e4b63e3cdd133eef84a8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/clauses/options.rs:95-108 | crates/pgls_pretty_print/src/nodes/clauses/options.rs:134-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"574adc5e084cc464feaaa2e521bee89a6df1be99fb89621391a7dc27d3c63065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/coalesce_expr.rs:9-22 | crates/pgls_pretty_print/src/nodes/min_max_expr.rs:15-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/coalesce_expr.rs:9\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026CoalesceExpr\u0060 in one and \u0060\u0026MinMaxExpr\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/coalesce_expr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"949deee8dbe87eafda90522c8e8a7552eed7646020f4d94401c17e166fd8782a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_stmt.rs:38-51 | crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:23-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_stmt.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"944dc7c89e7e5021327abb3b610c6961cbf6a0788786719153de6a296f97f146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_stmt.rs:95-108 | crates/pgls_pretty_print/src/nodes/create_stmt.rs:146-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_stmt.rs:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c0725ab362dd8f3a8ee980399d05df527b5db74e886f1faa4328f2eeffa742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/func_call.rs:300-313 | crates/pgls_pretty_print/src/nodes/func_call.rs:334-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/func_call.rs:300\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb6224313395f830ecff9880db1223b5cd7328e7b116acc399d0ec2d1c07db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/select_stmt.rs:76-89 | crates/pgls_pretty_print/src/nodes/select_stmt.rs:312-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/select_stmt.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0764ad920c052c8d41c42f283975c841093b84358511a37c995b9417c5066e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/select_stmt.rs:101-114 | crates/pgls_pretty_print/src/nodes/select_stmt.rs:336-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/select_stmt.rs:101\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56488b23115fe6d7fb4ab7184d17239c51990d9033b69bde5e25ebcb324094a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pgls_workspace/src/workspace/server.rs:1521-1534 | crates/pgls_workspace/src/workspace/server.rs:1576-1589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_workspace/src/workspace/server.rs:1521\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060GetCompletionsParams\u0060 in one and \u0060OnHoverParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9d3320d337641b74df33dd23818a854b303782d32d2df9bde888f40e6035a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pgls_lsp/src/handlers/inlay_hints.rs:26-38 | crates/pgls_lsp/src/handlers/semantic_tokens.rs:88-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_lsp/src/handlers/inlay_hints.rs:26\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/inlay_hints.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"935173922cedc93f0b38ca5647eb766fd0c4f5aa9b74c7406e0d62e73d3a1148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pgls_lsp/src/server.rs:216-228 | crates/pgls_lsp/src/session.rs:282-294 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/server.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38de28d7641e09e138a42bf5fd54035a9ee5f6dee5998b65d4ef2107d47fc5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/a_expr.rs:154-166 | crates/pgls_pretty_print/src/nodes/a_expr.rs:181-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc4b177d0fc8c2e391cffb3457a2126b944fa21fad6d986b27b5e207e083b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/reindex_stmt.rs:14-26 | crates/pgls_pretty_print/src/nodes/vacuum_stmt.rs:18-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/reindex_stmt.rs:14\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/reindex_stmt.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71c553012c8199f75089b069ddde5a35e2c4a38266a697077da1ce154c50f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pgls_treesitter/src/helper.rs:89-101 | crates/pgls_treesitter/src/helper.rs:107-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_treesitter/src/helper.rs:89\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/helper.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"220ffd0d89c3e0e9c2fa47b1dfb997bb7d6e1e630703028ee865cb0ebe91d3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/pgls_configuration/src/rules/configuration.rs:39-50 | crates/pgls_configuration/src/rules/configuration.rs:111-122 | crates/pgls_configuration/src/rules/configuration.rs:214-225 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration/src/rules/configuration.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"391cacd8cd0908205ebdfa81766bcc349e96a428652c9a43f03027a4452379a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/constraint.rs:217-228 | crates/pgls_pretty_print/src/nodes/constraint.rs:282-293 | crates/pgls_pretty_print/src/nodes/constraint.rs:342-353 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/constraint.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f26564a9cbe94193f43cb55f8e5fcce47b3f8f6d6261837ba2d990d85f063f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_cli/src/commands/daemon.rs:144-155 | crates/pgls_cli/src/commands/daemon.rs:159-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/commands/daemon.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d628331b7f5abcb766aef59310e4a0caf0e0c4a2bd3a10f7529636b999926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/a_expr.rs:209-220 | crates/pgls_pretty_print/src/nodes/a_expr.rs:235-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bceffcb0887f78f5db853ac3e28448d3ae0a6645d544eb6c50f3dfbcfd16b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs:31-42 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:130-141 \u2014 before extracting anything, compare \u0060crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs\u0060 and \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:130\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4066ecd47c4b4460722d6caafa1497dc11ce3ccc05f9766814b08093ff47283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_stmt.rs:82-93 | crates/pgls_pretty_print/src/nodes/create_stmt.rs:132-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_stmt.rs:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac62105a7dc39e6306315ec797c3811c17c63a454e92b7c970a1ef3fadf5fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/on_conflict_clause.rs:28-39 | crates/pgls_pretty_print/src/nodes/on_conflict_expr.rs:33-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/on_conflict_clause.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026OnConflictClause\u0060 in one and \u0060\u0026OnConflictExpr\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/on_conflict_clause.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c89c4a4739bb81fce29fa0530f69bd5e717b992e791feaecdbd665e916b170"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/range_subselect.rs:19-29 | crates/pgls_pretty_print/src/nodes/range_table_func.rs:94-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/range_subselect.rs:19\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026RangeSubselect\u0060 in one and \u0060\u0026RangeTableFunc\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/range_subselect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f38bda6f3e522667a716414c0af8ee9e76a0d35929ab3057c9333f2a5176ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_query_macros/src/node_mut.rs:6-17 | crates/pgls_query_macros/src/node_ref.rs:6-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_query_macros/src/node_mut.rs:6\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/node_mut.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"262d369478edb7169086a488e634e1d6beb37d4de31d533046ef6c23d0875b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:946-957 | xtask/codegen/src/generate_configuration.rs:1464-1475 \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 \u0060xtask/codegen/src/generate_configuration.rs:946\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbab8651f007ad6619556e5cc9c4c0370bd8a0bf2a9f2f4e1ef42f0bcecf4963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/pgls_configuration/src/format.rs:362-372 | crates/pgls_pretty_print/src/config.rs:114-124 | crates/pgls_workspace/src/settings.rs:701-711 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration/src/format.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35727b5357a1b7925ae6af8133d67c4d2dd1bbecc597f54424baabb6b0c63cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/json_array_agg.rs:43-53 | crates/pgls_pretty_print/src/nodes/json_array_constructor.rs:25-35 | crates/pgls_pretty_print/src/nodes/json_object_agg.rs:44-54 \u2014 before extracting anything, compare \u0060crates/pgls_pretty_print/src/nodes/json_array_agg.rs\u0060 and \u0060crates/pgls_pretty_print/src/nodes/json_object_agg.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/json_array_agg.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026JsonArrayAgg\u0060 in one and \u0060\u0026JsonArrayConstructor\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e679947d95ce8056788d915344b92ea3757b2b8c7d48d7060012cfa36d42d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_configuration_macros/src/partial_derive/attrs.rs:52-62 | crates/pgls_configuration_macros/src/partial_derive/attrs.rs:92-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_configuration_macros/src/partial_derive/attrs.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration_macros/src/partial_derive/attrs.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949bd09c704f9c193f75dfd668cedb1b72eb05452d9558cf0f57dac321e116a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_diagnostics/src/display/diff.rs:558-568 | crates/pgls_diagnostics/src/display/diff.rs:573-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_diagnostics/src/display/diff.rs:558\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/diff.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c6de5109ce6be9925faa078920fff7cf3773fd21ab10f58bbbc06b223166fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_diagnostics_macros/src/generate.rs:27-37 | crates/pgls_diagnostics_macros/src/generate.rs:265-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_diagnostics_macros/src/generate.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060DeriveStructInput\u0060 in one and \u0060DeriveEnumInput\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics_macros/src/generate.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a441d667702959fad5c776132fa0c791a190045057ec47e4c55e344846e9f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/a_expr.rs:220-230 | crates/pgls_pretty_print/src/nodes/a_expr.rs:248-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:220\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:245\u0060 calls \u0060token\u0060, \u0060space\u0060 and \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:217\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5730e7622726175dbc4eec3e42a7c1699793e02f9c90783862260b711ea8d273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs:70-80 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:220-230 \u2014 before extracting anything, compare \u0060crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs\u0060 and \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0185681acb05bdfd330046c29b5ae69039317b3f87ddd68ea0deafb42961314d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs:85-95 | crates/pgls_pretty_print/src/nodes/define_stmt.rs:164-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3773c0d47b0d75e64859aa5fb447353ac29e76ce0ee86d4c82076902b97561f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/clauses/options.rs:214-224 | crates/pgls_pretty_print/src/nodes/clauses/options.rs:227-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/clauses/options.rs:214\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"820d1a57e38a750b505c01a8c71c81e88229cd0c51c4ada632b3aafa0cd5ab06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs:70-80 | crates/pgls_pretty_print/src/nodes/grant_stmt.rs:154-164 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e1df7249d1b86cbea006beeda5a6a5e41ffe5f696e7633b74f5f03ec86c416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/index_elem.rs:6-16 | crates/pgls_pretty_print/src/nodes/stats_elem.rs:6-16 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026IndexElem\u0060 in one and \u0060\u0026StatsElem\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/index_elem.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd06571b223469c487f16bcbea979af638e981af3b03c0ad57d22c451e2182a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/index_elem.rs:22-32 | crates/pgls_pretty_print/src/nodes/partition_elem.rs:19-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/index_elem.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026IndexElem\u0060 in one and \u0060\u0026PartitionElem\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pgls_pretty_print/src/nodes/index_elem.rs:14\u0060 calls \u0060is_empty\u0060, \u0060emit_identifier_maybe_quoted\u0060 and \u0060crates/pgls_pretty_print/src/nodes/partition_elem.rs:15\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/index_elem.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"476135ca2d624a0ff9f12d97c693ce558106a059892d80c77659cd5b4b054aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/json_constructor_expr.rs:43-53 | crates/pgls_pretty_print/src/nodes/json_object_constructor.rs:18-28 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026JsonConstructorExpr\u0060 in one and \u0060\u0026JsonObjectConstructor\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_constructor_expr.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b150c56a2b789f75f3c4f48ecac37b161608bbd65af3c82c67f59f82512e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/range_function.rs:89-98 | crates/pgls_pretty_print/src/nodes/range_function.rs:108-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/range_function.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/range_function.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0641e0e2537f1016aaa43e7f82536c34be73f2cb6bdd6ebe30ff987f358a79e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print_codegen/src/proto_analyser.rs:38-48 | crates/pgls_query_macros/src/proto_analyser.rs:129-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print_codegen/src/proto_analyser.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print_codegen/src/proto_analyser.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c2e4d4be7efeddeffee42e95094c689ff9a01e3f027d8546b701b33c86ee4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:460-471 | xtask/codegen/src/generate_pglinter.rs:482-493 \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 \u0060xtask/codegen/src/generate_pglinter.rs:460\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":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"028b450be8ae8dc56ef0068c50e1b673435205fc6a09ac028a4c3823b9c1980c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs:73-82 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:51-60 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:223-232 \u2014 before extracting anything, compare \u0060crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs\u0060 and \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs:73\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_domain_stmt.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"840f1068039e16a5863ee6756eae54d5f6b8987d44479e395f0d4b39595c1690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/pgls_catalog/src/catalog/base.rs:62-71 | crates/pgls_catalog/src/catalog/base.rs:248-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_catalog/src/catalog/base.rs:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/base.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3823351ff5160ef5d1b651632eaa4dfefdf53b9d3a0c2ed17d9b210b7d4d94fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_catalog/src/catalog/overlay.rs:250-259 | crates/pgls_catalog/src/catalog/overlay.rs:657-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_catalog/src/catalog/overlay.rs:250\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/overlay.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63c57eb0132dd988331f2fb50756522dede86fa332a774797f6f3daf07dba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_diagnostics/src/display/frame.rs:74-83 | crates/pgls_diagnostics/src/display/frame.rs:121-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae10c2183895cdd1cdafabc30f3b09f09188105a67da83bc1b4fe9460d96421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_diagnostics/src/display_github.rs:94-103 | crates/pgls_diagnostics/src/display_github.rs:112-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_diagnostics/src/display_github.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_diagnostics/src/display_github.rs:123\u0060 calls \u0060push_str\u0060 and \u0060crates/pgls_diagnostics/src/display_github.rs:105\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display_github.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec4e1550cbf3386099275def3d53c0c065eab5cd67cbdc1572b4654d545b1db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_type_stmt.rs:24-33 | crates/pgls_pretty_print/src/nodes/index_elem.rs:38-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_type_stmt.rs:24\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_type_stmt.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"67901f7142704d654e91cfba8f5c9e629c3766f27bfdad66cc380a8c5aefd71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/clauses/set_clause.rs:131-140 | crates/pgls_pretty_print/src/nodes/select_stmt.rs:438-451 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/clauses/set_clause.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/set_clause.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"729e288831d9e09ddf0c2ad000ed32d2328064791600ae76c6a0e622e69677c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_publication_stmt.rs:36-45 | crates/pgls_pretty_print/src/nodes/publication_table.rs:8-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_publication_stmt.rs:36\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_publication_stmt.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7be6cbac3b794960a3ccb7ae49abe0c02d6d2d9227e670af95b38e155aab59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:98-107 | crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:109-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:98\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 before the matched lines, \u0060crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:96\u0060 calls \u0060space\u0060, \u0060token\u0060, \u0060IDENT\u0060 and \u0060crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:108\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"441bcaff3aff0e34e4f223852039945e676e893b2ec9e3db921b03d321a6b879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/type_name.rs:236-245 | crates/pgls_pretty_print/src/nodes/type_name.rs:249-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/type_name.rs:236\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/type_name.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f871f4ff2222cfd8e9a0ddb88d7298b795b358f09ad2281cddee4770a6f13ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/pgls_wasm/src/lsp.rs:261-270 | crates/pgls_wasm/src/lsp.rs:313-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/lsp.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"829c5a8b434a4882e559f5e2119db3ac334f38948e065bb1ae88b29286f51989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:1047-1056 | xtask/codegen/src/generate_configuration.rs:1512-1521 \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 \u0060xtask/codegen/src/generate_configuration.rs:1047\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"313034378819638ec5bf800fe4c41bacede6d5863d38de57dca4c2c026cf1730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:144-152 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:175-183 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:315-323 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:373-381 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:391-399 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:185\u0060 calls \u0060line\u0060, \u0060token\u0060 and \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:154\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68be2c837eed6e7267541b119ed52a5463033930718a170cc73291004034ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/pgls_catalog/src/resolve/expr/a_expr.rs:29-37 | crates/pgls_catalog/src/resolve/expr/a_expr.rs:51-59 | crates/pgls_catalog/src/resolve/expr/a_expr.rs:212-220 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_catalog/src/resolve/expr/a_expr.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/expr/a_expr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cb007f1d14a394c162094a126d7ec63733724aa8096c3d6cc08c99876bb043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:159-167 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:197-205 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:683-691 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a9b7d5ac0862c2b3accfb5c9a0784d22605778201c214f60cf2468724d8477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pgls_cli/src/service/windows.rs:160-172 | crates/pgls_cli/src/service/windows.rs:293-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/windows.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b9aacdff569445e03671177fbcaf0c571289084d33c46557e2c729346153f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_console/src/markup.rs:202-210 | crates/pgls_console/src/markup.rs:224-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_console/src/markup.rs:202\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_console/src/markup.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97262f99d0340e4e4f332eeffa65b10cd7a03d0f83950f88f1d00929d792121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/a_expr.rs:454-462 | crates/pgls_pretty_print/src/nodes/a_expr.rs:514-522 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:523\u0060 calls \u0060token\u0060, \u0060space\u0060 and \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:465\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63b161229cb168715d3fb3b6f85e7ec9bd6825cd468141f944aa9b6be073413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/aggref.rs:46-54 | crates/pgls_pretty_print/src/nodes/window_func.rs:29-37 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026Aggref\u0060 in one and \u0060\u0026WindowFunc\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pgls_pretty_print/src/nodes/window_func.rs:27\u0060 calls \u0060token\u0060 and \u0060crates/pgls_pretty_print/src/nodes/aggref.rs:44\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/aggref.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2180350e1ee3df62cd509b75c3f16c3f345a1b6a52ce9fcebe88ad7cceeb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alias.rs:20-28 | crates/pgls_pretty_print/src/nodes/join_expr.rs:156-163 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alias.rs:20\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alias.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfd7f94b82ed80147e04cfe2b987c7d109f99c45da01374ed04c45ec18d0fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_default_privileges_stmt.rs:29-37 | crates/pgls_pretty_print/src/nodes/alter_default_privileges_stmt.rs:43-51 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_default_privileges_stmt.rs:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_default_privileges_stmt.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f327c20db830aca7005aaa2ead38b5923b0e4a2ed521dd8501469ab8c7eae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_publication_stmt.rs:44-52 | crates/pgls_pretty_print/src/nodes/create_publication_stmt.rs:14-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_publication_stmt.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026AlterPublicationStmt\u0060 in one and \u0060\u0026CreatePublicationStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_publication_stmt.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49948ef93504cb9f1896699c0ffb1b563a02fd8d42760f02a12bc1ed182930a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_stmt.rs:230-239 | crates/pgls_pretty_print/src/nodes/into_clause.rs:62-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_stmt.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce95e423e0266bd2d01f92009d9e7b1f3852972cbb4576a1b85f352e1a1c007f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs:103-111 | crates/pgls_pretty_print/src/nodes/into_clause.rs:95-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b57918a684c18e136ed868881a2c8e78ecdcd512514139b1e9da0f7872df38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/select_stmt.rs:91-99 | crates/pgls_pretty_print/src/nodes/select_stmt.rs:326-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/select_stmt.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d512c9285ada355d0082611bcafc4efb680b551d6e4f1ab295c2aec696c115a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/sub_link.rs:23-32 | crates/pgls_pretty_print/src/nodes/sub_link.rs:70-78 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_pretty_print/src/nodes/sub_link.rs:35\u0060 calls \u0060space\u0060, \u0060token\u0060 and \u0060crates/pgls_pretty_print/src/nodes/sub_link.rs:81\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/sub_link.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcdd7021b57954fa41ea915152be5f9e3dc3b61f34a418cc4ef4269304abc79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/pgls_query/src/split.rs:27-33 | crates/pgls_query/src/split.rs:62-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_query/src/split.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query/src/split.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb549f86d0e2e28e02fb00e10e576dd8b966c7cf7c641f7b2212f23825ba8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_treesitter/src/queries/insert_columns.rs:51-59 | crates/pgls_treesitter/src/queries/table_aliases.rs:100-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_treesitter/src/queries/insert_columns.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/insert_columns.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"663d4be6f26be972f5394c208aa21510e901e86f215d45562928404281898109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_treesitter/src/queries/mod.rs:62-70 | crates/pgls_treesitter/src/queries/mod.rs:72-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110e1d820c1a734c7f81ed8790794bed0bb4b568888cf08e4cd55a37488832d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:971-979 | xtask/codegen/src/generate_configuration.rs:1483-1489 \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 \u0060xtask/codegen/src/generate_configuration.rs:971\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca54a07aaaf25bb64417cb2c77bdf9aa6b871d806e8695543054cbdbf5aee250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:1142-1150 | xtask/codegen/src/generate_configuration.rs:1542-1550 \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 \u0060xtask/codegen/src/generate_configuration.rs:1142\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6407b40a428ec41b97cbb5e9ae8ef4fafccf14ed3047249d68e17e011c990b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11): crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:143-150 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:158-165 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:174-181 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:196-203 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:314-321 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:332-339 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:348-356 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:372-379 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:390-397 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:682-689 | crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:719-726 \u2014 all 11 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:143\u0060 calls \u0060token\u0060 and \u0060crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs:348\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fa334c04772c459e834cda2cca4afaf97c8b1bbc546d0f5dbd68f1c978162a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_lexer_codegen/src/syntax_kind.rs:120-129 | crates/pgls_pretty_print_codegen/src/token_kind.rs:132-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_lexer_codegen/src/syntax_kind.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pgls_lexer_codegen/src/syntax_kind.rs:117\u0060 calls \u0060push\u0060 and \u0060crates/pgls_pretty_print_codegen/src/token_kind.rs:131\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer_codegen/src/syntax_kind.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3abfd8b9c70ef748a126715ce33ce7f6fcb74a505ca9f58780cfe1730f3c1c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/copy_stmt.rs:56-63 | crates/pgls_pretty_print/src/nodes/create_stmt.rs:236-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/copy_stmt.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/copy_stmt.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bb49b363c798af0516a802f44414a1fa8f7e7d4e9773d87823c9e9b5e295bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/create_transform_stmt.rs:38-45 | crates/pgls_pretty_print/src/nodes/create_transform_stmt.rs:55-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_transform_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf0fcccd707fa41098916c289ee465d023dd0b499be989263d7c6f458001f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/json_array_agg.rs:32-39 | crates/pgls_pretty_print/src/nodes/json_object_agg.rs:33-40 \u2014 before extracting anything, compare \u0060crates/pgls_pretty_print/src/nodes/json_array_agg.rs\u0060 and \u0060crates/pgls_pretty_print/src/nodes/json_object_agg.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/json_array_agg.rs:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d178ab16a74852965eb84a53c8359de6f291cfc4409e77cb7cd37adf4db68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_pretty_print/src/normalize.rs:219-226 | crates/pgls_pretty_print/src/normalize.rs:228-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/normalize.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06c0e42fb83adaa61c2318fcb852a4a4af9cd9a08ab74bf7e05942e9e029844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_pretty_print/src/renderer.rs:87-94 | crates/pgls_pretty_print/src/renderer.rs:241-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/renderer.rs:87\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/renderer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"08188f54e2bb811d09a31d305ef8f3a47d11b3ed7a44a51224804462a3ab9846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/pgls_statement_splitter/src/splitter/common.rs:54-59 | crates/pgls_statement_splitter/src/splitter/dml.rs:64-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_statement_splitter/src/splitter/dml.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/splitter/common.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dae2cb7f6bc615a949c95f9c15f4b89ee45e1cc64c0968f91f7f6ed026e8b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_treesitter/src/queries/relations.rs:61-68 | crates/pgls_treesitter/src/queries/select_columns.rs:67-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_treesitter/src/queries/relations.rs:61\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/relations.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7843ba503e86a85d7b08bf7b7e8f5664eea7aba6a79263de204c233a762d256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pgls_workspace/src/workspace/server.rs:1653-1660 | crates/pgls_workspace/src/workspace/server.rs:1725-1732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_workspace/src/workspace/server.rs:1653\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"f773705ffed9bd99da0a37ec2555642ca2455b1a4e7a4d25530996a23bd0ab19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/pgls_pretty_print/src/nodes/comment_stmt.rs:38-44 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:58-64 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:76-82 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:94-100 | crates/pgls_pretty_print/src/nodes/comment_stmt.rs:112-118 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/comment_stmt.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_pretty_print/src/nodes/comment_stmt.rs:45\u0060 calls \u0060emit_keyword\u0060, \u0060space\u0060 and \u0060crates/pgls_pretty_print/src/nodes/comment_stmt.rs:66\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/comment_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bd3cf5682d3d95abfc24b50e43e789c9efadcfb6b5cd6a32723253124f716a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/pgls_cli/src/service/windows.rs:139-144 | crates/pgls_cli/src/service/windows.rs:164-170 | crates/pgls_cli/src/service/windows.rs:272-277 | crates/pgls_cli/src/service/windows.rs:297-303 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_cli/src/service/windows.rs:139\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/windows.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69ce83cab05d94af39425adc7e7dee1b26e5e44aa3e07f753b61bfd3c0895b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/pgls_query/src/deparse.rs:39-44 | crates/pgls_query/src/fingerprint.rs:27-32 | crates/pgls_query/src/normalize.rs:19-24 | crates/pgls_query/src/parse.rs:25-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_query/src/deparse.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query/src/deparse.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb684b5b036e70ad218f9a761ac9f835488d02608a67e41027d6142cf38610b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs:27-33 | crates/pgls_catalog/src/resolve/nodes/update_stmt.rs:31-37 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026DeleteStmt\u0060 in one and \u0060\u0026UpdateStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_catalog/src/resolve/nodes/update_stmt.rs:41\u0060 calls \u0060resolve_set_clause\u0060 and \u0060crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs:37\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f65fc0e3de73bf548b143ae14c5731b7a2eac0f395af72ab1940d2ec20adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_diagnostics_macros/src/generate.rs:192-198 | crates/pgls_diagnostics_macros/src/generate.rs:207-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_diagnostics_macros/src/generate.rs:192\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics_macros/src/generate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e5e899c7aa8183f9aa26406f58fa1abaae3c686fae84f9cc2ca4bfa809fbb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_fs/src/fs/os.rs:38-44 | crates/pgls_fs/src/fs/os.rs:51-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_fs/src/fs/os.rs:38\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/os.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2efef731c0b39e8dcd273608b3ee60e271d3aba2d491c010dd1003ae790e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_tsdictionary_stmt.rs:23-29 | crates/pgls_pretty_print/src/nodes/create_stmt.rs:241-247 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_tsdictionary_stmt.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6afb6d34344119f2634b73d05f5994c491d620137ddf35e69c7944a33c604a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_query_macros/src/iter_mut.rs:107-113 | crates/pgls_query_macros/src/iter_ref.rs:75-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_query_macros/src/iter_mut.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/iter_mut.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0dde861ddb6681f8403ff06036c4e8060b24ad683469370b1ec5422be24719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:291-298 | xtask/codegen/src/generate_configuration.rs:1270-1277 \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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d4ca8d0623b6e3ed8f54b5826bced9afb32097af43d07e1055db93ebe14e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:707-713 | xtask/codegen/src/generate_configuration.rs:1331-1337 \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 \u0060xtask/codegen/src/generate_configuration.rs:707\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a0a61cc60032c60edc44ee3b684ddaa754c5b94f6736c4fc0203d1af6fe29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/pgls_workspace/src/workspace/server.rs:883-888 | crates/pgls_workspace/src/workspace/server.rs:1520-1525 | crates/pgls_workspace/src/workspace/server.rs:1575-1580 | crates/pgls_workspace/src/workspace/server.rs:1634-1639 | crates/pgls_workspace/src/workspace/server.rs:1713-1718 \u2014 all 5 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060CodeActionsParams\u0060 in one and \u0060GetCompletionsParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_workspace/src/workspace/server.rs:1719\u0060 calls \u0060is_none_or\u0060, \u0060Ok\u0060, \u0060default\u0060 and \u0060crates/pgls_workspace/src/workspace/server.rs:1528\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c945cf6a93fecdb5f4e45ffd6e4602833e2588a582a47c49c6cec64ea479e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/pgls_query/src/fingerprint.rs:27-32 | crates/pgls_query/src/normalize.rs:19-24 | crates/pgls_query/src/parse.rs:25-30 | crates/pgls_query/src/plpgsql.rs:28-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_query/src/fingerprint.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query/src/fingerprint.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5c819cf91b766a97c25eb031e4437f1dd818344a89770aa322b43705e7bded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs:22-27 | crates/pgls_pretty_print/src/nodes/alter_type_stmt.rs:18-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026AlterOperatorStmt\u0060 in one and \u0060\u0026AlterTypeStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_operator_stmt.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f56b3bc14763cbe58fb9716bad84d0880ef987ac8f91a8f2a0547dbf7ecf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pgls_suppressions/src/suppression.rs:133-138 | crates/pgls_suppressions/src/suppression.rs:140-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_suppressions/src/suppression.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec394a1a08135b6e752b16f42ff54cd9cadc21e314774366c2101f425cecc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:1087-1092 | xtask/codegen/src/generate_configuration.rs:1526-1531 \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 \u0060xtask/codegen/src/generate_configuration.rs:1087\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcd94b98f950daac7deb15354943c7f2472b677bafb64e736752d423ce14498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/pgls_catalog/src/resolve/expr/a_expr.rs:28-35 | crates/pgls_catalog/src/resolve/expr/a_expr.rs:50-57 | crates/pgls_catalog/src/resolve/expr/a_expr.rs:84-88 | crates/pgls_catalog/src/resolve/expr/a_expr.rs:163-167 | crates/pgls_catalog/src/resolve/expr/a_expr.rs:211-218 \u2014 all 5 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/expr/a_expr.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c663d156a0279dd6b72537e5d03a922f8e9bee789db7a2641af6afce1d5530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/delete_stmt.rs:38-42 | crates/pgls_pretty_print/src/nodes/merge_stmt.rs:68-72 | crates/pgls_pretty_print/src/nodes/update_stmt.rs:47-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/delete_stmt.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026DeleteStmt\u0060 in one and \u0060\u0026MergeStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/delete_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5e3c6edfa60624eec3e7365c0d27c25a8d0d2d46cac3e6970e23e022ded8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/dropdb_stmt.rs:24-28 | crates/pgls_pretty_print/src/nodes/vacuum_stmt.rs:16-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/dropdb_stmt.rs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026DropdbStmt\u0060 in one and \u0060\u0026VacuumStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/dropdb_stmt.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"204be4ae5c001a0977371e7e8e621d01c2efbaaed71e86571e7f84fbe7720cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pgls_text_size/src/text_range_replacement.rs:118-123 | crates/pgls_text_size/src/text_range_replacement.rs:137-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_text_size/src/text_range_replacement.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_text_size/src/text_range_replacement.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e38f46abfecf8f1fd413be8bb8f77fdfcbfeffdc8324acd6edff31cd41d20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:688-692 | xtask/codegen/src/generate_configuration.rs:1059-1063 \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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bd86988fb49266aefbf88e8a3b3e4477236ba3ef0c41c3ff0f0ad0e600bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/pgls_catalog/src/identifier.rs:16-24 | crates/pgls_pretty_print/src/identifiers.rs:55-63 | crates/pgls_semantic_tokens/src/lib.rs:304-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/identifier.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c6eb5b528d91c3a7a019435315f03743d923a18b6db4c102e232aed96e92b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/pgls_configuration/src/plpgsql_check.rs:65-80 | crates/pgls_workspace/src/settings.rs:785-800 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration/src/plpgsql_check.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae6cfdc73952764184b795978aad61b7a9288f2b96a022973c7f65f5a5fa47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_lsp/src/handlers/code_actions.rs:187-193 | crates/pgls_wasm/src/lsp.rs:665-671 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060requested\u0060 to \u0060\u0026ls_types::CodeActionKind\u0060 in one and \u0060\u0026CodeActionKind\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/code_actions.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"04819eb265d011b59599aa06cbad229b3a2b7be7f7f0fc0ebcd9dc912764393b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pgls_pglinter/src/diagnostics.rs:252-258 | xtask/codegen/src/lib.rs:161-167 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pglinter/src/diagnostics.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"deed8368eff3ebc53783bc1625c13d445c5b35efda948dffb8729efaca31c3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/alter_owner_stmt.rs:63-68 | crates/pgls_pretty_print/src/nodes/rename_stmt.rs:132-138 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_owner_stmt.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d073e586aaedad49eae670d11f395d5c67995d363806f078373fc18eaca3203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pgls_query_ext/src/function_body.rs:219-224 | crates/pgls_semantic_tokens/src/lib.rs:295-300 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_ext/src/function_body.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d35d009c4191ba1fb0deaba3a46b73aacb9c2202749d883ad3b938f821d2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_treesitter/src/queries/select_columns.rs:30-38 | crates/pgls_treesitter/src/queries/where_columns.rs:40-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/select_columns.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddafc0ad2249d795f6834436211f183d9d811ffcd25ab869dc9d5504558bcf4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs:16-24 | crates/pgls_catalog/src/resolve/nodes/insert_stmt.rs:32-40 | crates/pgls_catalog/src/resolve/nodes/update_stmt.rs:20-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026DeleteStmt\u0060 in one and \u0060\u0026InsertStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/delete_stmt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c269ca9acf633f55e325804806908f01493ec714ad74d570441c6c7e08791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/float.rs:5-9 | crates/pgls_pretty_print/src/nodes/integer.rs:5-9 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026Float\u0060 in one and \u0060\u0026Integer\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/float.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e5ade05703fa3490313f9c6234d40a639adbc0227fe83f73662a11b9155ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/load_stmt.rs:5-16 | crates/pgls_pretty_print/src/nodes/variable_show_stmt.rs:5-16 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026LoadStmt\u0060 in one and \u0060\u0026VariableShowStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/load_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9fc76c773a253b016d3dcfea24df3a78804fef66bbd404c2837fd5209ea516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/multi_assign_ref.rs:5-13 | crates/pgls_pretty_print/src/nodes/raw_stmt.rs:5-13 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060n\u0060 to \u0060\u0026MultiAssignRef\u0060 in one and \u0060\u0026RawStmt\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/multi_assign_ref.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"477b550107f7e672d6ab9a879dc229c99cb1a0a964bca204fe11b416293b34e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/pgls_treesitter/src/queries/insert_columns.rs:35-42 | crates/pgls_treesitter/src/queries/select_columns.rs:51-58 | crates/pgls_treesitter/src/queries/where_columns.rs:61-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/insert_columns.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4153040198b807fba9d65011684d13a8d9c2347774e4de4939cb7a9a04c3f3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:634-647 | xtask/codegen/src/generate_splinter.rs:660-676 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_pglinter.rs:634\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":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a76c4339561bf5ba52f5011af8827737a67b4f9fe17ebb6c73872327fedb84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): xtask/codegen/src/generate_pglinter.rs:455-466 | xtask/codegen/src/generate_splinter.rs:470-481 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_pglinter.rs\u0060 and \u0060xtask/codegen/src/generate_splinter.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_pglinter.rs:455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rules\u0060 to \u0060\u0026BTreeMap\u003CString, PglinterRuleMeta\u003E\u0060 in one and \u0060\u0026BTreeMap\u003CString, SqlRuleMetadata\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_pglinter.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"45287b16032c9d79b6495dbdecbee26a5e2b029c15d3f44f854007c80b1d0ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/a_expr.rs:330-341 | crates/pgls_pretty_print/src/nodes/a_expr.rs:355-366 | crates/pgls_pretty_print/src/nodes/a_expr.rs:380-391 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:330\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:394\u0060 calls \u0060space\u0060, \u0060token\u0060 and \u0060crates/pgls_pretty_print/src/nodes/a_expr.rs:345\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3877302fc2615dbd786c1f6f737bae0eb780d7f88bff0d48b2fe83f66acd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/pgls_pretty_print/src/nodes/clauses/options.rs:228-238 | crates/pgls_pretty_print/src/nodes/clauses/options.rs:242-252 | crates/pgls_pretty_print/src/nodes/create_extension_stmt.rs:55-65 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/clauses/options.rs:228\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, \u0060crates/pgls_pretty_print/src/nodes/clauses/options.rs:240\u0060 calls \u0060space\u0060, \u0060token\u0060 and \u0060crates/pgls_pretty_print/src/nodes/clauses/options.rs:254\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/options.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2abd4e904c19e4bbdfd324c696559caaf37566bc0ede59bbc2e6f54694719b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/clauses/window_frame.rs:127-137 | crates/pgls_pretty_print/src/nodes/clauses/window_frame.rs:160-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/clauses/window_frame.rs:127\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/clauses/window_frame.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b46b7621f6c1c3ab42f8b5dd74b819b74f2a7669e95874085de0edea513342b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/pgls_cli/src/service/unix.rs:33-43 | crates/pgls_cli/src/service/windows.rs:36-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_cli/src/service/unix.rs:33\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773fd85fc67a6d3cf9e88475fe52bbfae61cc23ac7cd36477d08a808a082e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_wasm/src/ffi.rs:242-251 | crates/pgls_wasm/src/ffi.rs:273-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_wasm/src/ffi.rs:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/ffi.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbdf02b9b23d426b9a96541c2921c27f690da662f8fcf96ef10666b1d95b93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/pgls_fs/src/fs.rs:159-168 | crates/pgls_fs/src/fs.rs:169-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_fs/src/fs.rs:159\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe4365d0d86c6c87029559ede799660fd5ede776411d92a2ef6664cd08da6e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/codegen/src/rules_index.rs:33-42 | docs/codegen/src/rules_index.rs:203-212 \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 \u0060docs/codegen/src/rules_index.rs:33\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":"docs/codegen/src/rules_index.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d312b11efd3033d177cdd73e3e2f394910680c70db49a112f927c95abad11a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pgls_pretty_print/src/nodes/do_stmt.rs:18-26 | crates/pgls_pretty_print/src/nodes/do_stmt.rs:32-37 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/do_stmt.rs:18\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/do_stmt.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"41edff6e54eeeed2ca169770e5190a6c7251edda8b4dc99c51253ca64115df09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): xtask/codegen/src/generate_splinter.rs:212-219 | xtask/codegen/src/generate_splinter.rs:433-440 \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 \u0060xtask/codegen/src/generate_splinter.rs:212\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":"xtask/codegen/src/generate_splinter.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"54909db3a32e95992723d9fbdc11c55fc0e847a59b02540a95bf83b5028a717a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:43-48 | crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:67-72 | crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:79-84 | crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:91-96 | crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:103-108 | crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:115-120 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pgls_pretty_print/src/nodes/create_role_stmt.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_role_stmt.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a598999cc86e75f0ffe8c05ab1ae5cc49d5b6886bb5a60b03975ed4bf6d899"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pgls_cli: pgls_cli has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fb0de7dd4afea87dd311c4458c3df208720d16e55b44903d23c9c83f8a092e10"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pgls_lsp: pgls_lsp has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa322aea77ccb5e3e19012be4ddefe242e80fe09a953e23c7025c3645089473c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pgls_plpgsql_check: pgls_plpgsql_check has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6783c9ba56bff41182bc88fd1ba09100e07d262c08570d03f01400b391aa4f1a"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pgls_suppressions: pgls_suppressions has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0204de9c004cf38c47e1cbf17b2db27f6ebcb51fac42e35b2b2f2a25659589f1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pgls_typecheck: pgls_typecheck has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a63ad9b1f6d5764be6bbbffe230d8ac986026b61e6221e779e832e014776ed82"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pgls_workspace: pgls_workspace has instability 0.83 with 6 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"933b83538fb3307dfcca91789d4199ad444ad3e692117a7ac9b32666236beed2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_tokenizer: pgls_tokenizer: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f8d87a4e0b87df24dca9b0e84db100cddcb9bc380cb476ecf74d452323fd16ca"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_query: pgls_query: abstractness 0.00, instability 0.06, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3fc610ea6a889c900b4886a64660d7850aba08a6be134b8c8f79888fc4d19914"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_line_index: pgls_line_index: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fb581d5dcd499d3994538eb00669532435d9536b60991551fffb23eb76ccfe40"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_env: pgls_env: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f83405c869e402a159031c05da2ee50565d308f953358f960f92cb8d17b1f097"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_text_edit: pgls_text_edit: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f291e85d899db144b1bc6872755c603ef3d46d159ee72ffe057b3299e537187f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_catalog: pgls_catalog: abstractness 0.03, instability 0.17, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 19 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c2d1840733624c042b907fb08914e6a25038cf8a277c1e1d1535c2bdba29ef37"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pgls_text_size: pgls_text_size: abstractness 0.29, instability 0.00, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 25 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f5cd9400216ec559d77706f59706fdd21cc47e35be951efc7952760860522795"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OsFileSystem (LCOM4 6): OsFileSystem\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/os.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c57f75196acb532fc25e50f668eaf1abbc3fa64c75358cf4803b46487e4990"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AnalysableStatement (LCOM4 5): AnalysableStatement\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/statement.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aedf92c06362ddc638f4bbddfbe49a61b52fc8ebf5cc2d80983965fa5ed3850"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LinterDiagnostic (LCOM4 4): LinterDiagnostic\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/linter_rule.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d8251d0da1447f391e53258caa5763945e3360d9dcbf4b285e4ef8f287e0a2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MemoryFileSystem (LCOM4 4): MemoryFileSystem\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/memory.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be0dd6c84b49de5adef326165e2e881b3ac4f3aee1fd5c8b3dd0b5e7840f478"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the node:test suite in crates/pgls_treesitter_grammar/ ran but wrote no lcov report. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (unnamed test): Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/wasm/e2e/monaco.test.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9272d3c45fdcb7c1cf9bdd65a4affa0f89f835586d3e69412742a9f2cd5bf1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_workspace/src/workspace/server.rs: crates/pgls_workspace/src/workspace/server.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WorkspaceServer::database_diagnostics at line 434. 21 of those changes were fix/bug commits, and the other 43 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_workspace/src/workspace/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec9dd7001be0f6d9ed8377a7eef940dcbae6df03ba2b92c7c1aa60436f7c10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/select_stmt.rs: crates/pgls_pretty_print/src/nodes/select_stmt.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in pgls_pretty_print::nodes::select_stmt::emit_select_stmt at line 7. 9 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/select_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/select_stmt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"664819b9c3546552f0e8f58f200d93d34c0ae17153b1564a6b51bd988a9427f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/constraint.rs: crates/pgls_pretty_print/src/nodes/constraint.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in pgls_pretty_print::nodes::constraint::emit_constraint_of at line 27. 7 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/constraint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/constraint.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"843691d61a6a23840f596ad3b4cb30c1e3e5ec2eceaa87f95f475a3877a7c209"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/normalize.rs: crates/pgls_pretty_print/src/normalize.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in pgls_pretty_print::normalize::clear_location at line 88. 5 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/normalize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/normalize.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cb131f15d196d0d10f219f6dddf76509b6ca3b3aa907ed30395ff8732a5c33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_completions/src/relevance/filtering.rs: crates/pgls_completions/src/relevance/filtering.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in CompletionFilter::check_clause at line 265. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_completions/src/relevance/filtering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe985a9c8e881be46bd1d17232f234d40465153975f551613482aea0b24d4e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs: crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 141 in pgls_pretty_print::nodes::alter_table_cmd::emit_alter_table_cmd_of at line 12. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_cmd.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a7e56d85a092c601479d5188b38dc5dfa610196a5db42e9d02b454fa47b706"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_analyser/src/lib.rs: crates/pgls_analyser/src/lib.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Analyser::analyse_until at line 156. 13 of those changes were fix/bug commits, and the other 13 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa00a165bede958042ff65aeb0b8b6520ec3bfad3cf90b85b61cbde269cec15e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/create_stmt.rs: crates/pgls_pretty_print/src/nodes/create_stmt.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in pgls_pretty_print::nodes::create_stmt::emit_create_stmt at line 30. 6 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9385ebe93eeb9cc6dc8910caeaf7447eaa07c1737c4227fda1f50ee9710e048c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/base.rs: crates/pgls_catalog/src/catalog/base.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in CatalogBase::new at line 39. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/base.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/base.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e333c1bcce98e435edd4b5aeb8f623e5a179da195f15159448c961856d665b30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/resolve/nodes/mod.rs: crates/pgls_catalog/src/resolve/nodes/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in pgls_catalog::resolve::nodes::resolve_node_enum at line 57. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/nodes/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0811a73f9d12142d95376b6a6c2e4a15dbcc2c36c854abed85e7c03f9d5ecc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/resolve/column_name.rs: crates/pgls_catalog/src/resolve/column_name.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in pgls_catalog::resolve::column_name::step at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/column_name.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/column_name.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"33834dd8ce97405a7ff61fc325db17fbcd18cd96341585ee3dd943de90b1b4f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/func_call.rs: crates/pgls_pretty_print/src/nodes/func_call.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pgls_pretty_print::nodes::func_call::emit_sql_syntax_call at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/func_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/func_call.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24c3f9f8c1d64a66e55b3f4236c87839333d7e58364d58b1c6ed9aa2260edb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/grant_stmt.rs: crates/pgls_pretty_print/src/nodes/grant_stmt.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in pgls_pretty_print::nodes::grant_stmt::emit_grant_stmt at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/grant_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c44bb1177f2481947c9d3143f5949992667b0f7be980117240821c6d01297"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/a_expr.rs: crates/pgls_pretty_print/src/nodes/a_expr.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pgls_pretty_print::nodes::a_expr::emit_aexpr_op at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/a_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":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad797e12f9df9148528e98379c69754a233fe79e6827a2fd9cf0b336024fa148"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/join_expr.rs: crates/pgls_pretty_print/src/nodes/join_expr.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in pgls_pretty_print::nodes::join_expr::emit_join_expr at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/join_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":"crates/pgls_pretty_print/src/nodes/join_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3227a086543fae681e4a9f52d3d0d5033d4306f081d4d1255a5cd4f83f2ce4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/typing/unify.rs: crates/pgls_catalog/src/typing/unify.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in pgls_catalog::typing::unify::check_generic_type_consistency at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/typing/unify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/unify.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e2a211f4b9ad55c1d1d65533338af6b8161dd3e801d0dc86a03059972db105"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_statement_splitter/src/lib.rs: crates/pgls_statement_splitter/src/lib.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in pgls_statement_splitter::split_region at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_statement_splitter/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d02472d2063a8690b0455963b3382f4baebebf7ff399aff0011fd851bbfc543"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/create_role_stmt.rs: crates/pgls_pretty_print/src/nodes/create_role_stmt.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in pgls_pretty_print::nodes::create_role_stmt::format_role_option at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_role_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_role_stmt.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d72c689d2c077530a19dbf6103216ad2fca94a27369f1b0b0657e023c834b96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs: crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in pgls_catalog::catalog::ddl::create_function_stmt::apply_create_function_stmt at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_function_stmt.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"994bd6cb7ded941ceb7d43a11a2e7a23b00d4b888c19cf4fa0ebc4e3c2515d07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs: crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in pgls_pretty_print::nodes::create_table_as_stmt::emit_create_table_as_stmt at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_table_as_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcd7f8bc6b7e42275c01d762fb8639cbe63d8924621600ca49234f34473a0fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/materialize.rs: crates/pgls_catalog/src/catalog/materialize.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Catalog::snapshot at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/materialize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/materialize.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd6577772724bdfe7e9dda39c958c9fc9b3d696fa53f6e30eba14197f1be6f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs: crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in pgls_catalog::catalog::ddl::alter_table_stmt::apply_column_change at line 369. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/alter_table_stmt.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"51783ab52ad1f2c2b5dbae749847086f7f53ed55b55c9b9637b9dbf9c49972a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/resolve/expr/a_expr.rs: crates/pgls_catalog/src/resolve/expr/a_expr.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in pgls_catalog::resolve::expr::a_expr::infer_a_expr at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/expr/a_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":"crates/pgls_catalog/src/resolve/expr/a_expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b247ae1d55910aa76afdad51839a1a1213254a4ac5a66ede9b917f240ae180"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/sub_link.rs: crates/pgls_pretty_print/src/nodes/sub_link.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pgls_pretty_print::nodes::sub_link::emit_sub_link at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/sub_link.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/sub_link.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c5e3d5df4529340d6c04488e2bfcf2f2338cecda27752ac077da952b181b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_semantic_tokens/src/lib.rs: crates/pgls_semantic_tokens/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pgls_semantic_tokens::semantic_tokens_of_references at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_semantic_tokens/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_semantic_tokens/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d592bdb1a436055589b9c69607a88941c4ce21579662a5f42198fd97d978ffb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/ddl/index_stmt.rs: crates/pgls_catalog/src/catalog/ddl/index_stmt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in pgls_catalog::catalog::ddl::index_stmt::index_columns at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/ddl/index_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/index_stmt.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"66377ada8779f2a47189934c6bc9450f130db83efd436e83e6c609cdd1e5b3e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs: crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pgls_catalog::resolve::nodes::create_function_stmt::resolve_create_function_stmt at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/create_function_stmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116275358826588f96ce93a87fd0a1731495c149b7f73d557ee716a1f123c42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs: crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pgls_pretty_print::nodes::create_trig_stmt::emit_create_trig_stmt at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_trig_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"605023dd77fbc4b54c43a5598eb18dc5e6e6f5a4bd34609895ddafc43b7d8621"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/comment_stmt.rs: crates/pgls_pretty_print/src/nodes/comment_stmt.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pgls_pretty_print::nodes::comment_stmt::emit_comment_stmt at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/comment_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/comment_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7863e5a35288c70ba00fcd7556c488cf93168cb67d668f07c864cf5d891e726f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/comments.rs: crates/pgls_pretty_print/src/comments.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pgls_pretty_print::comments::attach_comments at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/comments.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/comments.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48ca12b63c8f2df7d33d5bd96f39a82ca0044c0b8b1dc1be058ff2065b7e55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/ddl/rename_stmt.rs: crates/pgls_catalog/src/catalog/ddl/rename_stmt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pgls_catalog::catalog::ddl::rename_stmt::apply_rename_stmt at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/ddl/rename_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/rename_stmt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7c804b7eb02aff95abefb6932d76dd4a00fef5dc6ad665381ef44bc6a64f9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs: crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pgls_pretty_print::nodes::variable_set_stmt::emit_variable_set_stmt_inner at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/variable_set_stmt.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"418156d39656330169c7817bcbf0bd27318400be3bcdcf9cb55e0ef28534b08b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/xml_expr.rs: crates/pgls_pretty_print/src/nodes/xml_expr.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pgls_pretty_print::nodes::xml_expr::emit_xml_expr at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/xml_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":"crates/pgls_pretty_print/src/nodes/xml_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"399ddd32d181a597ac792d2e66af5fe62b5d8c8ab9296d09bf9fc4d4dae4b2a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/typing/overload/function.rs: crates/pgls_catalog/src/typing/overload/function.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pgls_catalog::typing::overload::function::select_function at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/typing/overload/function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/function.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a114b957cfc417ef25693b92e4fdb897e82acf689e38981159a84d9b7ea56ff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_inlay_hints/src/lib.rs: crates/pgls_inlay_hints/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pgls_inlay_hints::inlay_hints_of_references at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_inlay_hints/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_inlay_hints/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"172835399d47c00468536f600ea3c2c16dc524c3f64fffb0123774fdfcae96a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/resolve/nodes/select_stmt.rs: crates/pgls_catalog/src/resolve/nodes/select_stmt.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pgls_catalog::resolve::nodes::select_stmt::resolve_select at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/nodes/select_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/select_stmt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a2b2cfc4cd3eb6ea86d9807b6f13fc031139303e3a740817b79f8e391e067d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/typing/coerce.rs: crates/pgls_catalog/src/typing/coerce.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in pgls_catalog::typing::coerce::can_coerce at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/typing/coerce.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/coerce.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a66812dd914cc5fb171f9f83f3bd3cff8736e7994c143cec611e59976c2b38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/json_func_expr.rs: crates/pgls_pretty_print/src/nodes/json_func_expr.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in pgls_pretty_print::nodes::json_func_expr::emit_json_func_expr at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/json_func_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":"crates/pgls_pretty_print/src/nodes/json_func_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8919441be5a76c6aab012a5182042e9ded0f22bb1fce96b538af770fc660455"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_workspace/src/workspace/server/formatting.rs: crates/pgls_workspace/src/workspace/server/formatting.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in pgls_workspace::workspace::server::formatting::format_document at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_workspace/src/workspace/server/formatting.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/formatting.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c0c706c012e7abd892c3df41cdf176ef766865cb5667dd376482543ea2e4ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/ddl/drop_stmt.rs: crates/pgls_catalog/src/catalog/ddl/drop_stmt.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in pgls_catalog::catalog::ddl::drop_stmt::apply_drop_stmt at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/ddl/drop_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/drop_stmt.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"674d34fab55e369e834445010f135991da99dcdb64d857e8ebc7a80a92ce925e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/json_expr.rs: crates/pgls_pretty_print/src/nodes/json_expr.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in pgls_pretty_print::nodes::json_expr::emit_json_expr at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/json_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":"crates/pgls_pretty_print/src/nodes/json_expr.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e20adbc32915b0ad70019704c5cbf5785d3c077f56e123bc11183c063c1170"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_typecheck/src/diagnostics.rs: crates/pgls_typecheck/src/diagnostics.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in pgls_typecheck::diagnostics::create_type_error at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_typecheck/src/diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_typecheck/src/diagnostics.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ac625a9881adb603d5b25f28553020ea427cf1645a6a91137d842558e0b80c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/rename_stmt.rs: crates/pgls_pretty_print/src/nodes/rename_stmt.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pgls_pretty_print::nodes::rename_stmt::emit_rename_stmt at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/rename_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/rename_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6b32115a0848989892f91de9ce9bcd74f3e970c8a9cc39dd7d43f0a2d35b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_walk/src/walk.rs: crates/pgls_walk/src/walk.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pgls_walk::walk::walk_statements at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_walk/src/walk.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_walk/src/walk.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a93f3d0308087eb94e30e58786186db501306e0704d754a7cccb87b2ff0c76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/catalog/ddl/create_stmt.rs: crates/pgls_catalog/src/catalog/ddl/create_stmt.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pgls_catalog::catalog::ddl::create_stmt::create_table at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/catalog/ddl/create_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/catalog/ddl/create_stmt.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c103c0a4d141cf039bd5f2af5b6b3bad479b2ff187f99cc36b39e2cbf1a7944"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/merge_when_clause.rs: crates/pgls_pretty_print/src/nodes/merge_when_clause.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pgls_pretty_print::nodes::merge_when_clause::emit_merge_when_clause at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/merge_when_clause.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/merge_when_clause.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc019bdce2a4f38ba7f55a1f75579e757fc706b7b7049899e1dea15fde465bbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/do_stmt.rs: crates/pgls_pretty_print/src/nodes/do_stmt.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pgls_pretty_print::nodes::do_stmt::emit_do_stmt at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/do_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/do_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4605409a0042c523e66bdb1943f14d556383f4466ca722ac102ab3093e13f8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_hover/src/hovered_node.rs: crates/pgls_hover/src/hovered_node.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in HoveredNode::get at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_hover/src/hovered_node.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_hover/src/hovered_node.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc6d8f3b2a1c5146ab827988af37d8a5c52542b912740b459b3ebd244849ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/alter_subscription_stmt.rs: crates/pgls_pretty_print/src/nodes/alter_subscription_stmt.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pgls_pretty_print::nodes::alter_subscription_stmt::emit_alter_subscription_stmt at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/alter_subscription_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_subscription_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc7dc112d766161370fb72d08d232e298666e1fd44921412a58321cf6b7aa8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/into_clause.rs: crates/pgls_pretty_print/src/nodes/into_clause.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pgls_pretty_print::nodes::into_clause::emit_into_clause at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/into_clause.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/into_clause.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f1e67a39f7906c95957e4e9cd8faf06f8ef3d62768d0e6c8cdcb16240e834a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_pretty_print/src/nodes/fetch_stmt.rs: crates/pgls_pretty_print/src/nodes/fetch_stmt.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pgls_pretty_print::nodes::fetch_stmt::emit_fetch_stmt at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/fetch_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/fetch_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c5e60d96ca5c305c1dc78da1bae48b242a635d735b89c8a4b5748faebbf30d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_catalog/src/typing/overload/candidates.rs: crates/pgls_catalog/src/typing/overload/candidates.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in pgls_catalog::typing::overload::candidates::expand_candidates at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/typing/overload/candidates.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/typing/overload/candidates.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e69d45e155e8c54c4c97c1b33aa5fa4a68ac30fac381f98c59e279dbffa24a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/pgls_lexer/src/params.rs: crates/pgls_lexer/src/params.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pgls_lexer::params::convert_to_positional_params_with_metadata at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_lexer/src/params.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/params.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7afe381b93730fa6b710f85d00590ef9fa29319ca481b3d2ce2e05d1532ec70"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/emitter.rs: crates/pgls_pretty_print/src/emitter.rs changed 19 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is EventEmitter::take_leading_comments_at at line 217), 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(pretty_print): keep comments before DML and DDL keywords in place (#1046)\u201D; \u201Cfix(pretty_print): keep comments before clause, join and alias keywords in place (#1031)\u201D; \u201Cfix(pretty_print): keep a comment written before a list comma before the comma (#1030)\u201D; \u201Cfix(pretty_print): preserve comment order and CASE END boundaries (#1025)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/emitter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/emitter.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecce30fb465145846491d19aa812f4213cbf32074290ddd425865a146f3cdc66"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/mod.rs: crates/pgls_pretty_print/src/nodes/mod.rs changed 19 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is pgls_pretty_print::nodes::emit_statement at line 559), 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(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(pretty_print): close a lone compact select item under select (#960)\u201D; \u201Cfix(pretty_print): break the remaining calls and statement headers within the line width (#946)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/mod.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0d100bc63b43c4822b3c4145cefa4889ca124415c0231063ccd140edf47561"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/renderer.rs: crates/pgls_pretty_print/src/renderer.rs changed 18 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Renderer::render_events_with_breaks at line 205), 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(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(pretty_print): keep comments before CASE and GRANT keywords in place (#934)\u201D; \u201Cfix(pretty_print): align expanded CASE from where it starts (#894)\u201D; \u201Cfix(pretty_print): no stray spaces around commas and inside parentheses (#890)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/renderer.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8dbd07fbbcb96139369547b1816ad97e60357c1afbdca0940827fffd9ec327"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/lib.rs: crates/pgls_pretty_print/src/lib.rs changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is pgls_pretty_print::format_statement at line 80), 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(pretty_print): keep comments before clause, join and alias keywords in place (#1031)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(pretty_print): preserve comment order and CASE END boundaries (#1025)\u201D; \u201Cfix(pretty_print): keep long identifiers as written (#901)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/lib.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4ab8ff15c08cda3359979c0c5df36d6243b01cc8efada79b236e878d5c86a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/bool_expr.rs: crates/pgls_pretty_print/src/nodes/bool_expr.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is pgls_pretty_print::nodes::bool_expr::emit_variadic_operands at line 52), 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(pretty_print): keep comments before clause, join and alias keywords in place (#1031)\u201D; \u201Cfix(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): indent the condition of a check constraint (#871)\u201D; \u201Cfix(pretty_print): keep exists ( together and break nested boolean groups (#864)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/bool_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":"crates/pgls_pretty_print/src/nodes/bool_expr.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe9e85e5dca1e04a687d12de8c3dc03d4ffd4c5a08f9efcdb2b5dffde1e94c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_catalog/src/session/locks.rs: crates/pgls_catalog/src/session/locks.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Locks::apply at line 160), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): take lock levels from a port of AlterTableGetLockLevel (#1155)\u201D; \u201Cfix(analyser): handle NOT ENFORCED foreign keys and ALTER CONSTRAINT ... ENFORCED (#1112)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/session/locks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/locks.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72006ca0f1db5281904094cacdb31a76bfdcb42589b960a9e0ddd70c8f9e9f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_catalog/src/session/mod.rs: crates/pgls_catalog/src/session/mod.rs changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Session::apply at line 206), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): one model of transaction blocks for the transaction rules (#1153)\u201D; \u201Cfix(analyser): take lock levels from a port of AlterTableGetLockLevel (#1155)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/session/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/session/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d70b3e665f17089694056dd314b70fa5a60fe21f7d41fadc917dcda22bf82a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/lint/safety/require_concurrent_index_creation.rs: crates/pgls_analyser/src/lint/safety/require_concurrent_index_creation.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is pgls_analyser::lint::safety::require_concurrent_index_creation::add_concurrently at line 86), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): don\u0027t report locking problems on tables created in the same transaction (#1157)\u201D; \u201Cfix(catalog): resolve the relations of the session\u0027s lock state with the catalog (#1042)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lint/safety/require_concurrent_index_creation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/safety/require_concurrent_index_creation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4f7e0c121284fead9b9b720b9dd635d305cd964a94946e6be0826cf9741c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/lint/destructive/changing_column_type.rs: crates/pgls_analyser/src/lint/destructive/changing_column_type.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is pgls_analyser::lint::destructive::changing_column_type::type_change_rewrites at line 158), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): don\u0027t report locking problems on tables created in the same transaction (#1157)\u201D; \u201Cfix(analyser): answer volatility, versions and type changes from the catalog (#1156)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lint/destructive/changing_column_type.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/destructive/changing_column_type.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a59702aef850983fad3ca9174cc23e861ebd018d018a9514b964574aa023e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/alter_table_stmt.rs: crates/pgls_pretty_print/src/nodes/alter_table_stmt.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is pgls_pretty_print::nodes::alter_table_stmt::emit_alter_table_stmt at line 5), 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(pretty_print): write the commas of every node list with emit_list_comma (#1045)\u201D; \u201Cfix(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/alter_table_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_table_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"be64c45ce9ffddf9aec3b41e32222340c1dceff98c05b5e2e5ba6a24c3ad8a6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/lint/safety/adding_foreign_key_constraint.rs: crates/pgls_analyser/src/lint/safety/adding_foreign_key_constraint.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is pgls_analyser::lint::safety::adding_foreign_key_constraint::check_foreign_key_constraint at line 149), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): a few rule edge cases found while sharing their helpers (#1158)\u201D; \u201Cfix(analyser): don\u0027t report locking problems on tables created in the same transaction (#1157)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lint/safety/adding_foreign_key_constraint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/safety/adding_foreign_key_constraint.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"917784c1278569b43af0990cd1dcb65636b8d7df0fefe203959c5cf6785a08bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/view_stmt.rs: crates/pgls_pretty_print/src/nodes/view_stmt.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is pgls_pretty_print::nodes::view_stmt::emit_view_stmt at line 5), 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(pretty_print): keep comments before DML and DDL keywords in place (#1046)\u201D; \u201Cfix(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/view_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/view_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3008cea8b5fd2239db6884e9446c7deaffafa5a91129717921e06b92e15b27"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/utils.rs: crates/pgls_analyser/src/utils.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is AlterDomainKind::of at line 133), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): a few rule edge cases found while sharing their helpers (#1158)\u201D; \u201Cfix(analyser): one model of transaction blocks for the transaction rules (#1153)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/utils.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"293bc9fa37328c049845d5be9e17c3c2f725d7e571056abd3dca7a2338bba7ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_completions/src/providers/helper.rs: crates/pgls_completions/src/providers/helper.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is pgls_completions::providers::helper::with_schema_or_alias at line 93), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(completions): complete keywords right after an opening parenthesis (#1134)\u201D; \u201Cfix(completions): complete inside unterminated quotes and quote policies and roles (#1048)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_completions/src/providers/helper.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/helper.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3845dea3a715cd1b1550396709fc2b810f5f8067120bc6be3bc13c8ca1219a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_workspace/src/workspace/server/connection_manager.rs: crates/pgls_workspace/src/workspace/server/connection_manager.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ConnectionManager::get_pools at line 218), 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(workspace): don\u0027t leak transactions or session settings from executed statements (#907)\u201D; \u201Cfix(workspace): only connection failures put the database into backoff (#903)\u201D; \u201Cfix(cli): fail check on database login errors and read ~/.pgpass (#839)\u201D; \u201Cfix(workspace): apply changed database credentials to cached connection pools (#811)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_workspace/src/workspace/server/connection_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1239c57ec4c2c8be3b4206411827c532b54f69393f3cd43d68cc0b3f2c1b5d92"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/lint/style/prefer_big_int.rs: crates/pgls_analyser/src/lint/style/prefer_big_int.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is pgls_analyser::lint::style::prefer_big_int::check_column_def at line 86), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(catalog): recognise serial columns like Postgres does (#1154)\u201D; \u201Cfix(analyser): lint rule edge cases (#970)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lint/style/prefer_big_int.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/style/prefer_big_int.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5699392d91f5cc54ab5e4009099ca1a6700a2a6fd7f88d9c8d49804ade48fc77"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_catalog/src/snapshot/mod.rs: crates/pgls_catalog/src/snapshot/mod.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is Snapshot::find_tables at line 135), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix: normalise identifiers the same way everywhere (#976)\u201D; \u201Cfix(catalog): skip orphaned catalog rows when loading the snapshot (#847)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/snapshot/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/snapshot/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"09feea015a51225d13feb75dd199c359773fb2e1fe3789f8751a2b2ec1dd58cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/index_stmt.rs: crates/pgls_pretty_print/src/nodes/index_stmt.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is pgls_pretty_print::nodes::index_stmt::emit_index_stmt at line 5), 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(pretty_print): keep comments before DML and DDL keywords in place (#1046)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\u201D; \u201Cfix(pretty-print): suppress child statement semicolons in CREATE SCHEMA (#803)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/index_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/index_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3777f6e96909a736557cdc55c26f0c3201a12c41e9af87e5bf498e410ba7b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/merge_stmt.rs: crates/pgls_pretty_print/src/nodes/merge_stmt.rs changed 7 times in last 90 days and 4 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 pgls_pretty_print::nodes::merge_stmt::emit_merge_stmt at line 6), 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(pretty_print): keep comments before DML and DDL keywords in place (#1046)\u201D; \u201Cfix(pretty_print): keep comments before clause, join and alias keywords in place (#1031)\u201D; \u201Cfix(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/merge_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/merge_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"808bef2176ccc12352007935e240721cb32edc69eedcf982a6e5ba01438f7d0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/create_function_stmt.rs: crates/pgls_pretty_print/src/nodes/create_function_stmt.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is pgls_pretty_print::nodes::create_function_stmt::emit_create_function_stmt at line 5), 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(pretty_print): write the commas of every node list with emit_list_comma (#1045)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\u201D; \u201Cfix(pretty-print): emit BEGIN ATOMIC bodies and TRANSFORM FOR TYPE (#829)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_function_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_function_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"56626c1b451ab2093cc0a3309288cf4c98622aeb5878ec0936a2c1e98d4065a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/alter_function_stmt.rs: crates/pgls_pretty_print/src/nodes/alter_function_stmt.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is pgls_pretty_print::nodes::alter_function_stmt::emit_alter_function_stmt at line 6), 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(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\u201D; \u201Cfix(pretty-print): separate ALTER FUNCTION actions with spaces (#846)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/alter_function_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/alter_function_stmt.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"badc208ce4b7c85230c13ab39c4c33fd805add72efc6ae88c9025182906f994b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs: crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is pgls_pretty_print::nodes::grant_role_stmt::emit_grant_role_stmt at line 5), 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(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(pretty_print): keep comments before CASE and GRANT keywords in place (#934)\u201D; \u201Cfix(pretty-print): indent GRANT and REVOKE continuation clauses (#858)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/grant_role_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e57f4dc02cdf7e91395fcc8211585c9e6b6471ecacb157b88adaa8b4bdfb564"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_line_index/src/line_index.rs: crates/pgls_line_index/src/line_index.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is LineIndex::new at line 31), 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(suppressions): end lines at \\n only, with the shared line index (#1072)\u201D; \u201Cfix(lsp): share the line index with WASM and keep positions out of CRLF line breaks (#1070)\u201D; \u201Cfix(lsp): debug assertions at range boundaries, keep client positions on char boundaries (#952)\u201D; \u201Cfix(diagnostics): end lines only at \\n, like the shared line index (#1125)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_line_index/src/line_index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_line_index/src/line_index.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a69b853c90660e57985ee356ec82257b6f3c54e6dee14df0d4b8348e8fff09"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/lint/style/prefer_identity.rs: crates/pgls_analyser/src/lint/style/prefer_identity.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is pgls_analyser::lint::style::prefer_identity::check_column_def at line 69), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(catalog): recognise serial columns like Postgres does (#1154)\u201D; \u201Cfix(analyser): lint rule edge cases (#970)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lint/style/prefer_identity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/style/prefer_identity.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd14b313ca9efcaaa3670099fa126516d5036ad05c59d183d839bb9a67e87d7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_catalog/src/resolve/nodes/with_clause.rs: crates/pgls_catalog/src/resolve/nodes/with_clause.rs changed 6 times in last 90 days and 4 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 pgls_catalog::resolve::nodes::with_clause::resolve_with_clause at line 22), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(catalog): add the columns of SEARCH and CYCLE to a CTE (#1019)\u201D; \u201Cfix(catalog): apply a CTE\u0027s column list to typed columns too (#980)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/nodes/with_clause.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/with_clause.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4daca8bd1f2d9255ff7c24d067b36e7c93ff749f56a3cf5f669e2f634db9afb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/create_policy_stmt.rs: crates/pgls_pretty_print/src/nodes/create_policy_stmt.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is pgls_pretty_print::nodes::create_policy_stmt::emit_create_policy_stmt at line 5), 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(pretty_print): keep comments before DML and DDL keywords in place (#1046)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(pretty_print): indent the body of a policy\u0027s using and with check (#857)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_policy_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_policy_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed51f527a4efd9f72bde95e25cae9b7182523fbd427d617f312bd129e04f0527"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/utils/lists.rs: crates/pgls_pretty_print/src/nodes/utils/lists.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is pgls_pretty_print::nodes::utils::lists::emit_list_comma_before at line 42), 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(pretty_print): write the commas of every node list with emit_list_comma (#1045)\u201D; \u201Cfix(pretty_print): keep comments before clause, join and alias keywords in place (#1031)\u201D; \u201Cfix(pretty_print): keep a comment written before a list comma before the comma (#1030)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/utils/lists.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/utils/lists.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d24fbe31a71765dacdf77aa5579d3be14d2403dc6e1e444d0cafed71023fae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/fix.rs: crates/pgls_analyser/src/fix.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is StatementTokens::type_name_end at line 137), 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(analyser): lint rule edge cases (#970)\u201D; \u201Cfix(analyser): only offer fixes that keep the SQL valid (#906)\u201D; \u201Cfix(analyser): precise spans and coverage for the rules ported from Squawk (#905)\u201D; \u201Cfix(analyser): never write a CONCURRENTLY that Postgres rejects (#899)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/fix.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/fix.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab179bb126b1f71509df1c614d2d10830f8c8e08ffe643f35a322380989619f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_configuration/src/database.rs: crates/pgls_configuration/src/database.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is DatabaseConfiguration::fmt at line 68), 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(workspace): match the port in allowStatementExecutionsAgainst (#922)\u201D; \u201Cfix: keep each folder on its own settings (#902)\u201D; \u201Cfix(cli): fail check on database login errors and read ~/.pgpass (#839)\u201D; \u201Cfix(configuration): redact credentials in PartialDatabaseConfiguration debug output (#810)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_configuration/src/database.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_configuration/src/database.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7563ecbacb4043a036ea8f549bd2a9f1b0ffcd29418dde9bd91ba5cb11401e6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_lexer/src/lib.rs: crates/pgls_lexer/src/lib.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is pgls_lexer::keyword_category at line 19), 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(completions): quote names that need it when inserting them (#981)\u201D; \u201Cfix(splitter): accept unreserved and column name keywords as CTE names (#837)\u201D; \u201Cfix: handle named parameters in identifier contexts (#790)\u201D; \u201Cfix(splitter): preserve blank lines in parsable SQL (#788)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_lexer/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lexer/src/lib.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"077b59f0af16a7e58c426aee32f93e05586ef44a8704237e8ffe3bf080ef1a75"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_analyser/src/lint/correctness/transaction_nesting.rs: crates/pgls_analyser/src/lint/correctness/transaction_nesting.rs changed 5 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 3 (its worst body is pgls_analyser::lint::correctness::transaction_nesting::explicit_transaction_nesting at line 95), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(analyser): one model of transaction blocks for the transaction rules (#1153)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_analyser/src/lint/correctness/transaction_nesting.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_analyser/src/lint/correctness/transaction_nesting.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeab22ebf0a525bc5c9410d3a2c81bff92963c3db0cc3a0e37bc0bbf21ce973c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_completions/src/providers/functions.rs: crates/pgls_completions/src/providers/functions.rs changed 5 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 6 (its worst body is pgls_completions::providers::functions::get_completion_text at line 37), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(completions): quote names that need it when inserting them (#981)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_completions/src/providers/functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/functions.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"611c314ab8641afaebed7a57dccc37f51d093543f220fd5f6a556ea8c774a91b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_completions/src/providers/policies.rs: crates/pgls_completions/src/providers/policies.rs changed 5 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 2 (its worst body is pgls_completions::providers::policies::complete_policies at line 12), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(completions): complete inside unterminated quotes and quote policies and roles (#1048)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_completions/src/providers/policies.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/policies.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88012d61d46b6e26ab5c4f2f94e61883da18ecaa144172b3acdd4abfe65b722"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/copy_stmt.rs: crates/pgls_pretty_print/src/nodes/copy_stmt.rs changed 5 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 10 (its worst body is pgls_pretty_print::nodes::copy_stmt::emit_copy_stmt at line 5), 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(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/copy_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/copy_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"48573f8ee97f6eab307b731f55f9109202debe446a97478d1ecf51adae146274"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/create_enum_stmt.rs: crates/pgls_pretty_print/src/nodes/create_enum_stmt.rs changed 5 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 4 (its worst body is pgls_pretty_print::nodes::create_enum_stmt::emit_create_enum_stmt at line 5), 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(pretty_print): print an unexpected AST instead of panicking (#1001)\u201D; \u201Cfix(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_enum_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_enum_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6638df3e737623a99a844ab077d5c21f276f451a47dfb3faa8649b6647361407"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_pretty_print/src/nodes/create_event_trig_stmt.rs: crates/pgls_pretty_print/src/nodes/create_event_trig_stmt.rs changed 5 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 pgls_pretty_print::nodes::create_event_trig_stmt::emit_create_event_trig_stmt at line 5), 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(pretty_print): write the statement terminator only at the top level (#987)\u201D; \u201Cfix(pretty_print): break the remaining calls and statement headers within the line width (#946)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_pretty_print/src/nodes/create_event_trig_stmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/create_event_trig_stmt.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"64750c4f79143b6b83e72a64b48a72429cbd7bbd7b16d0882f7c879b297619df"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_wasm/src/lsp.rs: crates/pgls_wasm/src/lsp.rs changed 5 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 10 (its worst body is LspHandler::code_action at line 345), 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(lsp): keep a CRLF line break whole in the fix-all edit (#1108)\u201D; \u201Cfix(lsp): share the line index with WASM and keep positions out of CRLF line breaks (#1070)\u201D; \u201Cfix(wasm): convert positions correctly in files with CRLF line endings (#969)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_wasm/src/lsp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_wasm/src/lsp.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda13ba2bd79d95eb97038e5e751757dc3ae0aef3f6651d360c10375d33a0392"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_cli/src/diagnostics.rs: crates/pgls_cli/src/diagnostics.rs changed 5 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 2 (its worst body is CliDiagnostic::report at line 502), 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(cli): say that --staged and --changed need a git repository (#1013)\u201D; \u201Cfix(cli): clearer formatter option errors and check output (#917)\u201D; \u201Cfix(cli): fail check on database login errors and read ~/.pgpass (#839)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_cli/src/diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/diagnostics.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b809e4f0d289ec3e6c562811ec34d8322afa1308e9316ea6894040173224d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_workspace/src/workspace/server/sql_function.rs: crates/pgls_workspace/src/workspace/server/sql_function.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 3 (its worst body is pgls_workspace::workspace::server::sql_function::set_formatted_sql_fn_body at line 7), 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: \u201Ctest(analyser): check SQL function bodies in the Postgres regression harness (#939)\u201D; \u201Cfix(format): stop rewriting SQL and only break lines that do not fit (#849)\u201D; \u201Cfix(typecheck): don\u0027t substitute output columns or qualified columns as parameters (#838)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_workspace/src/workspace/server/sql_function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/sql_function.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"591fe4a941c5e8a28518fe6ec8fbf4dd8de1ad0d61b1bae0e91c00a40fc92366"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_cli/src/reporter/mod.rs: crates/pgls_cli/src/reporter/mod.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 7 (its worst body is ReportMode::from at line 57), 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(cli): filter verbose diagnostics the same way in every reporter (#968)\u201D; \u201Cfix(cli): don\u0027t process the whole project when --changed or --staged finds no files (#979)\u201D; \u201Cfix(cli): fail check on database login errors and read ~/.pgpass (#839)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_cli/src/reporter/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/reporter/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd0b338e756e2f037cb0e26762d4a0455f555dc683066d182d78bbc0d9422e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_workspace/src/diagnostics.rs: crates/pgls_workspace/src/diagnostics.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 4 (its worst body is TransportError::description at line 153), 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(lsp): show the database error on hover instead of a generic connection error (#1016)\u201D; \u201Cfix(workspace): only connection failures put the database into backoff (#903)\u201D; \u201Cfix(cli): fail check on database login errors and read ~/.pgpass (#839)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_workspace/src/diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/diagnostics.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"94db13ce9e52478864f34ecd5d4049434480e84708dfd28eba6557dfd0d59408"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_catalog/src/resolve/nodes/common_table_expr.rs: crates/pgls_catalog/src/resolve/nodes/common_table_expr.rs changed 3 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 4 (its worst body is pgls_catalog::resolve::nodes::common_table_expr::search_cycle_columns at line 27), 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: restore the changes that the squash of #1027 reverted (#1164)\u201D; \u201Cfix(pretty_print): keep an own-line comment before a leading comma in fill lists (#1027)\u201D; \u201Cfix(catalog): add the columns of SEARCH and CYCLE to a CTE (#1019)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_catalog/src/resolve/nodes/common_table_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":"crates/pgls_catalog/src/resolve/nodes/common_table_expr.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ddf9ee5682353d6712c9ddd51926720292153e38886e59b9bb8b71af5ad8d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_statement_splitter/src/splitter.rs: crates/pgls_statement_splitter/src/splitter.rs changed 3 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 4 (its worst body is Splitter::is_trivia at line 204), 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(splitter): don\u0027t panic on a WITH at the end of the text (#963)\u201D; \u201Cfix(splitter): accept unreserved and column name keywords as CTE names (#837)\u201D; \u201Cfix(splitter): preserve blank lines in parsable SQL (#788)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_statement_splitter/src/splitter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/splitter.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0257caafa02d141fb9661b73622dee9b9a983facb8853b8fd5aa223ea4fdea6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/pgls_statement_splitter/src/splitter/dml.rs: crates/pgls_statement_splitter/src/splitter/dml.rs changed 3 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 9 (its worst body is pgls_statement_splitter::splitter::dml::cte at line 11), 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(splitter): accept unreserved and column name keywords as CTE names (#837)\u201D; \u201Cfix(splitter): support CTE column lists in CREATE ... AS (#804)\u201D; \u201Cfix(splitter): keep CTE queries attached to inserts (#792)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:26:12 \u002B00:00\u0027 --until=\u00272026-11-14 13:26:12 \u002B00:00\u0027 --full-history --no-merges -- crates/pgls_statement_splitter/src/splitter/dml.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_statement_splitter/src/splitter/dml.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c019f3e255b940c0681682e20cc8fcf3aba380c65fc10c6c0a4d67cb58341408"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 167 significant file(s) lose their only recent owner: crates/pgls_catalog/src/catalog/tests.rs, crates/pgls_workspace/src/workspace/server/document.rs, crates/pgls_catalog/src/resolve/tests.rs, crates/pgls_workspace/src/configuration.rs, crates/pgls_wasm/src/lsp.rs, crates/pgls_catalog/src/catalog/overlay.rs, crates/pgls_plpgsql_check/src/lib.rs, crates/pgls_analyser/src/lib.rs (\u002B159 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"02b46508fd4650b3bcb581de3ba305351e8fadf4c3ef432e81f6c9a3262c3214"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (170 single-owned of 421 analysed files in total, 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; 421 of the 848 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/pgls_treesitter/src/queries/where_columns.rs, crates/pgls_treesitter/src/queries/select_columns.rs, crates/pgls_cli/src/commands/parse.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Audit that the environment access only happens in single-threaded code. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/glue.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8516c0c91641785af58f178199c372d961132a8f0c6c010bc55eb2ba9635d1c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Audit that the environment access only happens in single-threaded code. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/glue.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e811fd7a07e38db6ad0ed47fbd6f39da7e5bed2602552683d441f5fc7bc0b8b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Audit that the environment access only happens in single-threaded code. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/glue.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6a6833fd1ce4c6133ab0462d5938a59d43619e34ad74bb8c8a5f4b2090b572"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not implemented at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/backend-jsonrpc/src/transport.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a6bfda7c39a9ef539adb2c2f8eef2ec4a3dc5e18362f32ac3167d2d7f1005a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not implemented at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/backend-jsonrpc/src/transport.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d36d858b61bccd47cc09b6d418e14cc8ee415e41839806fcb4ec0f6e4d5f311"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not implemented at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c5dc8602e0f5cf267519eab1163c406216798a5d5c1d23745a8bbcd875d979"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not implemented at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ee4e9e37d67ce1a18b2e484570bc043097cba409d74d6af620b869a27f3fa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The current implementation of the JSON-RPC protocol in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/client.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd7b765140c5dfa3fcd884334aa549a50b4a9f5710c2e8d50fb003ed50e5cc"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_text_size/src/range.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"97552cacf403fc7ac984b6d7586ca5d1d119ae8607935ca577e6614f5356df6c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_text_size/src/range.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d638e5a2f1d413a73df95ec7ab95f8de965c53fe7efe96389d28c2393b4a09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(@juleswritescode): optimize with windows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_text_size/src/text_range_replacement.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6c96c03485626933066b954833c6d31ced63b279c3ef80d8bdad5b760498e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider comparing the new value of start to the old value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query/src/split.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6415702a5d5641b45e9bbb29c00cdb6a0aae7ea46440d2186dac00886645ff3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this selectable via feature flags \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print_codegen/build.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e836687dcf1d256249c4da5b880bcded49338891e9b7a3f70f471ef732544fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle IDENTITY constraints specially \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/column_def.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1421f3ffdce4170a867314c99088f8d3b410e70bf201b9e3ed0ae62ebd296286"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: derive operator token from opno instead of assuming equality. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/scalar_array_op_expr.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fd420ed0214cf9f243e3b457acb5f6ba70640d5b2f6c97d776ed2f616b3bf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // - TODO: check \u0022LOOP\u0022, \u0022CASE\u0022, \u0022WHILE\u0022, \u0022EXPECTION\u0022 and others \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_plpgsql_check/src/diagnostics.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"46898d9b757f7b83abd94c3700718b16893feb1a56fc26457cc22752458c4b95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove in 2.0, and directly use \u0060.gitignore\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/os.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff69af6088a302c7cc75acfd30d5883ce1a1f9ca6c7de758411459081eaffc4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead of calculating lines for every match, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_diagnostics/src/display/frame.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d137381b4dd0b88cca45656bcbed081c30bb6cd54ba028c00afb12b272966f"}},{"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 \u0060crates/pgls_test_utils/Cargo.toml\u0060 makes this repository a deployable product (line 14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_test_utils/Cargo.toml"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bce6489a382cc95769487e2fdc32d7d9dd3cecabba55bd03d608ac0ce0d0b1c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add deprecation notice for @postgrestools packages\u0022 repeats the code it sits on: 4 of its 5 words (deprecation, notice, postgrestools, packages) are already in \u0060const deprecationNotice = \u0060\u003E [!WARNING]\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/postgrestools/scripts/generate-packages.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ca976258c22afb3ebb6c853f338db22796b9f08d2f1b44b0fa1d648b352443"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 52 project(s) overshoot their size bounds, lowering Project Cohesion to 8.8/10. The most over is \u0060crates/pgls_catalog\u0060 (21584 LoC, 168 module-visible types across 10 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"912da3e3279cfa2a3f25698e2102d94709589a57bd594d38dbec9195ede747e4"},"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":"43d19e303cbbec1a1e6b0b8128956db6084fc39a7a795947c03edbc1bcfc54cb"},"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":"9f34a086f43d4ee3383ef6329a72494cc78d11c4b356cec2b7eb2d25b43b903a"},"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":"ae08ef840df02852204e1e5b28cfb8944ecda728afd4b8486e5a050ad9650aae"},"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":"95f7c03e0deb075e620f2dd7705ad831c04e859aeab973f79a24de5d571488f5"},"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":"b132991aba7214332c819c16db16c5422354dd1024fef17f28391c2fb45b36d7"},"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":"19c8c18c8071c4933b443d087b01890bcab28b3b3434df30b1670a1de0b94025"},"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":"fd0c6386a56bbcbfd3c5e77d2f54b12ab8af7ebf24752dda2f23daa0e6d6e3c1"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"74416153e1f2c147b8a4154c490c943d73bd1d7df6dfee98410c9e56530ab81d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"0368062220b7d03a1fa9e9d2bccb854d86c67fc9ecc0cc9ff48703e4ad75233a"},"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":"d75904c8723a31ba01c02a467ad73fa22eed54ca13ff19ae4442cb79f4d82afd"},"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":"046e310103ac2474e2c662b4e64f3049ae4aaf7ef8aadd00041b677f0d3e1a8b"},"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":"222efd36418056411cb4de51e1e33ff9d6eaf63a0d1482846d087579b919bab3"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6253bb68fa8e4fb8761348dd055f8b8e0997bc92b0658b4741dab39a03b3af0e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"8212cb755daab12c630763e2ba08aba85bc3c44fb28ccc2596fbb0c19c79ed92"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6b575ca21bd338175fbcf3bef9dbec12ad7c0f8eb826e98aa38eecb89ec02996"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"b919aa1fe23d5cb705b271e7007bce3f2e610abe802b40ca48b338e5f7c48ed7"},"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":"65ab05392c7c2b362176ba57222890e68c59132f9d3d47b65e835d6d19b130a6"},"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":"cf91664577273de2d210bb344e16aa144402dac7f54473d849957c0aaae9e4a4"},"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":"71b300999544f36d123191eda29178b18fc9ccedfdd884f6ab3eb891e668d23c"},"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":"c57dfc3ca890eeeaf72588b47c159136f6cee4a23f034022e5498ee6b5509396"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6ff9dea7617396ed061d70559fd52bcf6cbbc36867efe5623ffbe84f14fe79ca"},"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":"87b2c12cf6161a46f99772b7958f44aff7c3ca6251636ff84611e4a2028e0413"},"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":"42a88f2f21716291440d4c37af33a1217cad8622b8247e0431c4c9bdc8e475a2"},"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":"5a1d4501492d4c3c450a895a8b1ae404ba91293d83233871aa60953fae1aaf4c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"816bd02f34a8f2999e3dce7bb4611c2372fc096fd5c8a01dcb9646373b3003eb"},"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":"671e8152e396ba8e25730bcd47fc2237725d6f92536920a497ce73f4b8ad6ab2"},"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":"b14bea81010718a7c8e599a1a43f0c54c0b8f33e0c535398b6809917edce83a0"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6ff5888c41a28a4271b0dec239972a2c86e06d200ffb6d0c9799a0635ded8a11"},"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":"14c930bd5727f0bea337525cf54d7f3c9af3013faadfc5b4b0d3348e4e075274"},"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":"5d01ef12b78d380088b860eb220fe49aa5e108e386d610abaaf55eb1d8a77137"},"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":"af037760ded9e5b51246cd93493629ff79be23405497591995cc883e5aa9a9e9"},"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":"daefac6b02be323d4942817907832833848d4661c59ec546491bb676d6c196da"},"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":"78c32fcad7ed59755bd7b7ab0ace13fc6908f5eb45ec229ee04f1859bb028772"},"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":"03a7e97f2f9cdde53e28cd3d107d2b86fea3ec429e13963eb7cff2c4725a0071"},"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":"a85623bb4cda892d9899491d364fb7b1fd7f7ec08230e4b598a0e4c01b12b223"},"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":"e300b5d2dd18b1e9b799337edfbe2d65c9f8d4434501976f4ae5d26c5f459524"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0783586ddea129625e7fcb373ba4ad2506c63bd18b6562c1828d4d9d55035f7d"},"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":"437e5bb088a2b03eb5577a05584f7e6f877e30a13e65e4d7dced037e58dd5734"},"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":"bf69676560e9496821cce829c261bad7072541cf03ed4b5daec9c146418cbcfe"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"bcf9d56c3cc0f389155f2ef346135e1d03917055dc204745d36c53e22e1654e3"},"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":"b781bad2595a9b0405c904804ba82909bae10e3044e4509dc144a874acfa34ab"},"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":"5de1f1d96477912f5ec6fcb12342cd350246e59f2b880d5cad72e7a2694784ba"},"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":"5c5f02194496ce9dc08e8d5d9f34213218246495d8a6c6ccd174af531f2d8294"},"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":"955bf602d83097b8d69bdf14abdefc0df464b62c25bf5c5934ee74344b009d91"},"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":"2ed89e24d3aa597c0e1b5674b071164abe4e3b5c555b46649d60bf62c0fd174b"},"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":"24185db20e2d2e1a9bfc034eb6b2938dfd4eff2dfd5dc01bca9eec30b454d146"},"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":"065607815bd15f42d5c7498ca0104f29b37f2c1882e06026962143963c86e55b"},"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":"0cc638890478b45420f5a2024e5e2b01efaaf199ff10ac7adb5e52710f0f14ac"},"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":"450f5e3ed1802900a4b39029bafc0780b52760bc949d0b30ea9fd31857ed4583"},"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":"e5373f760d6dab70f0974c37e7fb35d231c916d94882fe56c96f677bd68d0954"},"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":"fe9b282bb0e22b5b413ac993d71315ba26bce0468f6d32d01a7c7aef92ec35a0"},"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":"f7223e6571a5567c2999c8677a5df73ca65c16432e4f50f944a7f60c4f511a65"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"cd1547e9fa28b2b6f34beb0de9fd83682e8c3ecfec48de1423602b9d8537f23e"},"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":"915f6393009d01efc94fde6bb7e47d17893b64b032944bd53e61b375177a6b51"},"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":"28ee73ab94fcab85e96913c35f37ce571c3c2409a03f6a2ec9c84f1a264b3c2b"},"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":"a3a5bb18dab4667a1cc83ede80d5de5445c9a0e651a0524741f02d049d7a4ef9"},"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":"4f248ef0a1205eb9988c3fc14feafca1f352ae78421abcbd9456fd7ac02b3af9"},"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":"0cd75d605a2fe733b936b8a1392b749165885fdded4d7ef6ef059a80d9a37d95"},"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":"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":"ef92ee5a787a6e8adf7708509f63b550f7efdb3cd20791ac44ba4db05a0c4571"},"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":"74ecc26fc75dfb66b285bc530f1f28e8d7542fdd6853db6c109c11c420b57697"},"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":"a7664c603bf56f5e75ec2a905dcc25ccb5e4053d1e7d3ce697cef521980c22db"},"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":"77c894c5378a258ec83bc5057e004d6f7c7c1f4a56f817e859d1a5b95a2cd2e9"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"b0cc4d4cb2476e23d7b05b78650c92a4c1c9b0eb21f48c40a8658acf264a30ef"},"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":"8018fa76f9798f58c2d54888e01f82e01d93750f0c34580eea02821510c2b5a4"},"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":"bad26329f8f87fa0a3cd5d8d28df2c5ac35be85b3b3627ff94de168ef3e43704"},"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"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":"4200fc1cde44249e6566f58207d8595f8978c53e10456efaf7c157f00253d742"},"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"e28424fedc360265a4515c4fa929e6bf297e08d2621025a4f057e7095c665354"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8623fbb2d54d6dc3c838e7c0990f06f98ebf1b7d120dae58c79f7e696e459d74"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"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":"fe9c2422135c7c87299217beac95f376d03757dcfd857fd33dd0732c453e1800"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e34d2f4afbf740414ee4657f22af9783447652f304c87f49fd113d364b376a87"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"a8d9609f7be10eb1f629169922342814264d2c297fcde7d0d8d4627108f5e8f2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"70ede5275d17d4d8d1196faf1ab67a03e79975eeff1eb81b85628d215ed6fbbd"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"e333f262c45e9413a6cedc990d8785a429846feec4306ccc2a2719da1c15063e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"cdb83f6f4dfeb0658bcb049411c942aedc1ab0b9cf9df91a22f353597a02c60d"},"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":"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":"e5380c149be1229413d9ed8c4ad56b4140bbbf75fc13507a851f692829928d5f"},"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":"d3b81fa1c0e39874ab35e17aa0d1b502b78b4bd4f3064a0cd828654aefda37cc"},"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":"d2913c8940631a3afa8f9b642f3d34b14a7e1ad7371a0b3d39186c9a31dd0c05"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"65419e21947fe715e259b67beb8fb0b9466b79c29f4a26bdf331a16934b29d57"},"properties":{"dependency":{"package":"tinypool","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.101","advisory":"RUSTSEC-2026-0190","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":"97de2d9afba19ac7d5526d587e8aa29754fd1ff1c9caccbe9740917d4dd5ff14"},"properties":{"dependency":{"package":"async-std","version":"1.13.2","advisory":"RUSTSEC-2025-0052","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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"d16a195f2692c30c6739c7ce8896426c6177603bb31aa1a2f55c80769aaed29a"},"properties":{"dependency":{"package":"dotenv","version":"0.15.0","advisory":"RUSTSEC-2021-0141","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":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","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":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"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":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","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":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.38.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.3","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"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":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.36","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.49.0","advisory":"RUSTSEC-2026-0386","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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.6","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"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":"6c9bd328f1425e4185802e2cb388fc5dec17b2da92bc5227fa43622d89e747d7"}},{"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":"be9c57e2fb625c43c271d051f76b97f27b6976f4ec358ef8fea1d9cb5205f460"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ed5b8874c19fcf1d856efa311d22e5d282d980463b212d12bc1e23db1af9cf97"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c6ea39a2bf2bdd5cc382ef83e8152a40bb60a5ef48d93d3d9c5bebdd3ec9baf6"}},{"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":"e7d78cf344401c5cc9cccc681af5dfc2d0e3df0f30388b6b4a6512c3cad6e418"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"105a0f41cdd412ac3d2433ae5cb23eb8f6d2a7516d06f6b1353a17840a010a85"}},{"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":"0ae4e44d98c3caa8fdd5eade2e6a0fdb36cb6b49ee72911bf17e61fbe89cfcb0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_text_size/src/text_range_replacement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"299aca4ce1df67f2d66c9453fe9a4bd1b553de92e3cd83c2cf479dc37a10759f"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 6 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: crates/pgls_treesitter/src/queries/insert_columns.rs, crates/pgls_hover/src/hoverables/function.rs, crates/pgls_treesitter/src/helper.rs, crates/pgls_hover/src/hoverables/postgres_type.rs, crates/pgls_hover/src/hoverables/role.rs, crates/pgls_treesitter/src/queries/object_references.rs (7 orphaned of 421 analysed files in total, 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; 421 of the 848 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/insert_columns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b8437eb9d6937c728fbd0e35608d569f17b3d695852ffa03ba60dc9f5f90c6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_hover/src/hoverables/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2912f0218844534424361a8dea736ee913b194e282367b08aeb589b6fd94eac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/helper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4577ee6fc0756632652eb15054f487b46c869ab556c0b91cb8179bf9d5c1911"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_hover/src/hoverables/postgres_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c73a37c118aaf071fdc980589c528b1d1a62179817981b86073f705ab34739"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_hover/src/hoverables/role.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8609775c7724f4cc305851c135c42b4cd459f3f2951590e3c9874355f3bbe871"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/queries/object_references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61a781e5ed90237a57c97a65aed702825becc371c232b33df5d7bafa4a37939"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: server.rs \u2192 mod.rs, database.rs, lib.rs, text_document.rs, lib.rs, client.rs, parse.rs, tree.rs: \u0060crates/pgls_workspace/src/workspace/server.rs\u0060 changes together with 8 other files \u2014 \u0060crates/pgls_cli/src/commands/mod.rs\u0060, \u0060crates/pgls_configuration/src/database.rs\u0060, \u0060crates/pgls_configuration/src/lib.rs\u0060, \u0060crates/pgls_lsp/src/handlers/text_document.rs\u0060, \u0060crates/pgls_pretty_print/src/lib.rs\u0060, \u0060crates/pgls_workspace/src/workspace/client.rs\u0060, \u0060crates/pgls_workspace/src/workspace/server/document_cache/parse.rs\u0060, \u0060crates/pgls_workspace/src/workspace/server/document_cache/tree.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 8 separate couplings, not 8 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 8."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b97171aa2fa32d99879aa9ec43c69a86c8ba7c3e52b4ca5357575b69859a17"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: document.rs \u2194 tree.rs: \u0060crates/pgls_workspace/src/workspace/server/document.rs\u0060 and \u0060crates/pgls_workspace/src/workspace/server/document_cache/tree.rs\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00609c133868\u0060 refactor(workspace): no panics in the document and its caches (#1064); \u006019a9300d\u0060 perf(workspace): drop only the statements an edit removed from the ca\u2026; \u00604e4b718b\u0060 perf(workspace): one memory budget for the caches of the open documen\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9560e355fccf78b3929eb3275ee7d52c55bd72ca6c8a764f30b62d90cb0ebbd6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: filtering.rs \u2194 scoring.rs: \u0060crates/pgls_completions/src/relevance/filtering.rs\u0060 and \u0060crates/pgls_completions/src/relevance/scoring.rs\u0060 change together 72% of the time (13 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00602401f198\u0060 fix(completions): complete keywords right after an opening parenthesi\u2026; \u00609740db65\u0060 feat(completions): complete inside MERGE (#1130); \u00607645850a\u0060 feat(completions): complete the columns of old and new in RETURNING (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/relevance/filtering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fcbe35df52fecc37ad232e37a98857c9b4fc8007546ec3d219fc30cfefb542"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: functions.rs \u2194 tables.rs: \u0060crates/pgls_completions/src/providers/functions.rs\u0060 and \u0060crates/pgls_completions/src/providers/tables.rs\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603db26f49\u0060 refactor(completions): remove custom parse for policies, use tree-sit\u2026 (at that commit the files were still \u0060crates/pgt_completions/src/providers/functions.rs\u0060 and \u0060crates/pgt_completions/src/providers/tables.rs\u0060); \u006098ae38f9\u0060 feat(completions): correctly infer (quoted) schema for tables \u0026 funct\u2026 (at that commit the files were still \u0060crates/pgt_completions/src/providers/functions.rs\u0060 and \u0060crates/pgt_completions/src/providers/tables.rs\u0060); \u0060be944613\u0060 feat(completions): fill in alias for columns in join clauses (#392) (at that commit the files were still \u0060crates/pgt_completions/src/providers/functions.rs\u0060 and \u0060crates/pgt_completions/src/providers/tables.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47540162f06d9815d40c3a2b60d4cb9300be144b011f580e7b6bce50686ef278"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: mod.rs \u2192 sanitization.rs, test_helper.rs, grammar.js: \u0060crates/pgls_treesitter/src/context/mod.rs\u0060 changes together with 3 other files \u2014 \u0060crates/pgls_completions/src/sanitization.rs\u0060, \u0060crates/pgls_completions/src/test_helper.rs\u0060, \u0060crates/pgls_treesitter_grammar/grammar.js\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter/src/context/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c68526a8aab55a9d96a657f8202b37a77f16ca127a102fa94260d6e8e52518"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 hovered_node.rs: \u0060crates/pgls_catalog/src/snapshot/mod.rs\u0060 and \u0060crates/pgls_hover/src/hovered_node.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 6 shared commits counted here, the most recent 3 are \u00600625f0c9\u0060 chore: remove dead code (#989); \u00602097b893\u0060 fix: normalise identifiers the same way everywhere (#976); \u00608e6da9d8\u0060 feat(hover): hover on schemas (#514) (at that commit the files were still \u0060crates/pgt_schema_cache/src/schema_cache.rs\u0060 and \u0060crates/pgt_hover/src/hovered_node.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/snapshot/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6bb26a5b02c2fb49295280f47b5b4cad948f0a30e5fe18812a67049032b82b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 settings.rs: \u0060crates/pgls_cli/src/commands/mod.rs\u0060 and \u0060crates/pgls_workspace/src/settings.rs\u0060 change together 53% of the time (10 of the 19 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 10 shared commits counted here, the most recent 3 are \u006072b0def6\u0060 perf(workspace): bound nested configuration discovery (#895); \u0060d89118d6\u0060 feat: support standard postgres env vars for db connection (#674); \u0060c39d3b8f\u0060 fix: address wasm pr feedback (#666) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/commands/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"205231e86da5696cbdb809a2253861eaf83580bde056e17051aad025f2203e5b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: columns.rs \u2194 grammar.js: \u0060crates/pgls_completions/src/providers/columns.rs\u0060 and \u0060crates/pgls_treesitter_grammar/grammar.js\u0060 change together 50% of the time (8 of the 16 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00608668c7d6\u0060 feat(grammar): parse the alias and USING of DELETE and resolve UPDATE\u2026; \u00602401f198\u0060 fix(completions): complete keywords right after an opening parenthesi\u2026; \u00609740db65\u0060 feat(completions): complete inside MERGE (#1130) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_completions/src/providers/columns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbe685b27efa18ab68b4409076305335519e7bab9cbe5ec08bfc6b7de699459"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 database.rs: \u0060crates/pgls_cli/src/commands/mod.rs\u0060 and \u0060crates/pgls_configuration/src/database.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00604cffc840\u0060 fix: keep each folder on its own settings (#902); \u0060d89118d6\u0060 feat: support standard postgres env vars for db connection (#674); \u00602820bb5e\u0060 fix: do not attempt db connection if jsonc section is missing (#375) (at that commit the files were still \u0060crates/pgt_cli/src/commands/mod.rs\u0060 and \u0060crates/pgt_configuration/src/database.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/commands/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cbc62587982bca0b41cb44a4381ff5c6f165042e2c25d38d91379423e173f9"}},{"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":"23068dd0540d1ee00cc92c7c920c65d7dd2923e115e60e43c4fbca7e553330f9"}},{"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":"d101c271a760b567f7485d0e4953e3e6cf587200e5c1dc57f6b72466277f7519"},"taxa":[{"id":"CICD-SEC-4","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":"f565882c0a115fb9578e0145fd6b0e800a1762ed087db622de4d0ffa7bcb5dc2"},"taxa":[{"id":"CICD-SEC-5","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":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","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":"C1","level":"warning","message":{"text":"No data-protection/encryption: No encryption usage (RustCrypto\u0027s aes-gcm/chacha20poly1305 encrypting, ring or aws-lc-rs aead sealing, orion, libsodium\u0027s secretbox, openssl symm, age, SQLCipher keyed by PRAGMA key, pgcrypto, MongoDB client-side field-level encryption, the OS keyring) was found, and this repository persists personal data in the model cited here \u2014 sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_plpgsql_check/src/lib.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7c7c6fd9528a917852fd9413fce65091c6f3a6516e4b39cfe98067fd40c557"}},{"ruleId":"C3","level":"note","message":{"text":"Partial audit-trail evidence: An audit mechanism is present, but the trail is not yet complete \u2014 missing: an audit-log / audit-trail table or model to write to, per-entity coverage (an event-sourced aggregate, or a hook on each entity that needs a who-changed-what trail)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"274a04e524f3228d241c99316455563739cb06cfd10a01e446d00b8a14956083"}},{"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 7/14 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/pgls_postgres_regress\u0060, \u0060crates/pgls_test_utils\u0060, \u0060docs/codegen\u0060, \u0060packages/@postgres-language-server/cli\u0060, \u0060packages/@postgrestools/postgrestools\u0060 and 2 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060loadWasm\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/wasm/src/common.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eeb0fba4e7292b8a95e8f4e715e3a5b080552b62c0073ef331d68150000946"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 17 typed \u00B7 10 plain JS \u2014 the untyped files are crates/pgls_treesitter_grammar/grammar.js, packages/@postgres-language-server/backend-jsonrpc/tests/transport.test.mjs, packages/@postgres-language-server/backend-jsonrpc/tests/workspace.test.mjs, packages/@postgres-language-server/cli/scripts/generate-packages.mjs, packages/@postgres-language-server/cli/test/bin.test.js, packages/@postgres-language-server/wasm/e2e/lsp-worker.js (\u002B4 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (6 clone groups): 6 duplicated blocks under packages/ have copies in at least two of the sibling directories @postgres-language-server, @postgrestools \u2014 5 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f8782049a0239e460d9720ed98a1b772f145ac77a6e7397046ca7c3e8461ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (190 matched lines \u00D7 2 locations): packages/@postgres-language-server/cli/scripts/generate-packages.mjs:7 \u00B7 packages/@postgrestools/postgrestools/scripts/generate-packages.mjs:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 1387 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce218cd5e8947df87ee58fef27ba70a25a8c96385a512806dae86934a5a3f950"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (144 identical lines \u00D7 2 files): packages/@postgres-language-server/backend-jsonrpc/src/transport.ts:1 \u00B7 packages/@postgrestools/backend-jsonrpc/src/transport.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 144 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0185a193d2d57205b615bd3bd29469bfd43f9525b8c7017dc1cc8d29751769a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2 locations): packages/@postgres-language-server/backend-jsonrpc/src/command.ts:8 \u00B7 packages/@postgrestools/backend-jsonrpc/src/command.ts:8 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/command.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac35a09056ea8fc3b182cb3055fe8d4340069f8d7955416644057214baaae53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/@postgres-language-server/backend-jsonrpc/src/socket.ts:4 \u00B7 packages/@postgrestools/backend-jsonrpc/src/socket.ts:4 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/socket.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfc71df6e035fd6373c7805f3b6aa48596fc82be87f03ab081b2c636a2a8191"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/@postgres-language-server/backend-jsonrpc/src/index.ts:12 \u00B7 packages/@postgrestools/backend-jsonrpc/src/index.ts:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/backend-jsonrpc/src/index.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2d592e8c2952d3a97d3d5dfa2e43831ab1532e2ca61c286a9243252ce3e655"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:976 \u00B7 crates/pgls_treesitter_grammar/grammar.js:2702 \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. Check what actually differs between the copies before collapsing them: every one of them is an argument to a \u0060grammar(\u2026)\u0060 call, so where these calls are a MATRIX of cases \u2014 one per input, differing precisely in the case each one pins \u2014 the repetition is the enumeration and extracting the shared part would delete cases rather than de-duplicate anything."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"102042ce37b9c4fb71e33b9751c73a1505ff82a95333389a7d1d9fd1a55cea95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:2589 \u00B7 crates/pgls_treesitter_grammar/grammar.js:3612 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"57da1b6132fbf34c65a1917f9e70e189473c79b97bade07ce074292fff303df1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/@postgres-language-server/wasm/src/workspace.ts:53 \u00B7 packages/@postgres-language-server/wasm/src/workspace.ts:77 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/wasm/src/workspace.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee93abe2a6875cd89d63b6c50ce2f1c07b5791a7bd1d6abac57cdee7f001af55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:3827 \u00B7 crates/pgls_treesitter_grammar/grammar.js:3839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f794ed5c6a739eb8e2f8aca7f13c225f9194f5bad31750b0d33c3d7eb7a191db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:2427 \u00B7 crates/pgls_treesitter_grammar/grammar.js:2538 \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. Check what actually differs between the copies before collapsing them: every one of them is an argument to a \u0060grammar(\u2026)\u0060 call, so where these calls are a MATRIX of cases \u2014 one per input, differing precisely in the case each one pins \u2014 the repetition is the enumeration and extracting the shared part would delete cases rather than de-duplicate anything."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a04d4a998127f5398fde106b6a0805570a07793a5a291b0a4ca262eac517a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:590 \u00B7 crates/pgls_treesitter_grammar/grammar.js:608 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb83098b89fbfcae2454c6a373c1cfa7442e896f5a00ae9d59d3f9dea4d48f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:3169 \u00B7 crates/pgls_treesitter_grammar/grammar.js:3359 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":3169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d03552082ca5a667778bb7843f58e7fb6ba84eae271d53c86697e493000a488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:1328 \u00B7 crates/pgls_treesitter_grammar/grammar.js:2548 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e8374ecb0d2ec87853f399fa15515076a13bb69c25e4e23f318e473833b7f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:3359 \u00B7 crates/pgls_treesitter_grammar/grammar.js:3369 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b768f55831c2417f558eedb93c969acfe31f6e85705d5b5ca1ea5332a7379a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/pgls_treesitter_grammar/grammar.js:1623 \u00B7 crates/pgls_treesitter_grammar/grammar.js:2048 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"82890e0ffbb6c2eeb88f906047b79dd2a42a68edf1d89c14c54f6a615b9fb733"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/@postgres-language-server/wasm/src/lsp.ts:58 \u00B7 packages/@postgres-language-server/wasm/src/workspace.ts:59 \u00B7 packages/@postgres-language-server/wasm/src/workspace.ts:87 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/wasm/src/lsp.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e700e9a5b392ba0d9e9999491503dafa60bed4ca95273ab350ab33f69c516f8d"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/pgls_treesitter_grammar/grammar.js: 3923 lines of code: crates/pgls_treesitter_grammar/grammar.js has 3923 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e985712737643ea6d0f109aa390ccf8128c1538623f0de897331bf01871ddf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_treesitter_grammar/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1340c5632267a8b6feca7d31141d91e07a90787cdad5d5af7b62e5adbc2af0eb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0f8d41607fee82eda5075a26dc85cef8ccfd1d36770c24bea0be335ae29d6e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/postgrestools/scripts/generate-packages.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fda47bffa4c74ada485f5410114074333e360080b3a22e8a0b36612f78fef3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/wasm/src/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489949aa2047adcdc853ec3e9b2b01eefc8c4a4657c726c896ae9e8eae68944d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(\u0022id\u0022 in message) \u0026\u0026 \u0022method\u0022 in message \u0026\u0026 typeof message.method === \u0022string\u0022 \u0026\u0026 \u0022params\u0022 in message\u0060 appears character-identically in 2 files \u2014 packages/@postgres-language-server/backend-jsonrpc/src/transport.ts, packages/@postgrestools/backend-jsonrpc/src/transport.ts. 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":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e37e6a80ca28ca2582a5a8f601241a05c3215c804dc353c057da87bb88b93a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022id\u0022 in message \u0026\u0026 typeof message.id === \u0022number\u0022 \u0026\u0026 !(\u0022method\u0022 in message) \u0026\u0026 (\u0022result\u0022 in message || \u0022error\u0022 in message)\u0060 appears character-identically in 2 files \u2014 packages/@postgres-language-server/backend-jsonrpc/src/transport.ts, packages/@postgrestools/backend-jsonrpc/src/transport.ts. 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":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10eb74f15a9d4db7e38e3ab374461959223f0abd20355bb48784ddfb2358038"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022id\u0022 in message \u0026\u0026 typeof message.id === \u0022number\u0022 \u0026\u0026 \u0022method\u0022 in message \u0026\u0026 typeof message.method === \u0022string\u0022 \u0026\u0026 \u0022params\u0022 in message\u0060 appears character-identically in 2 files \u2014 packages/@postgres-language-server/backend-jsonrpc/src/transport.ts, packages/@postgrestools/backend-jsonrpc/src/transport.ts. 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":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b640af648da8b48cbe71570634055cc3ce657051a3f00c1a0fc75f9695ceca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060platform.endsWith(\u0022musl\u0022) \u0026\u0026 arch === \u0022aarch64\u0022\u0060 appears character-identically in 2 files \u2014 packages/@postgres-language-server/cli/scripts/generate-packages.mjs, packages/@postgrestools/postgrestools/scripts/generate-packages.mjs. 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":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6145cd354062053160bb6b559ec3673bed9d4baf97addfd5e698906396a57b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof err === \u0022object\u0022 \u0026\u0026 err !== null \u0026\u0026 \u0022stderr\u0022 in err\u0060 appears character-identically in 2 files \u2014 packages/@postgres-language-server/backend-jsonrpc/src/command.ts, packages/@postgrestools/backend-jsonrpc/src/command.ts. 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":"packages/@postgres-language-server/backend-jsonrpc/src/command.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"936d450afa8bd6bfaad2bf3ec23a559e7d218e05062e3128ba853edba04b4c75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof message === \u0022object\u0022 \u0026\u0026 message !== null \u0026\u0026 \u0022jsonrpc\u0022 in message \u0026\u0026 message.jsonrpc === \u00222.0\u0022\u0060 appears character-identically in 2 files \u2014 packages/@postgres-language-server/backend-jsonrpc/src/transport.ts, packages/@postgrestools/backend-jsonrpc/src/transport.ts. 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":"packages/@postgres-language-server/backend-jsonrpc/src/transport.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d172a34e51635667b4e2df42d1011e7cb3fdca2d8ac95e28ecdce449f36e89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(i \u002B 1).is_multiple_of(STOP_CHECK_INTERVAL) \u0026\u0026 should_stop()\u0060 appears character-identically in 2 files \u2014 crates/pgls_workspace/src/workspace/server/analysis.rs, crates/pgls_workspace/src/workspace/server/walk.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/analysis.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3692dcff83b874344ae8064f27198ae5a22604be700690d5d00253c14a845b2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(field.r#type, FieldType::Node(_)) \u0026\u0026 !field.is_one_of\u0060 appears character-identically in 2 files \u2014 crates/pgls_query_macros/src/iter_mut.rs, crates/pgls_query_macros/src/iter_ref.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/iter_mut.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c4e1d04c7eaa03f4d0cfd0db72f699deb57b587fb594a337c011540123762"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(field.r#type, FieldType::Node(_)) \u0026\u0026 field.repeated\u0060 appears character-identically in 2 files \u2014 crates/pgls_query_macros/src/iter_mut.rs, crates/pgls_query_macros/src/iter_ref.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_query_macros/src/iter_mut.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"206648346e69f2e21e8a56734a49911d957badfaf136eacd4c2cece6fb6f3a38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.constructor \u0026\u0026 !constructor.agg_order.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/pgls_pretty_print/src/nodes/json_array_agg.rs, crates/pgls_pretty_print/src/nodes/json_object_agg.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/json_array_agg.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd74c1965b922912c43e4a4ea5b92f7e82da0708b938676e3359d7f06a25f162"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060schema \u0026\u0026 r.check_schema(schema, n.location)\u0060 appears character-identically in 3 files \u2014 crates/pgls_catalog/src/resolve/nodes/func_call.rs, crates/pgls_catalog/src/resolve/nodes/range_var.rs, crates/pgls_catalog/src/resolve/nodes/type_name.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_catalog/src/resolve/nodes/func_call.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"428a18b12737ae922618af26ac1b80fb1d85be1a63b4c639f39bfedf02dc3bda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sub_link.sub_link_type == SubLinkType::ExprSublink as i32 || sub_link.sub_link_type == SubLinkType::ArraySublink as i32\u0060 appears character-identically in 2 files \u2014 crates/pgls_pretty_print/src/nodes/a_expr.rs, crates/pgls_pretty_print/src/nodes/utils/predicates.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_pretty_print/src/nodes/a_expr.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e54c64025cb62354bbd7f15c6537988fa54498ee49c0e7263d5cf4205ee50aa"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/5 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadSchema: \u0060downloadSchema\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/postgrestools/scripts/generate-packages.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"845c4d9249b1f8ba467a6a5d4c23b46e07a18b66e3b6f7aeb47e120c393d9581"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadBinary: \u0060downloadBinary\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgrestools/postgrestools/scripts/generate-packages.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c93ee418b499ba1bcab4eee50f38b3e2bb97dcea96f2f21fa99e21f3b92d9f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadSchema: \u0060downloadSchema\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a34813951cf0f890c51dbf15cc05a115fa2921b70788a697220158fa2990b17"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadWasmAssets: \u0060downloadWasmAssets\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d603f3a914cdf2fedd964bcfcd6c451c87e00e22ca27e59d032ded27298652"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadBinary: \u0060downloadBinary\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@postgres-language-server/cli/scripts/generate-packages.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa99f7b97d26b36069b308c544023e84a9bcf2d4c716ce9bbaaeb0c28e157576"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 108 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/settings.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"047ddcffb1feaf047631638e1ecd87cf6aa454bd0db7e842438f4b0deea1ec49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 971 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/settings.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8e6f45bdadffc7dbd281cec973ad08028e894195569c3715cfce075a5d0fb7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1006 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/settings.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bfe368bba16c35356c67c68cc136aa195c53a4ba524195b5d5f4b31a126086"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 249 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbba940a7e1d8048514c4a9d207311a901ead77a2db61f64fe1e3ca29ea75bfa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 603 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0c2c493392c690298962f8709f9247c0a2df16e0ead3f1ba2658d229bff487"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 653 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92f89f2c84d17e0fa485ee9b4d392e2def9b0ce28b6755591b2e6c79fa5ab74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1298 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a048d0b9db99196d1eeb60651f90d7adf52b2107ee80b9c68a2a6e890720e594"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1332 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"619b0c9b56133030aab6831c194dfda9ae1f2a57370da256cd25fa60a6dc95fb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"81883ec6eee42a81a74b791019942bf0260cd05b115dfd7570007f2a54f92ccd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 198 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c717f59699cb25c66e073a0619018cb8031ac14b52aad0019b49b9dd527d5e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 262 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7136552ddd14a9ae81c58e9e4c3919dd610f88ecd9dc6ea354bcac8a21c8704b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e69326eccd4ca4abed4f858afa07e8713f989bf6b7db2c443f1f2bd01e07f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 394 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcf911af8809c96b38f18552d20e101b7465ce3c68c5e90ddbc3e0437a436e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 423 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/connection_manager.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba96ae6ad994538cf8dbf767c0a2d53064515132248c2042deccd708d93d96a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 104 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/document_cache.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcb79633ce9e80b3b7be0c1a61b46903459de932fd08b436e957ba55982b141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 80 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/pgpass.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b28756caa60d604f9627f39d44da38f5c3a7fe9691383050a57455e668f7eeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/pgpass.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0967404d66b607204b08c89ef8198f2ff654ca86d2456be78d43bb19c554976"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/snapshot_manager.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a129f7348265d3c6a0a9ce7bdea6cab592c774c304fc67b839af27da8262656f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/workspace/server/snapshot_manager.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6466a9dfc16f0316b8be89d5f0e08294656852efcfe0ab3f025c8a1cd9bb504a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 138 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/features/code_actions/execute_statement/execution.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf653c36431aa6124c64c7d1c8b6fadfdb69b6c57101a26bc2a0811d23650b6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/features/code_actions/execute_statement/execution.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fc591810baa3dddcc3a66bffabb076d91d851ecc7b428ad296d0922f2b7415"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_workspace/src/configuration/project.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"717487af190d582f0a45194a93a50c8f2b55c6dd80ecc40c5fcf46f931467af0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 181 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/server.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec93a66bf5ac5e48ea411c3ef2f93fc645b37e9e954fb161b31a952206a4ad0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 203 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/server.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4beec3224c2017be84e0dad0ceba68dfd1d4982c928b4d4f798ccec27fb51211"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 221 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/server.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67c9af2efd8cc4b6f602378f0fd98268d02082ad8abc6df9924f527fc32d3ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 308 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/server.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21c6b12e805aa68f1a0eeb4b0f4f9c197f7c11169eb56aceeeb1f9a73091d98"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 377 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/server.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2512f20eefc96968858a30092b7b26ab1c59b69b4c6281e92b6c463f5a74f943"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 486 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da45eb6c9b8561497cacb19d22889dff95a0d58ea2504a5f189770fc71b1a54"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 492 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e1d9d27b73f5b582cc968f05e1db890cbcd455e4d234d50081a7d6ef3860f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 498 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"581f063e93e1d8ecc21193afc1ee52f5fdc68a1f14c883a8b859edda2d16632a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 501 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09439975240bb1d5344532b550c42d5444b43b934fae5664bb93af2a6bd71a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 552 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"68119f6014aced17f46ce30031eac5f6a2ecb7d660be696bbfb3cfc3cb86ffc8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 563 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ed931f6b43b77b8bc3f7f240e6f7782f0e52abea58595729c56b7adb103a25"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 624 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e6d4e600f9a8924fb1458446a10ae98d0f26a2be3e5a0b0a021ccd8386a3a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 627 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea98a746f19f482f30db20b686c5e235e20e788d2d873ad6a84d8fa4ed12cac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 652 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc511b8fb10e8fb11b09924a7d473fc886737aa011b24c5735e22cd4968f49b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 683 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bd8fef5e57d9a90b2e38d0875833ff45109650356aa35cc867e949754a324e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 771 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5677f1941040c4c2a9f989179252cd9a2dad783f303ce8761e6cdaa00d460f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 793 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefaf83453fee26f1eb9e57e76d18eaacd21513b01c470fcc252cb77e7bde4e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 807 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c4fcd34c3d33911c0865fbde315b51913db0ad63f3027800ccb8787959b046"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 866 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6273583cdf1443dae446567e6b7bc1e7f9c90513054e58f0b035f08c953aca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 907 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c86e215799a6a5bd6621569dd217509ab9e95e9d78a1be52a77814e3378ac33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 926 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c66f52f2e30a63629247a6525298ed7f5d2784d19d173dc7d1167f4fa7a457d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1052 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a4eab92c9652f214b61b22a099c22111e55637a2f7f5bf5c102168cf9b1ad4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1057 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8a236d497c8e13eaa4372b940817ec7b3736e08a8df1cc0e9f18444a253d94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1063 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b49172cec2ed1d46dde381b395d15cc6f858b72d7c981facfccb58c468f72d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1077 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"377a73a454ccb7ce590083307f01efb51bb99423565d84d7f1124da3f9a79cab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1079 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/session.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6471833e763c2d280c71db98eda6db7f4e041645cd9c19536177d01b5effa8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 143 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/utils.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e84e3836a27b08cc099de78f9548bc3bbc66eeea62c3086f797777535be3c24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 406 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/code_actions.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"685717f31434f12f5c042dc751a9c4d323960227563b6d071cd81104289bc2b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 68 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/completions.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a81d22aeba9ee305f7469f99baebac07c28dfd8deee58155a9e0fb7c03c901"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/configuration.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d3a699cb1be7ffccd6e814f71ed53c4c75fd6d20ee184384bb7283facb8e89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 22 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/hover.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"348526a6c1afe1f3a15abf04621b62fbdbd720bdda755ebecd003510827a8721"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 51 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/hover.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbc29cc727434f4dfdd37ca119e1839720d913d4e25aceafac3af633f4a1999"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 46 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/inlay_hints.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ed87f84ed1926b01e8b4ea4bab0092a51c2b1267d83ca32ef4662404647c39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 33 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/text_document.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e323a23c704795a666e67a043dc3dce6702f47ab1567a28b75ce26276ae345c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 61 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/text_document.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5170575576167df3e091b7b87dd270a310f84ea5e8c24c550bf2e97bc44bfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 62 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/text_document.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e984443d4b4fec53a5409a94655ca4aa0785dec081faa0983521f1a8f6eb15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 70 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_lsp/src/handlers/text_document.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3b13a643f7c173a3e1b167525b79c56a02bab02d58698200f810520f2a4497"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 16 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/dir.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d9275639899a18b36d9cf524c11b8be74ec363f1bd3ee66db8396e7e1cfd67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8931ecb95bff4aba88769cd1da06b1dbb9193679da7f0fddb430289ae466a80b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 160 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"86507e69d3da68f324a18d8dfa80034b5e39010ed651718169704be1c0cefd69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 170 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"089e2e42df6e5124f35b64563d89a73e91cb3faf858a962561af54bd335a2665"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 46 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/panic.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c291fedd26ba2c44a89adb22e02c5dec1027686069e3538b0bd7d217202947"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 48 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8bf496c9fb2b57484dd890b35b3cba7acd6f6707b47d018b7ed127ae26d53f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 66 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b36f474363d538a921d0d96fb58e46be06d2d41d1311f20d664a1c8f03f326f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2b1718a649950f8c3b6169037e552939406185d7a5c45ae46a2ca31de535b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 213 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_cli/src/service/unix.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6897647ceccf243b2f58b6f506ce08448f1aaafed1c7aceb7273e4a913645fd2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060inlay_hints_of_references\u0060 turns every \u0060Err\u0060 into \u0060Vec::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":"crates/pgls_inlay_hints/src/lib.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"413687f7dc789572b2ce23893d5a500e0f5dc4aea0ffce7e21d2a697da3d4023"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060entries\u0060 turns every \u0060Err\u0060 into \u0060Vec::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":"crates/pgls_migrations/src/detect.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b9cdaa29c30f0dcc3c42a1faec471d9218dcaed731df434a029f9116f8a785"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060keywords_after_comments\u0060 turns every \u0060Err\u0060 into \u0060HashMap::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":"crates/pgls_pretty_print/src/comments.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d8e254f7aac24f0e63add16aace953334d357e4e2c6f1c0542fdc7dedbbbca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_comments\u0060 turns every \u0060Err\u0060 into \u0060Vec::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":"crates/pgls_pretty_print/src/comments.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8ec54a7f3d3d39e24867fbc218989965a93e57be46e5a9f05141f3e6efb2ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060truncated_identifiers\u0060 turns every \u0060Err\u0060 into \u0060HashMap::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":"crates/pgls_pretty_print/src/identifiers.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b744fc4789f59a04446a0b10ca5430444ba70ea70ed0b715e6c29d03a2f964c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_unused_suppressions_as_errors\u0060 turns every \u0060Err\u0060 into \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_suppressions/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4fe01a8b4ec91f2a459a93d9588e85f2de48cc886f5d1e6f564f2cc746f957"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060base.starts_with(\u0022./\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060base.starts_with(\u0022./\u0022)\u0060 also satisfies \u0060base.starts_with(\u0022.\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pgls_fs/src/fs/memory.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3548a1ab1462770a44cd9d1efb53a0684d4d601507494b5fdb57ce600b9c12"}}],"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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-321","guid":"0ce564a5-a44c-3358-b3db-317712e6e019","name":"Use of Hard-coded Cryptographic Key","shortDescription":{"text":"Use of Hard-coded Cryptographic Key"},"helpUri":"https://cwe.mitre.org/data/definitions/321.html"},{"id":"CWE-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-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-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"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":126,"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."]}]}