{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"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":"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"unnest_subqueries.decorrelate (cyclomatic 101): unnest_subqueries.decorrelate has cyclomatic complexity 101 (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":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba49a265307a3d072390b0332c075cc2c17dccd8510e0d530bdfda2ae281d4"}},{"ruleId":"D1","level":"warning","message":{"text":"canonicalize_internal_names.canonicalize_internal_names (cyclomatic 85): canonicalize_internal_names.canonicalize_internal_names has cyclomatic complexity 85 (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":"sqlglot/optimizer/canonicalize_internal_names.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3886edf558fc5efc227dddce26a7c094b68b581c0d2feb449b2e94f5be4d113"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_types (cyclomatic 78): Parser._parse_types has cyclomatic complexity 78 (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":"sqlglot/parser.py"},"region":{"startLine":6854}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2850d1df5d2aec7aa15e4a0bd110e103d6baa8c4c2f5c9e7c6bcf3ca819794"}},{"ruleId":"D1","level":"warning","message":{"text":"lineage.to_node (cyclomatic 76): lineage.to_node has cyclomatic complexity 76 (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":"sqlglot/lineage.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"073f5bf0ba6ef4d46d58d837b1b9800902e9e6ab5b7b087049ed41db7fe4f5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"pushdown_projections.projection_reachability (cyclomatic 74): pushdown_projections.projection_reachability has cyclomatic complexity 74 (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":"sqlglot/optimizer/pushdown_projections.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce094b78a1ce0772de9834ad83d9b3985067f5c70be0a4d5739ee4ecd6e19f88"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._expand_stars (cyclomatic 71): qualify_columns._expand_stars has cyclomatic complexity 71 (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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80fb94884f812fd76ac68fd49c19232f7350662ce2f3d379e7d48a7fb0a3dda"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_create (cyclomatic 65): Parser._parse_create has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9da4ee28153d40be100009670241daa44d8e4cab79f6b754b35c93b1e5867cd"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_tables.qualify_tables (cyclomatic 62): qualify_tables.qualify_tables has cyclomatic complexity 62 (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":"sqlglot/optimizer/qualify_tables.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a11b681594249a952b191267186b0d387f7f3eb0f32f4913eb6ca10effd8c"}},{"ruleId":"D1","level":"warning","message":{"text":"Simplifier._simplify_comparison (cyclomatic 52): Simplifier._simplify_comparison has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"d964794c862da0a401c0ed02cbce5a0620ab1f52326bd1f45426bcb61b2fc13d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_table (cyclomatic 51): Parser._parse_table has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":5215}}}],"partialFingerprints":{"codehealthFindingId/v1":"79276fbe45ed9e662395c6322dbfc85178caa5259c0d63ca875b3e78f80d879c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_select_query (cyclomatic 50): Parser._parse_select_query 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":"sqlglot/parser.py"},"region":{"startLine":4167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8575efde245b6032c40e10bba92c0795ad450aea8a2df32a36db479c7ae06601"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._expand_using (cyclomatic 45): qualify_columns._expand_using has cyclomatic complexity 45 (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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"965fd2486fffc5474838ae6d5c026e7c82378fa4e72b43277f8395d0c1f93683"}},{"ruleId":"D1","level":"warning","message":{"text":"Step.from_expression (cyclomatic 45): Step.from_expression has cyclomatic complexity 45 (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":"sqlglot/planner.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f730522842fb34ae0032dfe1fa22cf227646ea886496963d741225eedd62650f"}},{"ruleId":"D1","level":"warning","message":{"text":"Simplifier._simplify_binary (cyclomatic 44): Simplifier._simplify_binary 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb25728a41e8940a818d986bbf7de3be40a6a2c95d9f5dace86e8056de6bbde"}},{"ruleId":"D1","level":"warning","message":{"text":"unnest_subqueries.unnest (cyclomatic 43): unnest_subqueries.unnest 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":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c5f05d82969364c06c4b78b5eccdaac12e1b66bb3b56553912a29837efa834"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerCore._extract_string (cyclomatic 40): TokenizerCore._extract_string has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/tokenizer_core.py"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"02010d348e039839e5671eb7f861b7942a57d040ce757ac096c70c6b491ae8f9"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._convert_columns_to_dots (cyclomatic 39): qualify_columns._convert_columns_to_dots 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"22021754008d2afa98bdb35b5db067c8f29c35e44a9e12dae64a8cb8a1852ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.get_source_columns (cyclomatic 39): Resolver.get_source_columns 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":"sqlglot/optimizer/resolver.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"074001833ce58291049b699a2f4d09e883166e2090b0b3c21c8b9b5982aea200"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_join (cyclomatic 38): Parser._parse_join has cyclomatic complexity 38 (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":"sqlglot/parser.py"},"region":{"startLine":4863}}}],"partialFingerprints":{"codehealthFindingId/v1":"2311eded0ae6ce3677475937ddb333aef3d960a595a3c6a1fc4917c53a405007"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeAnnotator.annotate_expression (cyclomatic 36): TypeAnnotator.annotate_expression has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd17541c54883621b0f0c65c50fc7dcd8a69a3b2904d79477ecb658788faa6c"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._qualify_columns (cyclomatic 36): qualify_columns._qualify_columns has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ff0ef430eaeb9e4214690de1942d898f43f3935b4d48f30263cf1fb8407055"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.ordered_sql (cyclomatic 35): Generator.ordered_sql has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8515cdec970bd682cd58591418a56c4757a1421dad226fb962ca27b37381889"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._expand_alias_refs (cyclomatic 34): qualify_columns._expand_alias_refs has cyclomatic complexity 34 (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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c8a56302e8baeeff3a7a23c2fe529ee022113a7356acae7b9cbb8147d1dee"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeAnnotator._annotate_by_args (cyclomatic 32): TypeAnnotator._annotate_by_args has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cddc20fa842c2231cd355685c983e471be215b60a58877d7eb31197f5dd7a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_function_call (cyclomatic 32): Parser._parse_function_call has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":7603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1687613c48f7b43d73a5bef0776542fa152f8e6c9e1f261521abc04ede187e"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerCore._scan_number (cyclomatic 32): TokenizerCore._scan_number has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/tokenizer_core.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d626171da06746a7c65bc44cbb1d606848d2172bf9f95d326fec65e35a82bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.create_sql (cyclomatic 30): Generator.create_sql has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"495c9cc339b1f15eff19a36636768e1862d3ff311e36fe43832414a881fdd58e"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._expand_order_by_and_distinct_on (cyclomatic 28): qualify_columns._expand_order_by_and_distinct_on has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec121dab6cf4b8c99348df91e2a8d1ddc5eea830ab003f693b26d9490e8d0a70"}},{"ruleId":"D1","level":"warning","message":{"text":"Scope._collect (cyclomatic 28): Scope._collect has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/scope.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfc2877f180534c12a4a3cf27a1ba3ff6922a8fc096a06f7e833b017cd6725e"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.join_sql (cyclomatic 27): Generator.join_sql has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"b033ed3e1ee422595e181bed12e74237c0990ac5b5c52c1cf1d4736f54799a79"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeAnnotator._get_source_scope_selects (cyclomatic 27): TypeAnnotator._get_source_scope_selects 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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"481b47792e25dc3d53bf8aac8a06e7bdf20eaa78ef75d870ad6eb0a3fc9bc3a0"}},{"ruleId":"D1","level":"warning","message":{"text":"pushdown_projections.prune_projections (cyclomatic 27): pushdown_projections.prune_projections 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":"sqlglot/optimizer/pushdown_projections.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd6bd78ce4aa69a64278e2308c0ef87654df7ce35db50247e8f58994a3b1549"}},{"ruleId":"D1","level":"warning","message":{"text":"merge_subqueries._mergeable (cyclomatic 26): merge_subqueries._mergeable 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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c8144783cd44340e4abe3e30755b830d714a14c9c0d6679e0f3303a0908983"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerCore._scan_numeric_escape (cyclomatic 26): TokenizerCore._scan_numeric_escape 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3835821bdacf1612a068079bef433611c5befabdcd54cca72335291003be0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_pivot (cyclomatic 25): Parser._parse_pivot 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":"sqlglot/parser.py"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10dd7a121be16752cd59caad0d567bd1223a01060717d6e2a7d88126ebbd5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_interval_span (cyclomatic 25): Parser._parse_interval_span 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":"sqlglot/parser.py"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"245534639653a5f7155232668c2023c85bd31c6fc7565eb98aa4c385625f98f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_alter (cyclomatic 25): Parser._parse_alter 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":"sqlglot/parser.py"},"region":{"startLine":9739}}}],"partialFingerprints":{"codehealthFindingId/v1":"be50d897636bcf1d48f99ec3ad4f67a43cf7c8e4ff5d5ac802509b2bc0a3a43c"}},{"ruleId":"D1","level":"warning","message":{"text":"bigquery._annotate_array (cyclomatic 25): bigquery._annotate_array 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":"sqlglot/typing/bigquery.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b6ab622da372d76dddca0fe55640a37450f50bcdd5553c7c59e1b3b60324a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression.__hash__ (cyclomatic 24): Expression.__hash__ 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":"sqlglot/expressions/core.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0e3b01c639781b42a3a0786aa4e5cb52ed2eeae8dbd17e77b5d02b933fa16c"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.alter_sql (cyclomatic 24): Generator.alter_sql has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76dcde3e82967a620b9cf7978a27e14ca6c8a741f6c50fc97f1065765abebab"}},{"ruleId":"D1","level":"warning","message":{"text":"scope._traverse_tables (cyclomatic 24): scope._traverse_tables 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":"sqlglot/optimizer/scope.py"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f89e873b9adfb3237a208bf4c40783cad121f5497f6ee27fbe6d3b2277adc89"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parse_set_operation (cyclomatic 24): Parser.parse_set_operation has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":6152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e484b6c8c1536fb7c216ebc9f54058e7499496d88623bcd175c67116f7d91c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_window (cyclomatic 24): Parser._parse_window has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":9071}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d50a7f9a809b3178dc65cc8e57235818a35fdc15c0dc1832472d3bbafe34215"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.set_operations (cyclomatic 23): Generator.set_operations 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":"sqlglot/generator.py"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"97923bf08a2d6891447eea882b40190e72ac90ce4b60cd8b7c2246a3bbf07a5b"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.select_sql (cyclomatic 23): Generator.select_sql 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":"sqlglot/generator.py"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f074b2ef22dbaa3b1f81336ac6dd44e2d321533c8ced3ac3d9acd7308a9d06"}},{"ruleId":"D1","level":"warning","message":{"text":"DuckDBGenerator._regexp_extract_sql (cyclomatic 23): DuckDBGenerator._regexp_extract_sql has cyclomatic complexity 23 (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":"sqlglot/generators/duckdb.py"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f5fdb2869405586681132f5ca7c71252ee909300136a611b7ae33d0991ee7e"}},{"ruleId":"D1","level":"warning","message":{"text":"snowflake._qualify_unnested_columns (cyclomatic 23): snowflake._qualify_unnested_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":"sqlglot/generators/snowflake.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef89e0939a15cbf282fad5394f5330b464cb02168ee01cbf6343c16495f645d"}},{"ruleId":"D1","level":"warning","message":{"text":"Simplifier.absorb_and_eliminate (cyclomatic 23): Simplifier.absorb_and_eliminate 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c02e860db5b92989c55c94246e273e631a47ca3f9b18fae2dfab0af15634b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_match_recognize (cyclomatic 23): Parser._parse_match_recognize 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":"sqlglot/parser.py"},"region":{"startLine":4687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b626571cb446b240ade0084dba9aae92f02264fa6b7365a11d0b966c60bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"MySQLParser._parse_show_mysql (cyclomatic 23): MySQLParser._parse_show_mysql has cyclomatic complexity 23 (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":"sqlglot/parsers/mysql.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13cc564a60d0a032e1a13d06e95372cf2db20f27b547b7f2dbb149c1ff47e65"}},{"ruleId":"D1","level":"warning","message":{"text":"merge_subqueries._merge_expressions (cyclomatic 22): merge_subqueries._merge_expressions 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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2270e5b1f14c1e2f09569d71ba3c9b9d1dd965bbe2dc34c89b456bfb04bb7dd4"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns._qualify_positional_column (cyclomatic 22): qualify_columns._qualify_positional_column 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc92068338ed3c240b422a062176d6edbb1471ca4f814e4bc51cb66407bc1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Simplifier.simplify (cyclomatic 22): Simplifier.simplify 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb02702d7b9b68588b65c82ec677dfb4ffc2a5bf0c08793afb619bf7805d2fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_column_ops (cyclomatic 22): Parser._parse_column_ops 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":"sqlglot/parser.py"},"region":{"startLine":7397}}}],"partialFingerprints":{"codehealthFindingId/v1":"416dad21a2cb43519980d27b6a9ff1c8473ded69f4ec0e6c9612098ec63ab657"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_column_def (cyclomatic 22): Parser._parse_column_def 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":"sqlglot/parser.py"},"region":{"startLine":7911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea986e146459b5640d7fc7a0f66b9b6480ab298846f54e2aaa7e59177e431c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_alter_table_alter (cyclomatic 22): Parser._parse_alter_table_alter has cyclomatic complexity 22 (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":"sqlglot/parser.py"},"region":{"startLine":9584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6164e25833fd14d27434723f341478ccc8e10fccb8fcc2cc1fb228e04b48ac"}},{"ruleId":"D1","level":"warning","message":{"text":"pushdown_predicates.pushdown_predicates (cyclomatic 21): pushdown_predicates.pushdown_predicates has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b9d11ec655a35b78b5d17bad4ee454d0944010766f4d1a333fee186aeaa05b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_table_parts (cyclomatic 21): Parser._parse_table_parts 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":"sqlglot/parser.py"},"region":{"startLine":5144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b29a000e77cf415fbf97c518f811816be8bcc879a15d05ce0411ca953bc128d"}},{"ruleId":"D1","level":"warning","message":{"text":"transforms.eliminate_join_marks (cyclomatic 21): transforms.eliminate_join_marks has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/transforms.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1e5b350b2fa3e5702440984cf3012fb440ed9c13d3aed5dfc80f87aafc8deb"}},{"ruleId":"D1","level":"warning","message":{"text":"_Dialect.__new__ (cyclomatic 20): _Dialect.__new__ 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85b879133dbecaff40400d07478468600a63f846f8822fa431388b2561b5399"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.table_sql (cyclomatic 20): Generator.table_sql 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":"sqlglot/generator.py"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d4247e60e17ea29873e133a23a27e70bba44f5e7b48b5d6c76c046d56bf00"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.expressions (cyclomatic 20): Generator.expressions 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":"sqlglot/generator.py"},"region":{"startLine":5090}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fccabd2aaffbbc67a959bb73304e3013100bf16186925a4fb201712016ccb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.when_sql (cyclomatic 20): Generator.when_sql 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":"sqlglot/generator.py"},"region":{"startLine":5190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6b3a4f14632fa1373ce1d9c06c9846309f6a144c7d2417c95e343b8f764c41"}},{"ruleId":"D1","level":"warning","message":{"text":"duckdb.connect_by_to_recursive_cte (cyclomatic 20): duckdb.connect_by_to_recursive_cte 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"44357427390afbe634aec2aded4d58da63bcef1c005f268553acb2fdf4f4b947"}},{"ruleId":"D1","level":"warning","message":{"text":"TSQLGenerator.create_sql (cyclomatic 20): TSQLGenerator.create_sql 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":"sqlglot/generators/tsql.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9b416ce38e6ecbd149faae3cc2ac9b2c4061b9298af9da54c1572998ad086c"}},{"ruleId":"D1","level":"warning","message":{"text":"eliminate_subqueries.eliminate_subqueries (cyclomatic 20): eliminate_subqueries.eliminate_subqueries 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":"sqlglot/optimizer/eliminate_subqueries.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e3e0daec33b8dd2348946fe5eb504d41ec919138b0b80a7f440ca39a3f9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"pushdown_predicates.nodes_for_predicate (cyclomatic 20): pushdown_predicates.nodes_for_predicate 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":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"138b0e938cb8725b75670743e063ea15c96b0cdfc3ad7b064dffa84c644458cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver.get_table (cyclomatic 20): Resolver.get_table 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":"sqlglot/optimizer/resolver.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e1faf1e035c7d0994c171f31579b1421a8f68c2014953c6a67a63af5c91316"}},{"ruleId":"D1","level":"warning","message":{"text":"scope._traverse_scope (cyclomatic 20): scope._traverse_scope 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":"sqlglot/optimizer/scope.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"04776b7d960cda5fdc764f51845b4777ec7b1b05f29af7e40c2c21e42b5b5d86"}},{"ruleId":"D1","level":"warning","message":{"text":"scope.walk_in_scope (cyclomatic 20): scope.walk_in_scope has cyclomatic complexity 20 (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":"sqlglot/optimizer/scope.py"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87c926a4ff4dc7a208e5c9835ee027de8aaef6e378f148ae4976ca87a35cc3f"}},{"ruleId":"D1","level":"warning","message":{"text":"anonymize.anonymize (cyclomatic 19): anonymize.anonymize 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":"sqlglot/anonymize.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7be76eef3d82caeda327fbc8dbc00058e32129921bf2c79a46ed5c27fb82af"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.datatype_sql (cyclomatic 19): Generator.datatype_sql 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":"sqlglot/generator.py"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"295efae8700dcc57fcccdab262ecf4432353d605f88b658ba729fa3577fc5325"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator._pivot_in_value_aliases (cyclomatic 19): Generator._pivot_in_value_aliases 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":"sqlglot/generator.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed71f9b5255dae7a825315560cf056ef6f0aea8fab15db545ebcc4f2d04706fd"}},{"ruleId":"D1","level":"warning","message":{"text":"qualify_columns.qualify_outputs (cyclomatic 19): qualify_columns.qualify_outputs 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a20eeb2795e0542b7ac6fa81de37519d84f4272b59a661749661c57e86e64e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_range (cyclomatic 19): Parser._parse_range 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":"sqlglot/parser.py"},"region":{"startLine":6405}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a3fc4ecbc88947b857c299ab6addcca48059b517fba4137297eef1b9c24655"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerCore._scan_comment (cyclomatic 19): TokenizerCore._scan_comment 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"f212c6240ccc9a181cab15f088a5adbb28f6d7f9fd5303cb3feb19142f65b11c"}},{"ruleId":"D1","level":"warning","message":{"text":"transforms.unnest_to_explode (cyclomatic 19): transforms.unnest_to_explode 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":"sqlglot/transforms.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d51245ced705f33462c0e30a797e4df1f32481cc01ecf4752c68e6601a0a07"}},{"ruleId":"D1","level":"warning","message":{"text":"dialect.no_filter_sql (cyclomatic 18): dialect.no_filter_sql 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc0047e8457782edde94f1ccea71fde38275f8d6cc0d1e37a094516b76e8d67"}},{"ruleId":"D1","level":"warning","message":{"text":"core.convert (cyclomatic 18): core.convert 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":"sqlglot/expressions/core.py"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8c312278de79ffbd931694cbc4727ef64ea12083f2835d59f30526308060d6"}},{"ruleId":"D1","level":"warning","message":{"text":"core._to_s (cyclomatic 18): core._to_s 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":"sqlglot/expressions/core.py"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeb63c0fa60fc16c9e2f157043715f1d8c698cc7f1db91c39ab7cf55491582b"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.insert_sql (cyclomatic 18): Generator.insert_sql 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":"sqlglot/generator.py"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182ca3a829624896aa11828471c08eb16ec8c7bcf4a38b1cc49f6824968f9b7"}},{"ruleId":"D1","level":"warning","message":{"text":"bigquery._array_agg_fold_sql (cyclomatic 18): bigquery._array_agg_fold_sql 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":"sqlglot/generators/bigquery.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"618a6aae23bc9d669d4e4283332d0ff03e391cb0d7577bd36e216c840362d420"}},{"ruleId":"D1","level":"warning","message":{"text":"exasol._qualify_unscoped_star (cyclomatic 18): exasol._qualify_unscoped_star 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":"sqlglot/generators/exasol.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66ab61d4f5723cddd90cf129d711eb23bad619097e29ccd7ac617cd3040ec44"}},{"ruleId":"D1","level":"warning","message":{"text":"Simplifier.simplify_datetrunc (cyclomatic 18): Simplifier.simplify_datetrunc 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00bd50a9139a1e4e0eb62f1b7f3dfd1f195025072e53248ac3c9b8a4233fac1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_drop (cyclomatic 18): Parser._parse_drop 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":"sqlglot/parser.py"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1506d50a7bd34dd7b2eaa4ef66601528801d41e52c135e47ec95ecc4ea747d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_query_modifiers (cyclomatic 18): Parser._parse_query_modifiers 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":"sqlglot/parser.py"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cce238a2b2118b5317ba2f8002780ff13208bda8b7263471d7dbcfed0bd5a58"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_table_parts_fast (cyclomatic 18): Parser._parse_table_parts_fast 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":"sqlglot/parser.py"},"region":{"startLine":5078}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2160d53812c4275e16b88ccf8d3f45b2d26332775297c2b1ca2b1f49b79e831"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_set_operations (cyclomatic 18): Parser._parse_set_operations 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":"sqlglot/parser.py"},"region":{"startLine":6237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7735b85f4a9e07e5adfcb33aae31b746d22cef43ab8637e1f6bdb53fec32f1b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_column_parts_fast (cyclomatic 18): Parser._parse_column_parts_fast 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":"sqlglot/parser.py"},"region":{"startLine":7230}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb6fa35ede117e301445f5ba08e383813768374c6fb5d919ce6383e627e91c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeDistiller._generate_edit_script (cyclomatic 17): ChangeDistiller._generate_edit_script 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":"sqlglot/diff.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58632a2d3e934483f7bacedecc1f3c70f178495507aa034ee5ce82f2836c192"}},{"ruleId":"D1","level":"warning","message":{"text":"env.cast (cyclomatic 17): env.cast 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":"sqlglot/executor/env.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d16c89e259b5ed6d0bf32fd4c6c9cf38ec07898f4829644bd924705b68765c"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonExecutor.set_operation (cyclomatic 17): PythonExecutor.set_operation 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":"sqlglot/executor/python.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f36fab1c161b56d0355393c258a4fee10d5582cfe8089ad0d079a6bb41c19d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.values_sql (cyclomatic 17): Generator.values_sql 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":"sqlglot/generator.py"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c302534caa13e87dc1041b3ec2c9cc725d7fec5918d7cac4575ac523741f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.window_sql (cyclomatic 17): Generator.window_sql 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":"sqlglot/generator.py"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"830d22de52a17369eb57a82988506a938eea43f7ed25017db4945fe11bd8d31d"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.interval_sql (cyclomatic 17): Generator.interval_sql 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":"sqlglot/generator.py"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b583e278318786f9295827a70da0bdd94bb9988342233b4a3e2f26d14b617d0"}},{"ruleId":"D1","level":"warning","message":{"text":"MySQLGenerator.show_sql (cyclomatic 17): MySQLGenerator.show_sql has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/mysql.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a787a37b12d556bc34a4a37a2d64b730ce8a9d9cd1cec1accd70b41f905cd9"}},{"ruleId":"D1","level":"warning","message":{"text":"TSQLGenerator.set_operations (cyclomatic 17): TSQLGenerator.set_operations 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":"sqlglot/generators/tsql.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f83b1fdb8ab177bca72ee188e2ab893a534437c8d90764e9f29c9330ff567b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_insert (cyclomatic 17): Parser._parse_insert 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":"sqlglot/parser.py"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6074f72b6582c116be7b09f5a5b626a75f8542f58cb37671c09ddf59478e8000"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_table_sample (cyclomatic 17): Parser._parse_table_sample has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":5494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f15f2391f34001ddf8c8d16512ecb58d415dc4f32871e5a310915d1c3044d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_colon_as_variant_extract (cyclomatic 17): Parser._parse_colon_as_variant_extract 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":"sqlglot/parser.py"},"region":{"startLine":7337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb563cfd57ea085f8a0a09e47d3fbe30033a4045181d1f6e4f4c177cc06248e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_cast (cyclomatic 17): Parser._parse_cast 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":"sqlglot/parser.py"},"region":{"startLine":8561}}}],"partialFingerprints":{"codehealthFindingId/v1":"29996b37d6bdeaec6cd390b4aac062e81febdc0dc970943e29bcde29bf03cf49"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_analyze (cyclomatic 17): Parser._parse_analyze has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":9825}}}],"partialFingerprints":{"codehealthFindingId/v1":"323d4c350bde3f3d846cb5a3e20b0b4e52ee0e1eb36eac3b9cd5cf6d36d8d5f6"}},{"ruleId":"D1","level":"warning","message":{"text":"BigQueryParser._parse_table_parts (cyclomatic 17): BigQueryParser._parse_table_parts 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":"sqlglot/parsers/bigquery.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fbad079e08b512da93f0ea2a6755fbe6a6208e31d58ea281dd38badfa3580f"}},{"ruleId":"D1","level":"warning","message":{"text":"serde.dump (cyclomatic 17): serde.dump 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":"sqlglot/serde.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcff07c82cf4c0122448aa312d459b46d6a25068ac09145b577abfe8173281fd"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerCore._scan_keywords (cyclomatic 17): TokenizerCore._scan_keywords 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"842c1993f24aba1ffcd87804f163209056fb4746470fa86deb70f3f3eded46fc"}},{"ruleId":"D1","level":"warning","message":{"text":"transforms.eliminate_qualify (cyclomatic 17): transforms.eliminate_qualify 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":"sqlglot/transforms.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"208283e60db766e04ee4dc25ed9d9200be931683a77b16877856e8d572a7d681"}},{"ruleId":"D1","level":"warning","message":{"text":"dialect.build_trunc (cyclomatic 16): dialect.build_trunc 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bf2959e2d9078f6ac27ef632ec53a747d470c2f6f08d1565dc033bb790b30d"}},{"ruleId":"D1","level":"warning","message":{"text":"Pivot.output_columns (cyclomatic 16): Pivot.output_columns 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":"sqlglot/expressions/query.py"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dee4857ac283f606e00655d0acddccc8fc56850e3127737dca71c0e4f3349d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator.drop_sql (cyclomatic 16): Generator.drop_sql 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":"sqlglot/generator.py"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae7bc75602c12826608a4140d8090d96424b6fc7c454391f61f2a40ecdcb9dd"}},{"ruleId":"D1","level":"warning","message":{"text":"DuckDBGenerator.regexpreplace_sql (cyclomatic 16): DuckDBGenerator.regexpreplace_sql 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c3adce01c287a3828eb7a322321cd30e5a861a49202af6d8a0763e1c54c5f5"}},{"ruleId":"D1","level":"warning","message":{"text":"simplify.simplify_parens (cyclomatic 16): simplify.simplify_parens 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b697dbfb1ac628c0ec4020da9a427dea477e9c6e55e85dbd3343b205272b41"}},{"ruleId":"D1","level":"warning","message":{"text":"simplify.datetime_floor (cyclomatic 16): simplify.datetime_floor 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3054088079740540f0a269f622bcb516a85f1056fb2533f6c8e699c62553262"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser._parse_type (cyclomatic 16): Parser._parse_type 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: Parser._parse_alter_table_set (cyclomatic 17) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":6771}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eedd88bf6743abfeb823a176eb6de3a532cac19c41bb6dfc532f002fb1ec0d"}},{"ruleId":"D1","level":"warning","message":{"text":"TeradataParser._parse_column_ops (cyclomatic 16): TeradataParser._parse_column_ops 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":"sqlglot/parsers/teradata.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc613af24593901498967c606d4a60f18943bb5bbf7eb469060f201bced7c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerCore._scan_string (cyclomatic 16): TokenizerCore._scan_string 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebbf73587e4bbdfd3c5113eec9b223678c1234309d3d305e08689781ad39165"}},{"ruleId":"D2","level":"warning","message":{"text":"canonicalize_internal_names.canonicalize_internal_names (cognitive 237): canonicalize_internal_names.canonicalize_internal_names has cognitive complexity 237 (threshold 15). Drivers by points: if/else 47 (162 pts), loops 17 (47 pts), boolean chains 16, ternaries 3 (12 pts) (nesting depth added 154). 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":"sqlglot/optimizer/canonicalize_internal_names.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc09b5678d40f0c2b25b47d4abc743f674c57550d567191f24c72c72a023c6b4"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._expand_stars (cognitive 171): qualify_columns._expand_stars has cognitive complexity 171 (threshold 15). Drivers by points: if/else 34 (107 pts), boolean chains 23, loops 7 (21 pts), ternaries 6 (20 pts) (nesting depth added 101). 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c665e9e2bdf9ea3e31c220d70f104ced3c803aaeb4b626cea591a1a43ce531"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier._simplify_comparison (cognitive 164): Simplifier._simplify_comparison has cognitive complexity 164 (threshold 15). Drivers by points: if/else 21 (84 pts), ternaries 10 (58 pts), boolean chains 16, error handling 1 (3 pts), loops 1 (3 pts) (nesting depth added 115). 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"542ceaca6151b18e10c006f3f5d3d8252bfc289740031d9a4a04142645ee9bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"pushdown_projections.projection_reachability (cognitive 156): pushdown_projections.projection_reachability has cognitive complexity 156 (threshold 15). Drivers by points: if/else 30 (72 pts), loops 19 (43 pts), ternaries 8 (24 pts), boolean chains 17 (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/pushdown_projections.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb7a5dbdb8838ff4bf7e0e71c63354c1593a8009e17309c5413ab6f0fa944a3"}},{"ruleId":"D2","level":"warning","message":{"text":"unnest_subqueries.decorrelate (cognitive 149): unnest_subqueries.decorrelate has cognitive complexity 149 (threshold 15). Drivers by points: if/else 55 (91 pts), boolean chains 29, ternaries 10 (19 pts), loops 7 (10 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf1541023a08d53831879059daa20f057be706d3462aec86bea2763267514c7"}},{"ruleId":"D2","level":"warning","message":{"text":"lineage.to_node (cognitive 140): lineage.to_node has cognitive complexity 140 (threshold 15). Drivers by points: if/else 42 (81 pts), ternaries 8 (23 pts), boolean chains 20, loops 8 (16 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":"sqlglot/lineage.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a589a51e9bb8db94e360e5c7c745dbf90d8eeb26ddd8cbc663ef8c246c86d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_create (cognitive 131): Parser._parse_create has cognitive complexity 131 (threshold 15). Drivers by points: if/else 41 (89 pts), boolean chains 16, loops 3 (13 pts), ternaries 5 (13 pts) (nesting depth added 66). 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":"sqlglot/parser.py"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44ce2087e306169b593c958a534753200c4f015ebcaa074f47f51c6729976c1"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_tables.qualify_tables (cognitive 128): qualify_tables.qualify_tables has cognitive complexity 128 (threshold 15). Drivers by points: if/else 25 (83 pts), boolean chains 21, loops 9 (19 pts), ternaries 1 (5 pts) (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_tables.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fac4d8d83ff0491df2a12c6284f29069ffaf7fc3c60d3e35d37bb33f215456"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_types (cognitive 125): Parser._parse_types has cognitive complexity 125 (threshold 15). Drivers by points: if/else 48 (92 pts), boolean chains 21, ternaries 2 (6 pts), error handling 1 (4 pts), loops 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":6854}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07b2257f2f09776e92f63e2831befc8eed3f04c84b6aea4360aa47428462faf"}},{"ruleId":"D2","level":"warning","message":{"text":"Step.from_expression (cognitive 96): Step.from_expression has cognitive complexity 96 (threshold 15). Drivers by points: if/else 29 (62 pts), loops 9 (23 pts), boolean chains 9, ternaries 1 (2 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/planner.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05dc0baaafff06245464b9bb79df21719dec0d535d7a3523c7602107bd86dad"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._expand_using (cognitive 93): qualify_columns._expand_using has cognitive complexity 93 (threshold 15). Drivers by points: if/else 29 (76 pts), boolean chains 11, loops 4 (6 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"be94cc6e38d58e3e1e25019720aef94074f00f415562bce64c2fccb89fc1654f"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._convert_columns_to_dots (cognitive 92): qualify_columns._convert_columns_to_dots has cognitive complexity 92 (threshold 15). Drivers by points: if/else 17 (56 pts), ternaries 4 (15 pts), boolean chains 14, loops 3 (7 pts) (nesting depth added 54). 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d72473405c0f13463e23bf91b2c07f7acf07cbdfedbcc3ca3e4bfa705b18ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression.__hash__ (cognitive 87): Expression.__hash__ has cognitive complexity 87 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 7 (26 pts), ternaries 3 (20 pts), boolean chains 3 (nesting depth added 64). 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":"sqlglot/expressions/core.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f54cf951296d089ef1d32df13dbcd1b56cb219bc240e9d64a18c6c2055f7af6"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._extract_string (cognitive 83): TokenizerCore._extract_string has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (55 pts), boolean chains 16, ternaries 4 (11 pts), loops 1 (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":"sqlglot/tokenizer_core.py"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658d56e19c821889581c130ebf3c24e480ab0d0c730635bca141af7fe1829b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.get_source_columns (cognitive 75): Resolver.get_source_columns has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (57 pts), boolean chains 14, ternaries 1 (4 pts) (nesting depth added 41). 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":"sqlglot/optimizer/resolver.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc5766308ed022c9852dc52cced896e6f845356fd9d4524bb36c87127c3afc"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier._simplify_binary (cognitive 74): Simplifier._simplify_binary has cognitive complexity 74 (threshold 15). Drivers by points: if/else 22 (46 pts), ternaries 5 (17 pts), boolean chains 11 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"522b2818fc5ed9897fbf691a7f5b73748322afa43f1d731bda7ba4a4b0fde55b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_select_query (cognitive 73): Parser._parse_select_query has cognitive complexity 73 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 16, ternaries 7 (13 pts), loops 3 (6 pts) (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":"sqlglot/parser.py"},"region":{"startLine":4167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bd0bd25f3480095904bd85eaf00803cecb700790797a4f81be9fe4aa9cf477"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator.annotate_expression (cognitive 72): TypeAnnotator.annotate_expression has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (42 pts), boolean chains 13, loops 4 (13 pts), ternaries 1 (4 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9edb26763bad6f00b51ff24bc5ab9054e91b9d3efcf9cb234c6c7b089603a3"}},{"ruleId":"D2","level":"warning","message":{"text":"pushdown_projections.prune_projections (cognitive 72): pushdown_projections.prune_projections has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (54 pts), loops 3 (7 pts), boolean chains 6, ternaries 1 (5 pts) (nesting depth added 46). 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":"sqlglot/optimizer/pushdown_projections.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43bb1609f81d11a73e61858728dbe1acc88153762da4b14bc696b8e182dd538"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._expand_order_by_and_distinct_on (cognitive 72): qualify_columns._expand_order_by_and_distinct_on has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (50 pts), loops 5 (13 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 47). 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca6190bd2a7c4fded373cb322c508fdab94a0d1673b679a1a919a29c0a7b210"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._qualify_columns (cognitive 70): qualify_columns._qualify_columns has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 10, ternaries 4 (9 pts), loops 4 (8 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb0e0ee578a8d3f4baf0d0c96e8bfad740ad823d775a6ade841ee5c4e8033a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_table (cognitive 70): Parser._parse_table has cognitive complexity 70 (threshold 15). Drivers by points: if/else 30 (47 pts), boolean chains 13, loops 3 (7 pts), ternaries 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":5215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4ce4dc07ac4dff951bf036275c2fe8d3d0543b0f4179f5b1a1f5a6a5c21b95"}},{"ruleId":"D2","level":"warning","message":{"text":"pushdown_predicates.pushdown_predicates (cognitive 64): pushdown_predicates.pushdown_predicates has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (45 pts), loops 3 (9 pts), ternaries 1 (6 pts), boolean chains 4 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"221d7f0f6fcf91a7e50a0cf2b166dd4e06ed809f41cadd9c03911f74e0a141c6"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._expand_alias_refs (cognitive 60): qualify_columns._expand_alias_refs has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 7 (15 pts), boolean chains 10 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a009ccce09906da9552a0bf27a9ed7367673357be645b9e135bf48a86028d03a"}},{"ruleId":"D2","level":"warning","message":{"text":"snowflake._qualify_unnested_columns (cognitive 59): snowflake._qualify_unnested_columns has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 4 (11 pts), boolean chains 5 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/snowflake.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4382322d8e2ed7dd96afa7cc775f488079293003da82eac090889c11ec54a558"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_query_modifiers (cognitive 56): Parser._parse_query_modifiers has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (48 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 39). 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":"sqlglot/parser.py"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6306d294d15809336fe668b2491a6d7117e75f46a9c120380593711559d3de9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.ordered_sql (cognitive 54): Generator.ordered_sql has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 16, ternaries 5 (13 pts) (nesting depth added 23). 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":"sqlglot/generator.py"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"14404879d4f3b806d8cb51ea7b753abeb28a7d40ee900fd9f6f02c90985d4596"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._annotate_by_args (cognitive 53): TypeAnnotator._annotate_by_args has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 10, ternaries 4 (10 pts), loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"43844b1f8eefcc3307204fc5a3378c7509e9437585484966a33daffec400f50b"}},{"ruleId":"D2","level":"warning","message":{"text":"transforms.unnest_to_explode (cognitive 53): transforms.unnest_to_explode has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (26 pts), ternaries 5 (18 pts), loops 2 (6 pts), boolean chains 3 (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":"sqlglot/transforms.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"171b388221c95de72c03303cd5a3cdb96f12a237a14d4a5b504105eedbc4ba9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.absorb_and_eliminate (cognitive 52): Simplifier.absorb_and_eliminate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 4 (14 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0e9b5a366d34a3efb97683b55b8a0ad65721a810d260249f7e02cc34b7aedc"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_function_call (cognitive 52): Parser._parse_function_call has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 8, error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":7603}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de2f5857add4e1ee9672f86b121b742690e6a179b434fe1e8e8779d114c23ec"}},{"ruleId":"D2","level":"warning","message":{"text":"transforms.eliminate_join_marks (cognitive 52): transforms.eliminate_join_marks has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 7 (18 pts), ternaries 2 (7 pts), boolean chains 2 (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":"sqlglot/transforms.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"33832156ca49124fb2a08f2a118f963ab5e5be75f142086380b922414a75effa"}},{"ruleId":"D2","level":"warning","message":{"text":"unnest_subqueries.unnest (cognitive 50): unnest_subqueries.unnest has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 18, ternaries 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":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27f452ca0dc4b405d1a4a515e7446c8700ffb925e41bb32ebc60653ecf22ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._scan_numeric_escape (cognitive 47): TokenizerCore._scan_numeric_escape has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 9, ternaries 4 (9 pts), error handling 1 (3 pts), loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/tokenizer_core.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39dc481e5b66eb95cff9af0578f3376f1a57f29a0db1a053190e7ede1d8bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_subqueries._merge_expressions (cognitive 46): merge_subqueries._merge_expressions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 5 (9 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c63bf2fa7fb71c56fbc1d450869c4fc1e7f91e4c02e13c586fe66ef0821a234"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.simplify (cognitive 46): Simplifier.simplify has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c659164c4085175f079ed2f9049e203c1c03ac3f5bd1cd123d9aae13cbcfdcc"}},{"ruleId":"D2","level":"warning","message":{"text":"eliminate_ctes.eliminate_ctes (cognitive 45): eliminate_ctes.eliminate_ctes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (35 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 32). 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":"sqlglot/optimizer/eliminate_ctes.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f812324feafa83b3f407fa4a1cdb752939bfe2d182df832f96a868f078610cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.set_operations (cognitive 44): Generator.set_operations has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (13 pts), boolean chains 7 (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":"sqlglot/generator.py"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e60b22a3b7b4001cb19b06d514474341039dc4a24a2082858ca8a2110aa013"}},{"ruleId":"D2","level":"warning","message":{"text":"optimize_joins.optimize_joins (cognitive 42): optimize_joins.optimize_joins has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 6 (17 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/optimize_joins.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8e8423a55ee80c0392123dcf0899e6a64743a199dd4e5abe54b9c15c0a281b"}},{"ruleId":"D2","level":"warning","message":{"text":"bigquery._annotate_array (cognitive 42): bigquery._annotate_array has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (29 pts), boolean chains 9, ternaries 2 (4 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":"sqlglot/typing/bigquery.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a110fdcbf03c3e5d5973f81e59d487e2f7663ee52e5caea42cea4fe80f1a45"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._get_source_scope_selects (cognitive 41): TypeAnnotator._get_source_scope_selects has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (9 pts), boolean chains 6, ternaries 1 (2 pts) (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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bdc845258c4cb3c8dc528b18305b5ccfe93e9ce53af1b5c765759901bcff7c"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_subqueries._mergeable (cognitive 41): merge_subqueries._mergeable has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 10, loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd220748a61bc8077badc5a11391e5ea549d538ee1815cedfd8682579166e611"}},{"ruleId":"D2","level":"warning","message":{"text":"serde.dump (cognitive 41): serde.dump has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (11 pts), boolean chains 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":"sqlglot/serde.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee166c1078ddacbd8713157eb2bd78ac733d3cf6f9d0bbd467828d4fff4a51"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.expressions (cognitive 40): Generator.expressions has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 11 (17 pts), boolean chains 3, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":5090}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bbbd75819e91398389258ebbe64cfebf0300f074ea1cf6e9e69561ff4ffc8e"}},{"ruleId":"D2","level":"warning","message":{"text":"scope._traverse_tables (cognitive 40): scope._traverse_tables has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 6, loops 3 (4 pts) (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":"sqlglot/optimizer/scope.py"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"f903464357240bf0ef9d4a6e59e693b79663070f48facece479f399357ae5936"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.walk_in_scope (cognitive 40): scope.walk_in_scope has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 5 (16 pts), boolean chains 7 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/scope.py"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c06e32d7bc732b1499a669c6636dcd80974b6dbdb9f75af280d17f1238fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_pivot (cognitive 40): Parser._parse_pivot has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 4 (8 pts), boolean chains 3 (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":"sqlglot/parser.py"},"region":{"startLine":5651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead899f72d0703f80eb0c536c88e3f67423fc89a3ef74623452c58bd7d595c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._scan_number (cognitive 40): TokenizerCore._scan_number has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 12, loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/tokenizer_core.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"68772487d9f62746dc29b9668357227ab2aa14f56212cb24248c7f66f2a0dcff"}},{"ruleId":"D2","level":"warning","message":{"text":"transforms.eliminate_qualify (cognitive 40): transforms.eliminate_qualify has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (9 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/transforms.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9f5fbddfe4fc42b0fed5ca78a1fd64d1d6452553617bfa7b3faa73878c7ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_join (cognitive 39): Parser._parse_join has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 15, ternaries 3 (5 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":4863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c845b9c813ed02c19d2b0eef73864bb7529804df40f87421f667b761a2fdc0"}},{"ruleId":"D2","level":"warning","message":{"text":"pushdown_predicates.nodes_for_predicate (cognitive 38): pushdown_predicates.nodes_for_predicate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 8, ternaries 1 (4 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ac27ad73189fe67c9fbc782daff0a9d4eb2aef4509e76c8a0fd453d8f60fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeDistiller._compute_matching_set (cognitive 37): ChangeDistiller._compute_matching_set has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/diff.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"58105f9d642b584033b11286cc42ba4f661276282dea751e36399d5a9b64fdce"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._expand_positional_references (cognitive 36): qualify_columns._expand_positional_references has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (29 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c218c72f7d321c65f125d651afa50773809f55577d94962f4e7444f73b487cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_colon_as_variant_extract (cognitive 36): Parser._parse_colon_as_variant_extract has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":7337}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7417aca5951cdc95fd0a38271cf075adc827ea7570ca590bb75dfa717d6b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_alter (cognitive 36): Parser._parse_alter has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 9, ternaries 4 (7 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":"sqlglot/parser.py"},"region":{"startLine":9739}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b8175f529ad0837c12c094adcaf30df3d34152b032a19edd5d985290896d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect.merge_without_target_sql (cognitive 35): dialect.merge_without_target_sql has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (10 pts), boolean chains 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/dialects/dialect.py"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"049921c62c72b3e2803fbd240cf1ed8423dcb7667cb2563574f9ce663292a9f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.create_sql (cognitive 35): Generator.create_sql has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 11 (13 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ea64b884e780399cc3d37baa1675164ca44c4ba6833442e0893ebc94e8b5db"}},{"ruleId":"D2","level":"warning","message":{"text":"eliminate_joins.join_condition (cognitive 34): eliminate_joins.join_condition has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (10 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/eliminate_joins.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"39123e9279317489807a7f44b5098a0d41bf1507e9d2593072dbc51a9458a667"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._scan_keywords (cognitive 34): TokenizerCore._scan_keywords has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, loops 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c91142e434c0eb7944bc8b540f496b8d0435f26acef52ee7e6e18548335a31"}},{"ruleId":"D2","level":"warning","message":{"text":"eliminate_subqueries.eliminate_subqueries (cognitive 33): eliminate_subqueries.eliminate_subqueries has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 7 (10 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/eliminate_subqueries.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab16c300573c1d7fde41e54f0be4a306953949898ae59798f00207a5b1f3323a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_match_recognize (cognitive 33): Parser._parse_match_recognize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 3 (5 pts), boolean chains 2, loops 1 (2 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":"sqlglot/parser.py"},"region":{"startLine":4687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7bc7c625701849a6b060610950f5d7979572d3c7e765616d683532d4e61a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"anonymize.anonymize (cognitive 32): anonymize.anonymize has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 2 (5 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 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":"sqlglot/anonymize.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7cd116d1de1d58a856a562b5ee631ced3dd6165c0c6890837d5ed6f9367d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression.__deepcopy__ (cognitive 32): Expression.__deepcopy__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (10 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":"sqlglot/expressions/core.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"a704d451c6da3cb4f9e231a96b76f49b6324af8831bad295ed1ad4494d0b2889"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.join_sql (cognitive 32): Generator.join_sql has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 7 (9 pts), boolean chains 7 (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":"sqlglot/generator.py"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"781e856c75ab1eef2fbcebe8b8e3f81a0c95f0e216c5d78febc30d58a4954c03"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns.qualify_outputs (cognitive 32): qualify_columns.qualify_outputs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b64c6d74eedf438c9c28f3424f3e9bae501ac28ebfda9c610f7695c8c1d10b"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.simplify_datetrunc (cognitive 32): Simplifier.simplify_datetrunc has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 3, loops 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"396080cf4714886aae1743e185e185bb1b875e6b6bc7c2be1e6b253a1296a511"}},{"ruleId":"D2","level":"warning","message":{"text":"MySQLParser._parse_show_mysql (cognitive 32): MySQLParser._parse_show_mysql has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 13 (17 pts), if/else 11 (14 pts), boolean chains 1 (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":"sqlglot/parsers/mysql.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cf5ee4d9d544c1a1e6c50090addd8a76055b23d1cf1b4bd6cae0fcd18c67ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.select_sql (cognitive 31): Generator.select_sql has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 5 (8 pts), boolean chains 6 (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":"sqlglot/generator.py"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0996185cbafe92e3e0d0c28d5a41fad1c317d0e435a6a9a5d0348ee205dd3f04"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.alter_sql (cognitive 31): Generator.alter_sql has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 9, boolean chains 7, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"19726a708df0eb6a9e0d6a72e5d7366dd4b9af3037b3914034483f3cb3682779"}},{"ruleId":"D2","level":"warning","message":{"text":"pushdown_predicates.pushdown_dnf (cognitive 31): pushdown_predicates.pushdown_dnf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (4 pts), ternaries 1 (3 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":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514fe757b675a5d624e32d737934958b7b5779857c2c430f564e8d4316da391"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_column_ops (cognitive 31): Parser._parse_column_ops has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 8, loops 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":"sqlglot/parser.py"},"region":{"startLine":7397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6e1fa52ef4ab64777b7499e0fd8040145121773c9bb0fce93359947b136312"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._scan_comment (cognitive 31): TokenizerCore._scan_comment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483d65b696b6dcefd1af8daf79b0a91a1781a82f8d58e69fde00c115dd4ff8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.when_sql (cognitive 30): Generator.when_sql has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 6 (8 pts), boolean chains 4 (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":"sqlglot/generator.py"},"region":{"startLine":5190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32ae2beb57cd2b14170e0df5c00a8c533180ab2001c7a57fcb9a556f18b5f60"}},{"ruleId":"D2","level":"warning","message":{"text":"snowflake._unnest_generate_date_array (cognitive 30): snowflake._unnest_generate_date_array has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (9 pts), loops 1 (4 pts), boolean chains 2 (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":"sqlglot/generators/snowflake.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae58fba0598007f78d4b0b1d7c9c044f5dc1d5f9ec454a24e98509e80bac139"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver._get_column_type_from_scope (cognitive 30): Resolver._get_column_type_from_scope has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (6 pts), boolean chains 3 (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":"sqlglot/optimizer/resolver.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f29d16b901457936047081d66b8c2f08264a9b4906acd44004073d344effaf"}},{"ruleId":"D2","level":"warning","message":{"text":"scope._traverse_scope (cognitive 30): scope._traverse_scope has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/scope.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fc12e3cd67f0ddcff83e200d60a0f1837d94b1583caffd17d129fafae51da7"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_set_operations (cognitive 30): Parser._parse_set_operations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (7 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":6237}}}],"partialFingerprints":{"codehealthFindingId/v1":"625b7e73f3845d8bfd04014387227ed35d380d9c6aee348437b3fa3d17c6bc4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_interval_span (cognitive 30): Parser._parse_interval_span has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 13, if/else 9 (13 pts), error handling 1 (2 pts), ternaries 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":"sqlglot/parser.py"},"region":{"startLine":6550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55ff72d27740a65df200ce75c3bced8b0e73ad8fc779a578fffd795623b6e03"}},{"ruleId":"D2","level":"warning","message":{"text":"lineage._pivot_column_mapping (cognitive 29): lineage._pivot_column_mapping has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 4 (9 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/lineage.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc244624721339a67d63828f11dd358102964c1e41679547ff731eb7e67f82c2"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._qualify_positional_column (cognitive 29): qualify_columns._qualify_positional_column has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6, ternaries 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5503c4254b817b4c3154ca8b0db7de15d2bb2ddc61a82b129d4606768e8bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.simplify_not (cognitive 29): Simplifier.simplify_not has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (28 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74b3e02bab2e628114862a6d10b886093563f86c7b1bddcce815004d9a7b815"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeDistiller._generate_edit_script (cognitive 28): ChangeDistiller._generate_edit_script has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, loops 3 (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":"sqlglot/diff.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ad4dfec7bd4d5d5b591c08b7ca7291ed588bedbf4c9d51640ba4c8dde6eb76"}},{"ruleId":"D2","level":"warning","message":{"text":"Pivot.output_columns (cognitive 28): Pivot.output_columns has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (5 pts), ternaries 3 (5 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":"sqlglot/expressions/query.py"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"df620d461d28a8a97f8affb3ae4414dfdce0ae09f3a8b1520fb2640dafc956e3"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns.validate_qualify_columns (cognitive 28): qualify_columns.validate_qualify_columns has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, ternaries 1 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9024a82b01b2c4363048bf6361e8acf6a4e483fc5d3db62e3cfab4d8a5077234"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope._collect (cognitive 28): Scope._collect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 9, loops 1, ternaries 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":"sqlglot/optimizer/scope.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5a12a1775e1b030bf6be80f6cdd2f5ea6f59474f569ffc21bb81b6a35f2ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_range (cognitive 28): Parser._parse_range has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, 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":"sqlglot/parser.py"},"region":{"startLine":6405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc056a3b585b8c804a57bd5bd8a6184164e31c065f7a485daa9520d23f8747"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.projection_has_aggregate (cognitive 27): helpers.projection_has_aggregate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 pts), boolean chains 3 (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":"sqlglot/optimizer/helpers.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41b1290c1e235bf0b270f4f2acc358e45d007497fc252ea3147d9a71714ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.simplify_conditionals (cognitive 27): Simplifier.simplify_conditionals has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcd702ca83b4614dcfff31cb14a27c4ae3f177fca8e04677bf56a13df8a55e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_window (cognitive 27): Parser._parse_window has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 4 (6 pts), boolean chains 5 (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":"sqlglot/parser.py"},"region":{"startLine":9071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c785d8ed1d1251aa317f6bda400c53f5d74e52758f189ac5b07caf0cd68b01d0"}},{"ruleId":"D2","level":"warning","message":{"text":"BigQueryParser._parse_table_parts (cognitive 27): BigQueryParser._parse_table_parts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/bigquery.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfeb1c3a1637987022718e33b7baeb7c64a0e6f8e3720edb9b9a6c37f2a325e"}},{"ruleId":"D2","level":"warning","message":{"text":"TeradataParser._parse_column_ops (cognitive 27): TeradataParser._parse_column_ops has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/teradata.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6447c33d75ec817b82683872345f85d89b019439f421d14771e3a619950cb85"}},{"ruleId":"D2","level":"warning","message":{"text":"TeradataParser._parse_projections (cognitive 27): TeradataParser._parse_projections has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/teradata.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c4b0ec0a6bb1d4d9a2644936e936859c1042b14076170a931658fc731e51c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.datatype_sql (cognitive 26): Generator.datatype_sql has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (9 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":"sqlglot/generator.py"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0b65df8173c4de383e9f48704b28ffd3e05be51c26c1149035d06e523dce06"}},{"ruleId":"D2","level":"warning","message":{"text":"TSQLGenerator.create_sql (cognitive 26): TSQLGenerator.create_sql has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (8 pts), boolean chains 4 (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":"sqlglot/generators/tsql.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e8f6b8920d48e711cacf2d418c4d4bf68253a2aae2731bd103e0ceefa9ee6a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._get_scope_source_selects (cognitive 26): TypeAnnotator._get_scope_source_selects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (7 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a0be2bc6ebf8951512d21cc7ba62288266248632e93c48633da1db4ccf0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parse_set_operation (cognitive 26): Parser.parse_set_operation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":6152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9dcd0305c3af942ef75de3b7326096c8c26150e65a04a06f12752c651f0236"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_cast (cognitive 26): Parser._parse_cast has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (6 pts), boolean chains 4 (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":"sqlglot/parser.py"},"region":{"startLine":8561}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f472a7a9e75465d87ac07fecfbc75bd9b93c7dec28f88eee59e869f8cc2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"_Dialect._try_load (cognitive 25): _Dialect._try_load has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2, error handling 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a759cf9507938c3f4bfee6b331e863741cf370027169efbedb337e32f7e6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"env.cast (cognitive 25): env.cast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (25 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":"sqlglot/executor/env.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e913e3870eac215cf0013adcb6c5009f370e038a648f8d16efe4b26b630d712"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.table_sql (cognitive 25): Generator.table_sql has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 8 (10 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39a6d48cc05fae65ad5e220c69150e325cead3b96b21d1fceb16dc62b69a674"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.interval_sql (cognitive 25): Generator.interval_sql has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 5 (8 pts), boolean chains 3 (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":"sqlglot/generator.py"},"region":{"startLine":4271}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5ff55bce0e0027e9a4fce6fd24a97d83fa1c0e66c5c9d6e7d4620612f08b65"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckDBGenerator._regexp_extract_sql (cognitive 25): DuckDBGenerator._regexp_extract_sql has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts), ternaries 2 (3 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e87a3a3b3375e96f9c34972fae5be8de0af92e4ecf4fde8a3652075a8d571"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_subqueries._rename_inner_sources (cognitive 25): merge_subqueries._rename_inner_sources has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (10 pts), boolean chains 2, ternaries 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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd4ef7b1138670caeeaf6595d7910cf5518c0c4062594a8ec521c50fe3b9890"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen.gen (cognitive 25): Gen.gen has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdb4fe472a934f2105b4882c53cd2db5422af63e6886393aa71351d10f8b256"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.propagate_constants (cognitive 25): simplify.propagate_constants has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"019bbc1db5a36eb1e3fe906557370ff60c2defbe1ad17aef9ac81066b8628b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_table_parts (cognitive 25): Parser._parse_table_parts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":5144}}}],"partialFingerprints":{"codehealthFindingId/v1":"708d39f4e409e600cbae58d04a6dab599472855241845f8b73d163ca7d79d61d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_column_parts_fast (cognitive 25): Parser._parse_column_parts_fast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":7230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1a33758a5d88e58b2851082ef6d502a17c67abbe7cd019fc49302ed4e9e041"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_when_matched (cognitive 25): Parser._parse_when_matched has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (11 pts), boolean chains 2, 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":"sqlglot/parser.py"},"region":{"startLine":10025}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0e2390f1dff743d6f7533ff23e2f2918fb5f0fcfc95d8485e4593014751621"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect.no_filter_sql (cognitive 24): dialect.no_filter_sql has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c284a4bfad057f51f9920906cf9d778acc9a437496b93b37c0f124a821aa9c9c"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonExecutor.aggregate (cognitive 24): PythonExecutor.aggregate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts), boolean chains 3, ternaries 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":"sqlglot/executor/python.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc5cdc292310ac2180ed6769f9f323d93c6c4dcb72b4f6855f5bb6bcd4c79c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator._pivot_in_value_aliases (cognitive 24): Generator._pivot_in_value_aliases has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (7 pts), boolean chains 6, 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":"sqlglot/generator.py"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f399454c9b61a88ec61c914fb424170bbbf2f8f242659d10c5e5cc0535c482"}},{"ruleId":"D2","level":"warning","message":{"text":"duckdb.connect_by_to_recursive_cte (cognitive 24): duckdb.connect_by_to_recursive_cte has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (5 pts), boolean chains 4, loops 3 (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":"sqlglot/generators/duckdb.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"170be894fff2a6aa2d1b11bac6641fbeae482465d30fa4058cc60478ea43924a"}},{"ruleId":"D2","level":"warning","message":{"text":"exasol._add_local_prefix_for_aliases (cognitive 24): exasol._add_local_prefix_for_aliases has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/exasol.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84bed4250ae82dd7491340ab8e22dfa9f0a5f1e44b26c96ce08abd61fde5bca"}},{"ruleId":"D2","level":"warning","message":{"text":"TSQLGenerator.set_operations (cognitive 24): TSQLGenerator.set_operations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 9, 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":"sqlglot/generators/tsql.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a3a00735cee689d1a35f9174ac4ae86a8642f29391e816e774cd7faf677646"}},{"ruleId":"D2","level":"warning","message":{"text":"pushdown_predicates.pushdown_cnf (cognitive 24): pushdown_predicates.pushdown_cnf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb415f411a946b2cf1b38d021053767b1e8e1555d133a1e1283abf302d36fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver.get_table (cognitive 24): Resolver.get_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, ternaries 3 (5 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/resolver.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"010902c1d472dd28dc5564ddf8f13fd92923f39043840536921cb73a9a68c776"}},{"ruleId":"D2","level":"warning","message":{"text":"scope._traverse_set_operation (cognitive 24): scope._traverse_set_operation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/scope.py"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab51630ba1067067d604f624096f3e2553ca8b4067b16ba04041e2a2acc3572"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_drop (cognitive 24): Parser._parse_drop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 3 (6 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40890a0694a257a179a5b6384d3080c469c9d3d860f7e62e87d2f7f7009fc67"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_limit (cognitive 24): Parser._parse_limit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 4 (8 pts), boolean chains 3 (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":"sqlglot/parser.py"},"region":{"startLine":5998}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d79f8d8fcf736e04a5acb9dcafc8fb8410cd17699f49a1ac3ba883c1da98be5"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonExecutor.set_operation (cognitive 23): PythonExecutor.set_operation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 2 (4 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":"sqlglot/executor/python.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5202d50091921a8809c8cc6a7edb6783743d2ba34285f79571d57e5120fd2145"}},{"ruleId":"D2","level":"warning","message":{"text":"core._to_s (cognitive 23): core._to_s has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, ternaries 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":"sqlglot/expressions/core.py"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f72a9140a720220e3a7c8cde97b709f19bbf29f3adec05227197b1f6462008"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.window_sql (cognitive 23): Generator.window_sql has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 4 (7 pts), boolean chains 4 (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":"sqlglot/generator.py"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb6ec8fb525993444153fcc7ecf8a509fe8eae06b1323d6af11e48df6520712"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite._transform_create (cognitive 23): sqlite._transform_create has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/sqlite.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"599269887b2b11b08b3c3865de26641cd36a3598106ced7bd016eba61e5d4c85"}},{"ruleId":"D2","level":"warning","message":{"text":"canonicalize._coerce_date (cognitive 23): canonicalize._coerce_date has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 1 (3 pts), boolean chains 1, 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":"sqlglot/optimizer/canonicalize.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c0318b72bd5c8e4a1a41c2ddae3728558e28e96053da1f4afe38da96309eec"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier._simplify (cognitive 23): Simplifier._simplify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (4 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"184fcaa2514597b32bf8739fb828123eaf2f1db08ce3fcea5ef6acf9e7fda877"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.uniq_sort (cognitive 23): Simplifier.uniq_sort has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, ternaries 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4d79bc283764d3b986426b96356ec6c638f0af012db76b640c8cbd31abf5fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_table_parts_fast (cognitive 23): Parser._parse_table_parts_fast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 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":"sqlglot/parser.py"},"region":{"startLine":5078}}}],"partialFingerprints":{"codehealthFindingId/v1":"52077abcf0b15331b1327edf165cc18e0b3fc31a84d5c8e753e250036b24a5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_type (cognitive 23): Parser._parse_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4 (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":"sqlglot/parser.py"},"region":{"startLine":6771}}}],"partialFingerprints":{"codehealthFindingId/v1":"80154ad231d33bf921c7a51628a61826e7f4f0139f5911b2ae6b3b8c7affabad"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_column_def (cognitive 23): Parser._parse_column_def has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, ternaries 1 (2 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":"sqlglot/parser.py"},"region":{"startLine":7911}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8f72363c388817f434410cb8c3211c4f778a72c5623f3e61a9eb2e254fdeda"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._replace_lambda (cognitive 23): Parser._replace_lambda has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), ternaries 1 (3 pts), 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":"sqlglot/parser.py"},"region":{"startLine":10294}}}],"partialFingerprints":{"codehealthFindingId/v1":"39df05629446cd38f44035cbc59df545418154ddc419c38005da5abeddbfba8a"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._scan_string (cognitive 23): TokenizerCore._scan_string has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, error handling 1 (2 pts), ternaries 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8d0020d1dfb4191c8122e217029e2a8e0ece368e1436dca4c8bb93f68e4ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"transforms.inherit_struct_field_names (cognitive 23): transforms.inherit_struct_field_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (10 pts), boolean chains 3 (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":"sqlglot/transforms.py"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f71580cf84c4b96b82272bdaba8180983153e65dcb785b00a18a18ee6aadf88"}},{"ruleId":"D2","level":"warning","message":{"text":"_Dialect.__new__ (cognitive 22): _Dialect.__new__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2 (4 pts), ternaries 2 (nesting depth added 4). 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0e90adf7d7dd086b3fe6a6a279fd1123b0b62bb838a310bb33383ee6459923"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.pivot_sql (cognitive 22): Generator.pivot_sql has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 8 (10 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":"sqlglot/generator.py"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad615cdb23a22c4892d7e60abaca53944e237c4beba5dd1104f59b70404cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.values_sql (cognitive 22): Generator.values_sql has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), ternaries 3 (5 pts), loops 2 (3 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":"sqlglot/generator.py"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b9d2978129831e1bd304f1f661225af673524ca57e811777aec516a013de4"}},{"ruleId":"D2","level":"warning","message":{"text":"snowflake._eliminate_dot_variant_lookup (cognitive 22): snowflake._eliminate_dot_variant_lookup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 13). 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":"sqlglot/generators/snowflake.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2853d185922105f2754ba809a487703ff18aa184502fc74d1590f4347c873b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._fixup_order_by_aliases (cognitive 22): TypeAnnotator._fixup_order_by_aliases has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (7 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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f823b29b4a474f0c9a8062d929580303441484036e62097a90f5eba55875305e"}},{"ruleId":"D2","level":"warning","message":{"text":"optimize_joins.normalize (cognitive 22): optimize_joins.normalize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, 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":"sqlglot/optimizer/optimize_joins.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a5c27c8452d8dc4d084e08f4564dbb166f540065859666e019a52b7a5804fc"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._scan (cognitive 22): TokenizerCore._scan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"sqlglot/tokenizer_core.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5966e3adf03824c446e2cef314b6057dcd30a5ae99517e494d672cbcebfb8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression.add_comments (cognitive 21): Expression.add_comments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (6 pts), ternaries 1 (5 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":"sqlglot/expressions/core.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"97093e3b881bd95d4763af8afcdba98f1fd6c8ea88c8b4dbc3e931bb223098d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.insert_sql (cognitive 21): Generator.insert_sql has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 14 (16 pts), if/else 5 (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":"sqlglot/generator.py"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82eb2c0b200ec1396019ae9e9ed00b6335b554ecb7839816dfc67ac3ad61c8"}},{"ruleId":"D2","level":"warning","message":{"text":"bigquery._array_agg_fold_sql (cognitive 21): bigquery._array_agg_fold_sql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, ternaries 2, 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":"sqlglot/generators/bigquery.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e198d25ed968fbb549271f9213ad3be2e6fe346633757cd7865681e6427731c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckDBGenerator.concatws_sql (cognitive 21): DuckDBGenerator.concatws_sql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":4362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c98b8ef68e5aa9adc286b3ae68cb88618ee21d6e1bb9542a32a7cb7adfeb73b"}},{"ruleId":"D2","level":"warning","message":{"text":"TrinoGenerator.concatws_sql (cognitive 21): TrinoGenerator.concatws_sql has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/trino.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"224ef1645bbe5f9f02bfe093b9284872c9a7ee19250ae92cf552fcf4ddfc4ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._get_pivot_column_types (cognitive 21): TypeAnnotator._get_pivot_column_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca402e2fc06ea6dbaff9772076c0efd0988cdfb23899c518e27d4893f1d9d481"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._qualify_comprehensions (cognitive 21): qualify_columns._qualify_comprehensions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea2810f54cd5e4d0343e54c385b281f8ff41423044c79ad7f6aec0921924c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._get_outer_column_table (cognitive 21): qualify_columns._get_outer_column_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (4 pts), boolean chains 3, loops 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"13681dc03fa8e4037780daa9c0bab49278b97bf6ab2e507c6cc03a7e47d2b886"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_insert (cognitive 21): Parser._parse_insert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae5cc7c91dc4d2166c3e1e7e86095f0065fe5b03fce7021b0eb842a9febb1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_with (cognitive 21): Parser._parse_with has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 1, ternaries 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":"sqlglot/parser.py"},"region":{"startLine":4361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1443d38afae679a2d0a6bf1c4f40c7010f0750e46d67c0464a199712c3de2c00"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_alter_table_alter (cognitive 21): Parser._parse_alter_table_alter has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 9, ternaries 1. 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":"sqlglot/parser.py"},"region":{"startLine":9584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc427f717b72f1df3311c07149efd2e41932eea0e43bbfdb6b312f43aa6a8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"core._apply_child_list_builder (cognitive 20): core._apply_child_list_builder has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 2, ternaries 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":"sqlglot/expressions/core.py"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e0d00b1b496e25c2d7406069b4cd0c19415655df9237a27b16e93058b81f42"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabricksGenerator.unnest_sql (cognitive 20): DatabricksGenerator.unnest_sql has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/databricks.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"17297c13097d0f3f1565739d678177466d22b914e207645fdc2b1e7289864dff"}},{"ruleId":"D2","level":"warning","message":{"text":"exasol._qualify_unscoped_star (cognitive 20): exasol._qualify_unscoped_star has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 2 (4 pts), loops 3 (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":"sqlglot/generators/exasol.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1e605aa0fb9e1c75eeb6aaad21c2531552e578bcf07428abb0e6196b124780"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleStoreGenerator.datatype_sql (cognitive 20): SingleStoreGenerator.datatype_sql has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 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":"sqlglot/generators/singlestore.py"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bb135a20b2eb349f112e9fa32318db0e759e351564ab732e880f781b7aaeb5"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize_identifiers.normalize_identifiers (cognitive 20): normalize_identifiers.normalize_identifiers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (5 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":"sqlglot/optimizer/normalize_identifiers.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acfe4162ad7388ab151764223a17d8a013a1cf8851636190712b9c9d5e6c6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.simplify_equality (cognitive 20): Simplifier.simplify_equality has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9460ebbcb1853f09f141450668cca790863f01f7823c9c4ad31a373c91858c76"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_analyze_histogram (cognitive 20): Parser._parse_analyze_histogram has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 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":"sqlglot/parser.py"},"region":{"startLine":9965}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d2a34c2eb7e25cbf1f8cc265fcddbce7df33f22cc1b9ad04e353758f758056"}},{"ruleId":"D2","level":"warning","message":{"text":"transforms.unnest_generate_date_array_using_recursive_cte (cognitive 20): transforms.unnest_generate_date_array_using_recursive_cte has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/transforms.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd2cac4cb15aeb621d9e7684fa87806c112730cc52600bc74cdf9445ad8106f"}},{"ruleId":"D2","level":"warning","message":{"text":"anonymize._number_alias (cognitive 19): anonymize._number_alias has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (7 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/anonymize.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de8c83d2e1ecd729873744254fb2cd965c9c3d42cc1f580c770af34f5bf381"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression.error_messages (cognitive 19): Expression.error_messages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/core.py"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab71750c017c1a2229d5fcbcdef58733b1d8c8a05923006a1b7c3774bafd49d"}},{"ruleId":"D2","level":"warning","message":{"text":"core.convert (cognitive 19): core.convert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/core.py"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe40425b40f7b96c903dadb314d530a4a851a883208c67472ac544aa0ec5b338"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.altercolumn_sql (cognitive 19): Generator.altercolumn_sql has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 4 (8 pts), boolean chains 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":"sqlglot/generator.py"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a26837313bea9fac336015e6eab597c542ec315ebc35789667e3efc3b1b5e36"}},{"ruleId":"D2","level":"warning","message":{"text":"MySQLGenerator.show_sql (cognitive 19): MySQLGenerator.show_sql has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 7, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/mysql.py"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee1ad59c2c4149d7f043ca77b6d18952f752708b6746cd742eb266469078ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize.normalize (cognitive 19): normalize.normalize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/normalize.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6e6a90e1c09db450a05d80a83f65a55f385239529168310e2c27d09ed2c24"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize.distributive_law (cognitive 19): normalize.distributive_law has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/normalize.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dddfdb88f12d6dfeeaf8cedad51d69ed4b266bd3b1e210074ca2aa6ce7612b"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope.columns (cognitive 19): Scope.columns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/scope.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a79f0bdcd740bcc36908f0551855d676e4b95acb492e127d31dec430bb02119"}},{"ruleId":"D2","level":"warning","message":{"text":"unnest_subqueries.unnest_subqueries (cognitive 19): unnest_subqueries.unnest_subqueries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, 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":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"880492b21aef5b8bbb933ca7c422507dc93422e6096055d2f00c1f6f58950add"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_generated_as_identity (cognitive 19): Parser._parse_generated_as_identity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"sqlglot/parser.py"},"region":{"startLine":8054}}}],"partialFingerprints":{"codehealthFindingId/v1":"53256f02d98b2d23e10b93a5e2bf209c49a78243ddf1eaa8102d2b8e670b3968"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect.strposition_sql (cognitive 18): dialect.strposition_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/dialects/dialect.py"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7226faeb2311a27fc051f0c33a329bfa3775c1f87aa76f7dcac23f57dd3f4ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect.sequence_sql (cognitive 18): dialect.sequence_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (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":"sqlglot/dialects/dialect.py"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b01b3e345466ee56b46ee08c3ee05b7c408bdef66ede87f6c42f11321e6795"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonExecutor._execute (cognitive 18): PythonExecutor._execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/executor/python.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eec5b0a9cfc1f21a48523f2b172872a51ef037cedd120227e5d56f2503ef49"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.generatedasidentitycolumnconstraint_sql (cognitive 18): Generator.generatedasidentitycolumnconstraint_sql has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 3, 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":"sqlglot/generator.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39d50ddb706bb48c1a05154f03b642a05151e8815aabbe3b6361d18e0cd4e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"bigquery._alias_ordered_group (cognitive 18): bigquery._alias_ordered_group has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (3 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":"sqlglot/generators/bigquery.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44defa81aa06cdda47ae41b1688dfa24e2744c2788d06dcaac927961ce134f"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresGenerator.unnest_sql (cognitive 18): PostgresGenerator.unnest_sql has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), ternaries 1 (3 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":"sqlglot/generators/postgres.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce85d9ab10e9bbdf544aadfedd3e069d615f5f0d631aefd8caf01dfebfe96c7"}},{"ruleId":"D2","level":"warning","message":{"text":"lineage._pivot_chain_mapping (cognitive 18): lineage._pivot_chain_mapping has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 3 (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":"sqlglot/lineage.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"40555145d335a91e4a563c70ead59fb7a0de37312a91bf4100d265a1dbcea903"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._restore_dot_parts (cognitive 18): TypeAnnotator._restore_dot_parts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b089964f32f895d5bcf612e0be6089a556e6c519400c5023ce0eb70d546813c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._get_unpivot_column_types (cognitive 18): TypeAnnotator._get_unpivot_column_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4188dec9a7ea68dfc71012b8efeaa5711734ac3a9505377f890046f020e0694"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier.remove_complements (cognitive 18): Simplifier.remove_complements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 1 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"192e25c3262c463b5ef8ef55e2fb41653d6b9935c0036afaa8146c83923c8c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._kv_to_prop_eq (cognitive 18): Parser._kv_to_prop_eq has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":7723}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd661d554a29bf7a9fb910fb30e66caad4f24494907c328d44b1cb9972937f15"}},{"ruleId":"D2","level":"warning","message":{"text":"transforms.eliminate_distinct_on (cognitive 18): transforms.eliminate_distinct_on has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/transforms.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbbaccc4d0ef621203b94350a8f7d4ffc7ed110a30eed1cefe5731010221b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"anonymize._fit (cognitive 17): anonymize._fit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/anonymize.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ae3d118b4ba6bb3ca9cb8ebde129f2233d101bf17ff4c25040e2eb90986050"}},{"ruleId":"D2","level":"warning","message":{"text":"Dialect.normalize_identifier (cognitive 17): Dialect.normalize_identifier has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, ternaries 2 (4 pts), loops 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc948fe2de07e5942adf05b68a08d354778132f51c882cd91cb1a4dd6a756f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.datatype_param_bound_limiter (cognitive 17): Generator.datatype_param_bound_limiter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 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":"sqlglot/generator.py"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a1562b3936ec7743db909e43f4b26cbe93a1a7a49a6225decdbf13392a584a"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator._like_sql (cognitive 17): Generator._like_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97cd4eb4884e62900da2ca421353925801deaa521d3c3d40561a1187a855b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"duckdb._struct_sql (cognitive 17): duckdb._struct_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (4 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc12f45aa5b62b6258c918e83412d9ddcf8ce702830a8578c8f9b7e7b2e419c5"}},{"ruleId":"D2","level":"warning","message":{"text":"presto.amend_exploded_column_table (cognitive 17): presto.amend_exploded_column_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 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":"sqlglot/generators/presto.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0033e6fab208741e6ad278d91f7142724834f347e1602497b784c6fac5a4ce17"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeAnnotator._annotate_set_operation (cognitive 17): TypeAnnotator._annotate_set_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, 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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"103847590c8cb30031dfe4245fad2cdfcebb9f3e9bd059d5e83df49c3a631cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver._get_available_source_columns (cognitive 17): Resolver._get_available_source_columns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2, ternaries 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":"sqlglot/optimizer/resolver.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"729f001680797b9745810139e36cda07559f7114e97f983a6ff60911dc977d04"}},{"ruleId":"D2","level":"warning","message":{"text":"Simplifier._flat_simplify (cognitive 17): Simplifier._flat_simplify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 3 (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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5bbbb196eccf36d04bdfe665273a3966242c3098b42ea8595c9011a706999c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._build_predicate (cognitive 17): Parser._build_predicate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 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":"sqlglot/parser.py"},"region":{"startLine":6332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dff29cb1cbeef6741de42023f9e717948232b2b8ce775df042c6faa40d2f24d"}},{"ruleId":"D2","level":"warning","message":{"text":"ClickHouseParser._parse_function (cognitive 17): ClickHouseParser._parse_function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (8 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":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"8858404c265f4915666407877e690586b8018f66d95fbbfc07482cc767045440"}},{"ruleId":"D2","level":"warning","message":{"text":"FabricParser._parse_create (cognitive 17): FabricParser._parse_create has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/fabric.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603865107525b1a46385d1f6f418901b8f2df5e36339e10af5b5271e1117750"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveParser.build_cast (cognitive 17): HiveParser.build_cast has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 1 (4 pts), boolean chains 2, ternaries 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":"sqlglot/parsers/hive.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f4f9d95aac509b5c1fc0feb4a0a640d973af24432f5427deafe588e56313a6"}},{"ruleId":"D2","level":"warning","message":{"text":"dialect.groupconcat_sql (cognitive 16): dialect.groupconcat_sql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (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":"sqlglot/dialects/dialect.py"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"756a7cffb8a67b8df2ca257c31dc613a04e3d5129553a462aa09c59781c59167"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonExecutor._append_unmatched_join_rows (cognitive 16): PythonExecutor._append_unmatched_join_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), ternaries 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":"sqlglot/executor/python.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb01a6275bed773c9ae8abf6d18eb0225645d386b80e9e6c54077afd55049a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"builders.replace_children (cognitive 16): builders.replace_children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), ternaries 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":"sqlglot/expressions/builders.py"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe622640c422254a66d98c702851d1588817ceb09c0587d86ddf9c3caccb6f8"}},{"ruleId":"D2","level":"warning","message":{"text":"builders.func (cognitive 16): builders.func has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 1 (3 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":"sqlglot/expressions/builders.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"7561aa501f4ac7a208200ce868ccc3742e8765cfdf1f964506465c6aaaa1592f"}},{"ruleId":"D2","level":"warning","message":{"text":"Select.join (cognitive 16): Select.join has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/query.py"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef00fa99bbf4ebe374f67e33dc6e9dba62980718ec6ab97ac993ce90e05e36d"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.group_sql (cognitive 16): Generator.group_sql has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f589115d821d012a21cc5875c20db0f72caa9ac2bea9155e5fd8aa710842b"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator.lock_sql (cognitive 16): Generator.lock_sql has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 6 (7 pts), boolean chains 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":"sqlglot/generator.py"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0deb4633ea9811bb5665db29911ad23f6bf7b14ade06004e747010a47d4b352"}},{"ruleId":"D2","level":"warning","message":{"text":"bigquery._widen_decimal (cognitive 16): bigquery._widen_decimal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/bigquery.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e156796d1935feda2bc222f822236df1595e184ef249ee57be0e8e9be9935277"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckDBGenerator.regexpreplace_sql (cognitive 16): DuckDBGenerator.regexpreplace_sql has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), ternaries 2 (3 pts) (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":"sqlglot/generators/duckdb.py"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebc953dd33b52d23ed6913f1ef5e90a58f447352a6973f1f6ceedc21abc104b"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_subqueries.merge_ctes (cognitive 16): merge_subqueries.merge_ctes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), boolean chains 3, ternaries 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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bc9612c7daf1b1b4940740ebf3aaca120617ad2231925d6de3edc1db6974a5"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns.qualify_columns (cognitive 16): qualify_columns.qualify_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd62ac70941340de10a69b38950d31d9b36fa1b5a52eb7656618c507c845d14"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_columns._expand_struct_stars (cognitive 16): qualify_columns._expand_struct_stars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"661b0b78f10156ba92233dc8952a94947e8063b809faaf15151356e959c90914"}},{"ruleId":"D2","level":"warning","message":{"text":"simplify.simplify_parens (cognitive 16): simplify.simplify_parens has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts) (nesting depth added 1). 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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f148feb4ac0cb9ec095e69f6cdad5d94f0b5606aa848fb5e17abd477d8b07f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_table_sample (cognitive 16): Parser._parse_table_sample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 1 (2 pts) (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":"sqlglot/parser.py"},"region":{"startLine":5494}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd9158d03d1f4a485cb2c0c731c32c95a2f0b19d3fcebbc43680e3801881dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_is (cognitive 16): Parser._parse_is has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 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":"sqlglot/parser.py"},"region":{"startLine":6454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e911c1baa688ce54c437d93e8b0d11cc38d5016ed0718fcb9386cda9154c0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser._parse_analyze (cognitive 16): Parser._parse_analyze has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1, ternaries 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":"sqlglot/parser.py"},"region":{"startLine":9825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ecb018686336a5b9e5cde5648418e280d53dc61a4b1f5379f4fd2f3ce68d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClickHouseParser._parse_auto_refresh_property (cognitive 16): ClickHouseParser._parse_auto_refresh_property has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ce9166fbcc200994104b87ef6c54763650806b7da72f3a048e03d5b7ed5399"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeParser._parse_show_snowflake (cognitive 16): SnowflakeParser._parse_show_snowflake has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/snowflake.py"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4ffc24c041631956e2e118f20ac8b3c2f833eadacabaab2316f6dac6cf20a"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerCore._add (cognitive 16): TokenizerCore._add has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"sqlglot/tokenizer_core.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e2e433ed7043874b7f84b65996fdc7ee7264cd4008afdd421dc54da18bbbb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Generator: TooManyMethods \u2014 511 methods. The bar is 30 methods; this is 481 over it, 17.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":"sqlglot/generator.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bcdebe58365769b0ddca62743d5a9254c817b5a91401bcb8d541cc3bd44bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlglot/parser.py: FileTooLong \u2014 8008 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7508 over it, 16.02\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":"sqlglot/parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"384c0bcd71aeeb6c1a4145a29aea057752815ceae489b296d9dd0c5cd9ce89a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 416 methods. The bar is 30 methods; this is 386 over it, 13.87\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":"sqlglot/parser.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ce2ade414e03d0cddaff43ca992e8e3925d3bd456e7d0b8bd6ec6bdc8a610d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlglot/generator.py: FileTooLong \u2014 5035 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4535 over it, 10.07\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":"sqlglot/generator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42976f7e01506b5fd216dd3fde7a7995445c40f05183085ac749efca5675d7bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DuckDBGenerator: TooManyMethods \u2014 148 methods. The bar is 30 methods; this is 118 over it, 4.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/duckdb.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b09b4dd70340e2344050ee765830ef72a9e9137c8f908ced41b812055eca873"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/core.py: FileTooLong \u2014 1855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1355 over it, 3.71\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":"sqlglot/expressions/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d8ed8b76c5703e27977708d817c60a89bac34057019378eb0101203b03149a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dialects/dialect.py: FileTooLong \u2014 1700 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1200 over it, 3.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":"sqlglot/dialects/dialect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d5688ab6d998aed2d5eadaa4ad06d5c9fea1f1ed9ae2bb5b549e312659a3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/simplify.py: FileTooLong \u2014 1359 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 859 over it, 2.72\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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3e0270c8ebdfb1facc2b065bb702c2509f4c0dd53a40598d5194ecb4fd689e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expression: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/core.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b372f7398100f5f3cd9e81b22a56e4c23bf8613225f9edf5799cc62a219db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.67\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":"sqlglot/expressions/core.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c2068d2a50f5577c407feb67fa1402e9e80278c0d5298b464008027c3dcd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/query.py: FileTooLong \u2014 1328 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 828 over it, 2.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":"sqlglot/expressions/query.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d801f09fa700199f7b2f1e515eb7df041ce34ef43a7016a94fbe0b2c911fcf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlglot/tokenizer_core.py: FileTooLong \u2014 1219 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 719 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/tokenizer_core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef971d865248a98a15e0a3791a93c40b31147803cee5c281928d9cd93b3a89c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/duckdb.py: FileTooLong \u2014 1194 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 694 over it, 2.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/duckdb.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb7d5945984e72eb978f81ac581f32c1c00605745e07fdd7ab47d5e31e93a16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/snowflake.py: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 592 over it, 2.18\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":"sqlglot/parsers/snowflake.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49844cabb143e47969273df6cb16661ea7d2b50a3db5d0acad7bc5dbbc6ab72d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/qualify_columns.py: FileTooLong \u2014 1089 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 589 over it, 2.18\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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"532dca9e8b360a423d782da17d27a6307bf4f385862945cff23b4385604a842e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/snowflake.py: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 368 over it, 1.74\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":"sqlglot/generators/snowflake.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8442c4a8efff064ee80c7e30718e839d489bb6101418fd826f99fe39c25213df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/annotate_types.py: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae9af66bf777da05985c0d3b3acd8412c33734937becd964a51404f06c35a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TSQLGenerator: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/tsql.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cd308184652981c428649b2aa9db0e2222e80ca74dfcf9f5ea84796b7a112a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gen: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eb74af1cb6679ed78be620a68b2f568e8be36ce4447e7ad480dc28eff10d02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/scope.py: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 207 over it, 1.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":"sqlglot/optimizer/scope.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bea59bf787f6e7ec67bae173539c92f38a72348d730c0057cbd822a4c83b7c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlglot/transforms.py: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/transforms.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6ce48269788a8403713320ffcb23a77985e5d52d33575593cb41dc6b8107b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SnowflakeGenerator: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"sqlglot/generators/snowflake.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1876405d3dde5f4a718f8eed44c798bfed4fc81c878365585b462b954da50f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClickHouseParser: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32f6aa18137c73bbf1dff65489de1d31910adb94fda2186516c4ebf78e20c8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/clickhouse.py: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 159 over it, 1.32\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":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"016de7fd16f8c8a23c6b0f711a682bbe13ffd26aafd11a73ef2d8bae6105f7c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/bigquery.py: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 over it, 1.30\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":"sqlglot/generators/bigquery.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57088cf2ecd7187e310cec46feae5ffcec979a893157945ea8673d69dfe22623"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SnowflakeParser: 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":"sqlglot/parsers/snowflake.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ec182956910ae8852c32e6f6922db4e48c469b4f11d7c2255309a610de20c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/mysql.py: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\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":"sqlglot/parsers/mysql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13d00737f929b091feffb907f6dbb6a7ee7b35891d088b18fb738720a3d2433"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/tsql.py: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\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":"sqlglot/parsers/tsql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c862bc65aa28c94484c45d112e27e303aa5de907fb9c90e14f853829eb50f437"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/clickhouse.py: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\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":"sqlglot/generators/clickhouse.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e94119c68663f7b72cfc38898e4a1c4f70749d6178936904ce6b108882d276"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClickHouseGenerator: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"sqlglot/generators/clickhouse.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"324ef15b45cf589a6ce8ff5eaf624bbf5b0eb6217c0a67a486d4fdfcfb9154c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeAnnotator: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aba5bf175a4812a37e1878b65722243d70a591a3f93a6b93b94f8955c53301"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/tsql.py: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.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":"sqlglot/generators/tsql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0add54ecf0138c7e1dcda72b25a91816ed0dfccbc001f55af053dadbd8dc0731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parsers/bigquery.py: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/bigquery.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c14c640097707f1a2b8c23a79582f8536ec2fc8d88d09aa4e98f1d1730501e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/builders.py: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 59 over it, 1.12\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":"sqlglot/expressions/builders.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"938adb74a4d5ab442921a84a4f42ded5e0f3ae546d122825e378823186996c25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlglot/tokens.py: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 over it, 1.09\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":"sqlglot/tokens.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a27cdf11671d06749a6e9856e43ff10a476e19c8b2e20d39f667c8e51244de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/merge_subqueries.py: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 43 over it, 1.09\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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50090e38e78dfff7ee26bcabd9cd10615bbe84b18852d6540b5e0d0a8dcbc35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/postgres.py: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\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":"sqlglot/generators/postgres.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c34daa3d7346052be20eae292704fcc9d2b9540b665ba5d5f966631689fc1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generators/presto.py: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/presto.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9221166590749965a08fe6de9e808e0a44352ac70ae778d8bf9e4985724923c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): sqlglot/parser.py:5079-5142 | sqlglot/parser.py:7231-7301 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"sqlglot/parser.py"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cc97099941e7687301071ff29134e7fb683572eb166185c0377c7e6d87eb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): sqlglot/parsers/trino.py:169-190 | sqlglot/parsers/trino.py:194-214 \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":"sqlglot/parsers/trino.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfa3c93cc9e06c79cd203b4242663543f61baf0243a40816862dab780611aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sqlglot/generators/hive.py:600-611 | sqlglot/generators/snowflake.py:949-958 \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":"sqlglot/generators/hive.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"504f65604320000e1cba5a2c0c1a145533907d65e07dd692ed16c6d783f15754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sqlglot/parsers/snowflake.py:157-165 | sqlglot/parsers/snowflake.py:170-179 \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":"sqlglot/parsers/snowflake.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6765c09d4166037f9a1a9577b8590470facd8b28f3e64da994cb60e81e944f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): sqlglot/generators/snowflake.py:1159-1181 | sqlglot/generators/teradata.py:160-175 \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":"sqlglot/generators/snowflake.py"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d264fa0af1b777661a68eadbb9395b503f8514823707116a7fd85e9ad779212e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sqlglot/generators/bigquery.py:282-295 | sqlglot/generators/spark2.py:83-96 \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":"sqlglot/generators/bigquery.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e1674ad6c01ee065988b0827d460f63ce8892d6fb711b914cbe6e764857b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): sqlglot/generators/fabric.py:29-46 | sqlglot/parsers/fabric.py:9-27 \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":"sqlglot/generators/fabric.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"920e72729d232bce2674fb960892e91c92607ce365456daec8cf73a74c9984be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sqlglot/typing/duckdb.py:56-68 | sqlglot/typing/postgres.py:19-31 \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":"sqlglot/typing/duckdb.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d0a6396c6d4e6629addd219cda88285a56d65f8f8a53ddb2bc8e25c19ecaba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): sqlglot/parser.py:10601-10623 | sqlglot/parser.py:10626-10653 \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":"sqlglot/parser.py"},"region":{"startLine":10601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb32d28f5293cca0e1e8e154577f23a203acd62a8f3b891a298f5e75363a528"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sqlglot/generators/presto.py:41-50 | sqlglot/generators/presto.py:582-591 \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":"sqlglot/generators/presto.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"693e6f783630ddda741114b64d6f78df538fac25e121db014e51ecf5f912378a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): sqlglot/typing/bigquery.py:54-66 | sqlglot/typing/duckdb.py:23-32 | sqlglot/typing/redshift.py:13-20 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/typing/bigquery.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5a404b9b2f0993e3917a9bfca818138c2116de8991e1f60e425883858600d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sqlglot/parsers/bigquery.py:665-682 | sqlglot/parsers/bigquery.py:685-701 \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":"sqlglot/parsers/bigquery.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c540c61197a21c961782aa41b26d39c989b1d46f37d0a7336604a9cff870235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sqlglot/parsers/presto.py:24-35 | sqlglot/parsers/presto.py:46-55 \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":"sqlglot/parsers/presto.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61725d368a2a41068827e15575f5794a7eabbf7a25f641cb57942e79e51a3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sqlglot/parsers/doris.py:130-140 | sqlglot/parsers/starrocks.py:243-251 \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":"sqlglot/parsers/doris.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41ee3dd3916254fa722ae7cddee83fdb7ff35446a61076d32bb742c36a1cc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sqlglot/dialects/dialect.py:2891-2909 | sqlglot/parsers/bigquery.py:126-146 \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":"sqlglot/dialects/dialect.py"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"3461d1e7ca7ad37a65c90227d5500ccd1610106eda5087c9b2d9d0cffc223591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): sqlglot/generator.py:4054-4060 | sqlglot/generator.py:4307-4312 | sqlglot/generators/redshift.py:375-382 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":4054}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f81629d3283c17b4c2e598fd4c75ae61266d1f7a41415f73da77709130c204c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sqlglot/parser.py:145-152 | sqlglot/parsers/spark2.py:22-31 \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":"sqlglot/parser.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"401c3024ea7080741941d0c38b5e7b58df0ed2d1d4ce47da7effebcc6381fe50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sqlglot/parsers/snowflake.py:1453-1469 | sqlglot/parsers/teradata.py:401-422 \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":"sqlglot/parsers/snowflake.py"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed44ce2fddec7bcfb6c11062a36f2e81ca86fc2a4a23acbc832ec843582b940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): sqlglot/generator.py:5166-5171 | sqlglot/generators/tsql.py:733-738 \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":"sqlglot/generator.py"},"region":{"startLine":5166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8460104fc0876b81fdbf07495812a88080b15e24c3f73037b6412bf5f5a10f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sqlglot/generators/duckdb.py:1511-1514 | sqlglot/generators/duckdb.py:1518-1521 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/duckdb.py"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d587b397db2989d70b8b8197ddf3138b97fb40a1fc46391bb0fa187d7e0a307"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): sqlglot/parsers/exasol.py:20-21 | sqlglot/parsers/snowflake.py:184-185 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"sqlglot/parsers/exasol.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d27f738fef4aa39102fda0d896bb990b1cf52bc06e8fd8e77f9f5407f1a9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): sqlglot/parsers/exasol.py:26-27 | sqlglot/parsers/snowflake.py:199-200 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"sqlglot/parsers/exasol.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4df70b9a61fb632109227368496d74bab1679586ffdbac6e12872d627e83c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sqlglot/executor/env.py:17-28 | sqlglot/executor/env.py:32-43 \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":"sqlglot/executor/env.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc97acb17ac99ff6979bf0092c7579930e1eaae8f331516c9176d18cdb8d261"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sqlglot/parser.py:4670-4677 | sqlglot/parsers/prql.py:181-188 \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":"sqlglot/parser.py"},"region":{"startLine":4670}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b31746958af114f7e98fa6e0b2bcf659325074bc9c776658d84d160d421ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sqlglot/generators/snowflake.py:1145-1156 | sqlglot/generators/databricks.py:196-203 \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":"sqlglot/generators/snowflake.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c28bec2dd666fcbd22afccd7295ebefd3e63b7f6326d1dbf8ec319b2ac359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): sqlglot/generators/exasol.py:886-891 | sqlglot/generators/mysql.py:829-833 \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":"sqlglot/generators/exasol.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52e050459f84fd3125a3f5f6745524ea48a942dd70fc5cef01507427834a321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): sqlglot/generator.py:4642-4645 | sqlglot/generators/exasol.py:894-897 | sqlglot/generators/tableau.py:32-35 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"sqlglot/generator.py"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b437b65a580033f903ee9afa5d2118489a6108019b3ef256348c63324037cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sqlglot/generators/snowflake.py:55-62 | sqlglot/parsers/bigquery.py:44-54 \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":"sqlglot/generators/snowflake.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5516692c2de5c4975a93f34ec5d223c02f69e86c9ac1616a90cca574a2ccd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sqlglot/generator.py:6409-6412 | sqlglot/generators/oracle.py:168-172 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generator.py"},"region":{"startLine":6409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a11db102cae801a758eeb2200f00ee616a6bc6f55135e6c641702229355b6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): sqlglot/expressions/dml.py:354-381 | sqlglot/expressions/query.py:1414-1443 \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":"sqlglot/expressions/dml.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e6071c6d4fd6485df8c5cab5b406be472232e950b8b5848e6d61e3eca56fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): sqlglot/expressions/dml.py:429-460 | sqlglot/expressions/query.py:1234-1261 \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":"sqlglot/expressions/dml.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d84c76d1a70e680ad1f49024daad5678305688b9d227aa1b03657a6c73e3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): sqlglot/generator.py:3030-3031 | sqlglot/generators/clickhouse.py:725-726 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"sqlglot/generator.py"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564d8dab6ad329470774e79db171b0a13474591d64ff383c4fcf3969390da31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): sqlglot/expressions/dml.py:229-263 | sqlglot/expressions/query.py:318-353 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"sqlglot/expressions/dml.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9fb1944398633d23904be12e9f01084ea2561510653cb42fdb45c6f9520e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sqlglot/parser.py:10995-11001 | sqlglot/parsers/snowflake.py:1114-1117 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":10995}}}],"partialFingerprints":{"codehealthFindingId/v1":"f017ea5919a54d7f66af16e44f77a92c37928b4d2ce5568ee296e914fe8f505b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): sqlglot/generator.py:3931-3933 | sqlglot/generators/mysql.py:871-873 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"sqlglot/generator.py"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cceb7ededb8f79a64714f9a4cd09ccd0578e10d1d75819098937f4a3338ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): sqlglot/generator.py:5183-5185 | sqlglot/generators/mysql.py:876-878 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"sqlglot/generator.py"},"region":{"startLine":5183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b648d94831b7d3345a8eb8a55fef1959e5fb0489426fe5e6ea771cde912f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): sqlglot/dialects/dialect.py:2802-2807 | sqlglot/parsers/oracle.py:30-33 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/dialects/dialect.py"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fdf72f8be6eda3723b9d9e31457499b132d2d7454275652983eff3e3a25f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): sqlglot/parsers/doris.py:106-127 | sqlglot/parsers/starrocks.py:219-240 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parsers/doris.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f033ced67a153369ea33e27cfdfdc0615c2056e189861d25cd0109ac6857be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 2): sqlglot/typing/snowflake.py:150-168 | sqlglot/typing/snowflake.py:190-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.Expr\u0060 in one and \u0060exp.Kurtosis\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":"sqlglot/typing/snowflake.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba03c34dd5ff5e97af1a73bc65de71095de7b095600dd33d8789213711eca38a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): sqlglot/generators/duckdb.py:437-450 | sqlglot/generators/duckdb.py:531-542 \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 \u0060sqlglot/generators/duckdb.py:437\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.ArrayInsert\u0060 in one and \u0060exp.ArrayRemoveAt\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":"sqlglot/generators/duckdb.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9113c7fc19fa5f0753175aa99d3c1d66c9024bb80783437b7fb111ce597ee742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sqlglot/generators/mysql.py:68-78 | sqlglot/generators/postgres.py:226-236 \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 \u0060self\u0060 to \u0060MySQLGenerator\u0060 in one and \u0060PostgresGenerator\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":"sqlglot/generators/mysql.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b5df86fab8590a744eb51f2ba512097ff6f48a140fab9392a11450be279600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): sqlglot/generators/fabric.py:34-42 | sqlglot/parsers/fabric.py:14-21 \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 \u0060sqlglot/generators/fabric.py:34\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":"sqlglot/generators/fabric.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06129e0d1375da51bd32c24046c23de2a4a3648f8ca5c7e9bbf1889857a20d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sqlglot/generators/presto.py:41-48 | sqlglot/generators/presto.py:582-589 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.SHA2Digest\u0060 in one and \u0060exp.SHA2\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":"sqlglot/generators/presto.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b4dab63d910467f12c78246f89903679a8fe296b458ee5ceeb39a97333371c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sqlglot/optimizer/merge_subqueries.py:191-198 | sqlglot/optimizer/merge_subqueries.py:231-238 \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 \u0060sqlglot/optimizer/merge_subqueries.py:191\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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e38cc22f27c8f71ac1f4ce316ae5079cf6015e5a604658472482eb0d4c327b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): sqlglot/generator.py:4176-4181 | sqlglot/generator.py:4188-4194 \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 \u0060sqlglot/generator.py:4176\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.JSONArray\u0060 in one and \u0060exp.JSONArrayAgg\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":"sqlglot/generator.py"},"region":{"startLine":4176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c10df65157154ec508d00a71101d81fd1482a0c1d4dc267449be6a1a7a5a016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sqlglot/schema.py:457-463 | sqlglot/schema.py:517-523 \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":"sqlglot/schema.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"558fc5039e3127f9e91864f5d0be31be08b8b10ee8f96f4d9e7cd8431912fd58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sqlglot/typing/duckdb.py:56-62 | sqlglot/typing/postgres.py:19-25 \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":"sqlglot/typing/duckdb.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d4019309f823f1d6f6f6541b082979e2282c07c916e68a8dc94003d3f7e2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): sqlglot/generator.py:1524-1528 | sqlglot/generator.py:1602-1606 | sqlglot/generator.py:2501-2506 | sqlglot/generator.py:2555-2559 | sqlglot/generator.py:3340-3344 | sqlglot/generator.py:4044-4048 | sqlglot/generator.py:4452-4456 | sqlglot/generator.py:6525-6529 | sqlglot/generator.py:6578-6582 | sqlglot/generators/clickhouse.py:730-734 \u2014 there are 10 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 10 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.SequenceProperties\u0060 in one and \u0060exp.Describe\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":"sqlglot/generator.py"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dae245cc1db951ef223fbdb12f5efab1adb31aaa8f0015249baf646c90a4f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): sqlglot/generator.py:2561-2565 | sqlglot/generator.py:3313-3317 | sqlglot/generator.py:4505-4509 | sqlglot/generator.py:5355-5359 | sqlglot/generator.py:6527-6531 | sqlglot/generators/clickhouse.py:732-736 | sqlglot/generators/trino.py:176-182 \u2014 there are 7 copies across 3 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 7 sites; resolving a subset leaves the remainder to drift apart. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.RowFormatDelimitedProperty\u0060 in one and \u0060exp.LoadData\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":"sqlglot/generator.py"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"5584b1c7e15913ad6ac9bd9c2290f72f17e2f6c276daa46fc01b4f2915705bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sqlglot/generator.py:2515-2519 | sqlglot/generators/tsql.py:632-636 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.Kill\u0060 in one and \u0060exp.Transaction\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":"sqlglot/generator.py"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5672b29def990bd2fd1eafda0dcfeff88b35d8de202d8fe5bdeda729b9339d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): sqlglot/expressions/dml.py:126-155 | sqlglot/expressions/dml.py:391-420 | sqlglot/expressions/query.py:1554-1583 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/dml.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fea91563b342146caf15267f437a8758ce1b9eaf93e626be7badc24ef4a9606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sqlglot/parser.py:3365-3369 | sqlglot/parsers/snowflake.py:1033-1037 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ece37eba87f2221808e1e134ca0ac9d4664d0215f75fe55011697ea37c665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sqlglot/generators/trino.py:137-141 | sqlglot/generators/trino.py:150-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expression\u0060 to \u0060exp.WhileBlock\u0060 in one and \u0060exp.RepeatBlock\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":"sqlglot/generators/trino.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2518a521552735c7f30dfc9ced27d5843e81ea6c4bac09935c9f730377d3a25"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DuckDBGenerator (LCOM4 119): DuckDBGenerator\u0027s methods fall into 119 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 119 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"b428f0e4a2dce125da2d8c4353265d3d73309a0153acea3ae0c2562b41e1554a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SnowflakeParser (LCOM4 24): SnowflakeParser\u0027s methods fall into 24 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 24 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":"sqlglot/parsers/snowflake.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41d317d0ad3e804a87684428cef0ff7979a5eb7f70f3a8c92e344e779bcf7cf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClickHouseGenerator (LCOM4 21): ClickHouseGenerator\u0027s methods fall into 21 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 21 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":"sqlglot/generators/clickhouse.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"415f2995407c1a4612316001656fc50d215c8de2dc6a403d24234f3464071d6e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MySQLGenerator (LCOM4 20): MySQLGenerator\u0027s methods fall into 20 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 20 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":"sqlglot/generators/mysql.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac2ab6ec87c8664dd8795e5ef6589ca5e071897ef4aabb210d511083741a6e6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Expression (LCOM4 19): Expression\u0027s methods fall into 19 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 19 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":"sqlglot/expressions/core.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc55178ac7dce59713fadca24057832c80b154409fc057011df21a1cb1253e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HiveGenerator (LCOM4 18): HiveGenerator\u0027s methods fall into 18 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 18 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":"sqlglot/generators/hive.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaf2e6e6f8b282a28e9ad11e6ce7bec4b8f31cefc4a76942d8f51d223583920"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TSQLParser (LCOM4 16): TSQLParser\u0027s methods fall into 16 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 16 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":"sqlglot/parsers/tsql.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb60a2a740aefd8a03620d13723a308a08081e7bcf492aae6a8ae786179a60"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BigQueryParser (LCOM4 14): BigQueryParser\u0027s methods fall into 14 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 14 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":"sqlglot/parsers/bigquery.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"988225588cd277854c9cb30e687b98d62baa2dec4aa99ae1398f6554f4bca0ed"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Dialect (LCOM4 4): Dialect\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":"sqlglot/dialects/dialect.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7e2282f43a260258a9e3311000befe619f028ad57d042af2201db09356a9d3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: benchmarks/compare.py: 0.0% line coverage (0/74)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/compare.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851f32f26be2f5fef574e192355e43cee586c12ffb2943e2da235c5c5399bc1c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: benchmarks/optimize.py: 0.0% line coverage (0/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/optimize.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0e15c40813a10c74f3e9f59926c2c626adc09af082b2af18f7e68003a7dcad"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: benchmarks/parse.py: 0.0% line coverage (0/228)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/parse.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31d18b0e22a7f887296f24a6c874f041e2f2671602db906a9ccbfea70d9053b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: setup.py: 0.0% line coverage (0/4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"setup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438f0bdce8e8ba6e181e92d9a76cceb66bd86def2a774b9aa82b0f3e5949039d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/__main__.py: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/__main__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ccd298d99027b7b81a6f1ea3f66904214996b01ce638f923336cea63e7e3ba"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/executor/__init__.py: 0.0% line coverage (0/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/executor/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2381692bbb1eff69b6607dfba864ad3485222291adcd084cf6e18df1c90fa9c8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/executor/context.py: 0.0% line coverage (0/69)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/executor/context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b864bb589d001df71618e9439f37c38f4c2cd45cbc08737bdfe0624f46496d19"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/executor/env.py: 0.0% line coverage (0/167)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/executor/env.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a42c8e736fc6074d000aa6b83ed9f0bf15db63019278d0c6caba2a42a3ec31"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/executor/python.py: 0.0% line coverage (0/350)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/executor/python.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be02c13674ba980060ff88c80831316e10ec4633bcf365826fc71a133bbd859"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/executor/table.py: 0.0% line coverage (0/90)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/executor/table.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06adb2a750e3be5abe3be9a2f45c709c95ab55002a314d682f8a12174e5760a2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/generators/python.py: 0.0% line coverage (0/65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/python.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24edbc61ac032c66ea09545726e25e727b7b2e32afa7e4245f9ca13468250256"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/optimizer/canonicalize_internal_names.py: 0.0% line coverage (0/186)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/canonicalize_internal_names.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1f3c5731f0983c33fe76604eeb537c5f106a0a71a026b3c8d361b07bec028f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/optimizer/eliminate_ctes.py: 41.4% line coverage (12/29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/eliminate_ctes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6570204e93138b8b23cff02b59a67a9f66cfedaa2156f7dc790c132c4a6366f8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/optimizer/eliminate_joins.py: 23.9% line coverage (26/109)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/eliminate_joins.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a01e4e0be0fb3313020eb0b852ca15a64619e938160ba77b45fac3ebee4bf7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/optimizer/helpers.py: 44.1% line coverage (15/34)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/helpers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7223b17c0e6192c4abbf14a0591d0febe848ef92749438fd77bb3f5092197c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/optimizer/normalize.py: 26.7% line coverage (23/86)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/normalize.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43121d130e99ffaf98ddd0f713da7cb69579a41f2efb19e41d63f558453e3958"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/optimizer/unnest_subqueries.py: 12.7% line coverage (37/291)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35b6e7d615a5a632fd3c8ce9fb94cbf7c7efc29b74168b6f3da97c9d68a8093"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/planner.py: 0.0% line coverage (0/308)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/planner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ba6e7faed01fb3af0024bb94f25f98cef8d4714f672ede6ed96827b4cbf29f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/typing/bigquery.py: 32.6% line coverage (28/86)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/typing/bigquery.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a362ce75298ac000e0a78dd426f711dfccbe6433e2e3d84fc8ba51897268cfa4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/typing/mysql.py: 30.2% line coverage (13/43)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/typing/mysql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4d063cf9a34b0b9176e7c1523dbbf6fa045d5755308a2ff98ea5291b49a83"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/typing/snowflake.py: 32.3% line coverage (32/99)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/typing/snowflake.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92564a0529c22e5c0e4cb6d2e365d4a3b282479c78df687e29e7c84f01133210"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/typing/spark2.py: 38.1% line coverage (8/21)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/typing/spark2.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6b97bbbef851cbc16f45f7d3b29f011f69da4b845a2a21e365ec494b9df6b0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: sqlglot/typing/tsql.py: 38.9% line coverage (7/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/typing/tsql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7aa51ae9bff3fe52e9f65601f77c6c4254f1b59f66e4188813e6d7a7bc15fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/parser.py: sqlglot/parser.py changed 102 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in Parser._parse_types at line 6854. 73 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parser.py\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":"sqlglot/parser.py"},"region":{"startLine":6854}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fee5fcfcdcd3e86c2c6b34c56f45673604224624725c703f5c1a95fcd21497"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/unnest_subqueries.py: sqlglot/optimizer/unnest_subqueries.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in unnest_subqueries.decorrelate at line 225. 22 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/unnest_subqueries.py\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":"sqlglot/optimizer/unnest_subqueries.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe55b9f88235f3fa3486713de4c356336e36ce00172f13d19ed6c1287a01298"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/qualify_columns.py: sqlglot/optimizer/qualify_columns.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in qualify_columns._expand_stars at line 1154. 25 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/qualify_columns.py\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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f5a4492f0a94dad80de24070588503dd649c14e5b679a97b216941d31f29fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/generator.py: sqlglot/generator.py changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Generator.join_sql at line 3050. 55 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generator.py\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":"sqlglot/generator.py"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c8caeaadc4e56a76d2d37e0bc9da2ef070db0c3205a62793a057199534002f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/simplify.py: sqlglot/optimizer/simplify.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Simplifier._simplify_comparison at line 981. 23 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/simplify.py\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":"sqlglot/optimizer/simplify.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"66652d5ee82a90cfcbb32d523b04abb4b6c7ea3b66bf7391867d3a696547e42b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/pushdown_projections.py: sqlglot/optimizer/pushdown_projections.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in pushdown_projections.projection_reachability at line 86. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/pushdown_projections.py\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":"sqlglot/optimizer/pushdown_projections.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93d9c15cc3d8e6aef979c0db945f132a4744490cbc4b15b99262b0e61ce2a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/dialects/dialect.py: sqlglot/dialects/dialect.py changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _Dialect.__new__ at line 306. 34 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/dialects/dialect.py\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":"sqlglot/dialects/dialect.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"20327c0edabd471432fffff8e58e31b3cf33e9318397d82a9af1218a076b027b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/tokenizer_core.py: sqlglot/tokenizer_core.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in TokenizerCore._extract_string at line 1307. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/tokenizer_core.py\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":"sqlglot/tokenizer_core.py"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"33be9914ea70879b3bcf915fc42eec6a4935c47bbfbefd2aa34408d2dcf99051"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/annotate_types.py: sqlglot/optimizer/annotate_types.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in TypeAnnotator.annotate_expression at line 447. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/annotate_types.py\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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0222dc0b76ee8a1f56fe1e38b80024a9f7bc2af0491e46ee5cb35bd1600a17df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/resolver.py: sqlglot/optimizer/resolver.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Resolver.get_source_columns at line 206. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/resolver.py\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":"sqlglot/optimizer/resolver.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f511be725b2ae2d82a7fdb2469a82f25d5a92d6cd5e8ba7ec45eb833f99e98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/merge_subqueries.py: sqlglot/optimizer/merge_subqueries.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in merge_subqueries._mergeable at line 244. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/merge_subqueries.py\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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"754956d92d7f1f5b67d2c05e76f40d178ef9560ad4ed09811690ee2bc29daffd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/scope.py: sqlglot/optimizer/scope.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Scope._collect at line 184. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/scope.py\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":"sqlglot/optimizer/scope.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d70082da6c0c68024b31dcb54ccc9be75635739551ea1c9a3b02011081ceed6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/qualify_tables.py: sqlglot/optimizer/qualify_tables.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in qualify_tables.qualify_tables 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/qualify_tables.py\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":"sqlglot/optimizer/qualify_tables.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f30423449cd8ba9760a7dedb4c373877ac9fca5268a5ef3ab9d6ed94f21b091"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/generators/bigquery.py: sqlglot/generators/bigquery.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in bigquery._array_agg_fold_sql at line 209. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/bigquery.py\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":"sqlglot/generators/bigquery.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaac228d7faec7956004e819754f10ad87abb04bb87b9006f64cc5296b0f67d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/canonicalize_internal_names.py: sqlglot/optimizer/canonicalize_internal_names.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in canonicalize_internal_names.canonicalize_internal_names at line 13. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/canonicalize_internal_names.py\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":"sqlglot/optimizer/canonicalize_internal_names.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef793f8c5213fa7e9bb9f9dd5478736f9309e5920959cf0172b349d0f7606564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/parsers/teradata.py: sqlglot/parsers/teradata.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TeradataParser._parse_column_ops at line 327. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/teradata.py\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":"sqlglot/parsers/teradata.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8503d175bad0876e31e823ea226c3c542d3d2b2e12a58b0bb4093d731fb98c28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/optimizer/pushdown_predicates.py: sqlglot/optimizer/pushdown_predicates.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pushdown_predicates.pushdown_predicates 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/pushdown_predicates.py\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":"sqlglot/optimizer/pushdown_predicates.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc476186a7733a7d85460d902abcc4dcc297d494c66f952f42e3a3c1255a399"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/planner.py: sqlglot/planner.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Step.from_expression at line 49. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/planner.py\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":"sqlglot/planner.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"054b3e058cf0859f09542de64e80fdffd29727d5950987b278c27a4f05af93e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/typing/bigquery.py: sqlglot/typing/bigquery.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in bigquery._annotate_array at line 155. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/typing/bigquery.py\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":"sqlglot/typing/bigquery.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"216409c93f73a2ec03d17decc0fa6227729be18ed6c504b8ccf7fd660cb1e8c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/lineage.py: sqlglot/lineage.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in lineage.to_node at line 200. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/lineage.py\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":"sqlglot/lineage.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45ca04984b455e0c7a6d13abf40be0a8cf9ea2aa64ef67bccd6c13c3609c543"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlglot/transforms.py: sqlglot/transforms.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in transforms.eliminate_qualify at line 201. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/transforms.py\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":"sqlglot/transforms.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddc1ac729a93ec1661a8b36eb840bf76f216ed8e56513bedf4b7da688948512"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/sqlite.py: sqlglot/generators/sqlite.py changed 26 times in last 90 days and 23 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 sqlite._transform_create at line 23), 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(sqlite): preserve fractional seconds in strftime formats (#9178)\u201D; \u201Cfix(sqlite): preserve integer RANDOM semantics in DuckDB (#9177)\u201D; \u201Cfix(sqlite): use DATETIME for sub-day DATE_ADD/DATE_SUB units (#9155)\u201D; \u201Cfix(sqlite): translate week date arithmetic to days [CODEX] (#9168)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/sqlite.py\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":"sqlglot/generators/sqlite.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d036738bd6f568b8ac64c64a2fd825f5b3af14f8c0c6aa790e3b78e5f95637"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/clickhouse.py: sqlglot/generators/clickhouse.py changed 25 times in last 90 days and 22 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 ClickHouseGenerator.regexpcount_sql at line 575), 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(clickhouse)!: treat SHA1/SHA256/SHA512 as binary digests [CLAUDE] (#9156)\u201D; \u201Cfix(clickhouse): map formatDateTime specifiers that differ from strftime\u201D; \u201Cfix(oracle): keep VARIANCE and VAR_SAMP apart (#9075)\u201D; \u201Cfix(clickhouse): preserve logical aggregate null and numeric semantics\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/clickhouse.py\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":"sqlglot/generators/clickhouse.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"579b7982cd0f2f4b1a2812dad4e628920e0c2c619a00c67a1fc56b979a27dc8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/postgres.py: sqlglot/generators/postgres.py changed 19 times in last 90 days and 19 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 postgres._date_diff_sql at line 105), 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(postgres): generate CARDINALITY for ArraySize without a dimension [CLAUDE] (#9157)\u201D; \u201Cfix(generator): concatenate CHR calls for multi-argument CHAR (#9119)\u201D; \u201Cfix(oracle): keep VARIANCE and VAR_SAMP apart (#9075)\u201D; \u201Cfix(postgres): parse CONVERT as charset conversion (#9024)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/postgres.py\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":"sqlglot/generators/postgres.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"779100d5b1dba1e2ecf90cdb2c6958c7e5e80ea3ee3bb01ae35fe109ecb272e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/sqlite.py: sqlglot/parsers/sqlite.py changed 20 times in last 90 days and 18 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 SQLiteParser._parse_factor_operand at line 207), 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(sqlite): preserve character length across dialects (#9183)\u201D; \u201Cfix(sqlite): preserve NUL-terminated LENGTH in DuckDB (#9182)\u201D; \u201Cfix(sqlite): preserve fractional seconds in strftime formats (#9178)\u201D; \u201Cfix(sqlite): preserve integer RANDOM semantics in DuckDB (#9177)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/sqlite.py\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":"sqlglot/parsers/sqlite.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"797275ce4fa32ed3b8064462a49f1f73abb37c4c98e202769241ff074ebcf61f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/snowflake.py: sqlglot/parsers/snowflake.py changed 20 times in last 90 days and 14 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 SnowflakeParser._parse_show_snowflake at line 1247), 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(sqlite): preserve integer RANDOM semantics in DuckDB (#9177)\u201D; \u201Cfix: stop walking into udtf for walk_in_scope  (#9099)\u201D; \u201Cfix(snowflake): resolve \u0027e\u0027 flag capture group default in REGEXP_SUBSTR / REGEXP_SUBSTR_ALL (#8961)\u201D; \u201Cfix(duckdb): preserve Snowflake and BigQuery regex extraction semantics\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/snowflake.py\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":"sqlglot/parsers/snowflake.py"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e8b14fe5f1f12092fd1835d1173f6f0f35b6619a998f506602db56b840ea39"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/clickhouse.py: sqlglot/parsers/clickhouse.py changed 20 times in last 90 days and 14 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 ClickHouseParser._parse_auto_refresh_property at line 882), 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(clickhouse)!: treat SHA1/SHA256/SHA512 as binary digests [CLAUDE] (#9156)\u201D; \u201Cfix(clickhouse): raise ParseError for empty XOR calls [CODEX] (#9106)\u201D; \u201Cfix(clickhouse): generate array sorts and logical aggregates (#9072)\u201D; \u201Cfix(parser)!: respect dialect \u0060INTERSECT\u0060 precedence in set operations (#8704)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/clickhouse.py\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":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"076311a4c8fd6dd14cf846510b6fad81e3849a63f3b7b1f4e05940a0cfdb9f3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/duckdb.py: sqlglot/parsers/duckdb.py changed 19 times in last 90 days and 13 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 DuckDBParser._parse_join at line 441), 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(duckdb): distinguish printf and brace formatting [CODEX] (#9176)\u201D; \u201Cfix(parser): distinguish conditionless JOIN from comma joins (#9076)\u201D; \u201Cfix: preserve TRUNC calendar semantics across dialects (#9021)\u201D; \u201Cfix(parser): support TABLE query shorthand (#8897)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/duckdb.py\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":"sqlglot/parsers/duckdb.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ea95dfe48eef4dcf5fb20ba2ece4b53713e657328c610ec4aee0b6a94a1428"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/postgres.py: sqlglot/parsers/postgres.py changed 15 times in last 90 days and 13 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 postgres._build_regexp_replace 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(postgres): preserve generate_series step semantics [CODEX] (#9023)\u201D; \u201Cfix(postgres): parse CONVERT as charset conversion (#9024)\u201D; \u201Cfix(postgres): avoid duplicate function parameter modes (#9020)\u201D; \u201Cfix(parser): support TABLE query shorthand (#8897)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/postgres.py\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":"sqlglot/parsers/postgres.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcad97d2045935db223cdbc2c6c7a7a5508d06fa79a665f46f3c375b7b4d3bd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/oracle.py: sqlglot/generators/oracle.py changed 14 times in last 90 days and 13 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 OracleGenerator.version_sql 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(generator): concatenate CHR calls for multi-argument CHAR (#9119)\u201D; \u201Cfix(oracle): preserve variance semantics for windows and empty inputs\u201D; \u201Cfix(oracle): keep VARIANCE and VAR_SAMP apart (#9075)\u201D; \u201Cfix(oracle): eliminate SEMI/ANTI joins, map VAR_POP and APPROX_COUNT_DISTINCT (#9067)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/oracle.py\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":"sqlglot/generators/oracle.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd3e7df09c131d9147a04213f8340375848851830283ab57187121215bc32e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/teradata.py: sqlglot/generators/teradata.py changed 17 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 5 (its worst body is TeradataGenerator.tablesample_sql at line 143), 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(teradata): generate native DAYOFWEEK [CODEX] (#9064)\u201D; \u201Cfix(teradata): omit empty parentheses from CURRENT_TIME [CODEX] (#9050)\u201D; \u201Cfix: preserve TRUNC calendar semantics across dialects (#9021)\u201D; \u201Cfix(teradata): preserve BYTEINT type identity [CODEX] (#9030)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/teradata.py\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":"sqlglot/generators/teradata.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b4ffa4061eb487216f5030eb70ceda53f05b4e4a667612f1fb06758ebcf074"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/oracle.py: sqlglot/parsers/oracle.py changed 11 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 4 (its worst body is OracleParser._parse_to_number at line 215), 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(oracle): keep VARIANCE and VAR_SAMP apart (#9075)\u201D; \u201Cfix: preserve TRUNC calendar semantics across dialects (#9021)\u201D; \u201Cfix(oracle): preserve nlsparam in TO_DATE and TO_TIMESTAMP [CLAUDE] (#8874)\u201D; \u201Cfix(oracle): preserve end of month in ADD_MONTHS closes #8824 [CLAUDE] (#8825)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/oracle.py\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":"sqlglot/parsers/oracle.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cf04682faf606225194a56a91c5784f699890c5dcc60827c531beb6899369c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/starrocks.py: sqlglot/parsers/starrocks.py changed 14 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 10 (its worst body is StarRocksParser._parse_pivot at line 100), 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(duckdb): align Snowflake TIME_SLICE transpilation to epoch origin (#8899)\u201D; \u201Cfix(starrocks): infer static pivot output columns [CODEX] (#8689)\u201D; \u201Cfix(starrocks): parse map{...} literals as maps [CLAUDE] (#8682)\u201D; \u201Cfix(starrocks): don\u0027t default column names for multi-array UNNEST [CLAUDE] (#8671)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/starrocks.py\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":"sqlglot/parsers/starrocks.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"412e36dcf6c660ff6c414b8ed20953eb491a0d26615c398d3419285128d84657"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/presto.py: sqlglot/generators/presto.py changed 12 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 12 (its worst body is presto.amend_exploded_column_table at line 239), 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: stop walking into udtf for walk_in_scope  (#9099)\u201D; \u201Cfix(generator): keep the lambda of Spark\u0027s EXISTS(array, lambda) (#9140)\u201D; \u201Cfix(duckdb): keep NULL and empty arrays for LATERAL VIEW OUTER as LEFT JOIN UNNEST [CLAUDE] (#9091)\u201D; \u201Cfix(generator): concatenate CHR calls for multi-argument CHAR (#9119)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/presto.py\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":"sqlglot/generators/presto.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4dcaf1678317da156ab49835753f156c071d946c1d461938315509e6053d36"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/spark2.py: sqlglot/generators/spark2.py changed 9 times in last 90 days and 8 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 Spark2Generator.cast_sql at line 265), 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(duckdb): distinguish printf and brace formatting [CODEX] (#9176)\u201D; \u201Cfix(hive): handle MILLISECOND and MICROSECOND in DATEADD (#9161)\u201D; \u201Cfix(clickhouse)!: treat SHA1/SHA256/SHA512 as binary digests [CLAUDE] (#9156)\u201D; \u201Cfix(hive): preserve sub-day DATEADD units in Hive and Spark [CODEX] (#9085)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/spark2.py\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":"sqlglot/generators/spark2.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871831cfd8ef6b8e30d94c4fcce8e4010fbb3b03ba41d69a43330aed4d7e647"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/spark2.py: sqlglot/parsers/spark2.py changed 10 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 5 (its worst body is spark2.build_int_div at line 21), 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(parser): gate multi-part interval addition behind dialect setting (#9057)\u201D; \u201Cfix(mysql, spark): return an empty string for a negative LEFT/RIGHT length in DuckDB [CLAUDE] (#8967)\u201D; \u201Cfix(spark): preserve CREATE TABLE data source options (#8919)\u201D; \u201Cfix(parser)!: respect dialect precedence of IS predicates (#8676)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/spark2.py\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":"sqlglot/parsers/spark2.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5edf72293e1c9c264e6f9e0ca589d0bc89547e2399bc316cd22bbe9e4d97a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/optimizer/eliminate_joins.py: sqlglot/optimizer/eliminate_joins.py 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 14 (its worst body is eliminate_joins.join_condition 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(optimizer): keep LEFT JOINs onto UNION ALL derived tables in eliminate_joins [CLAUDE] (#9092)\u201D; \u201Cfix(optimizer): preserve single-row joins with USING, NATURAL, or outer sides [GEMINI] (#9053)\u201D; \u201Cfix(optimizer): preserve filters around special joins (#9040)\u201D; \u201Cfix(optimizer): preserve left joins with casted keys [CODEX] (#8859)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/eliminate_joins.py\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":"sqlglot/optimizer/eliminate_joins.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe7f014520d1a6db819955346b3a83a07873eda989c1bcbb81ca793916b2e73"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/dialects/duckdb.py: sqlglot/dialects/duckdb.py 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 4 (its worst body is DuckDB.column_alias_precedence at line 70), 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(optimizer): preserve source bindings in ORDER BY expressions [CODEX] (#8951)\u201D; \u201Cfix(optimizer)!: respect input column precedence in HAVING and QUALIFY (#8898)\u201D; \u201Cfix(duckdb): prevent SORT BY tokenization\u201D; \u201Cfix(optimizer): annotate struct-valued subqueries and row references (#8694)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/dialects/duckdb.py\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":"sqlglot/dialects/duckdb.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c66ef79aacfe6f8f5709ed877e8a02165bfcf04e40120761fccd1a8bbaba98"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/tokens.py: sqlglot/tokens.py 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 8 (its worst body is _TokenizerBase.__init_subclass__ at line 84), 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(tokenizer): parse SAVEPOINT and RELEASE as commands (#8920)\u201D; \u201Cfix(oracle): expand alternative quoting and support national literals (#8606)\u201D; \u201Cfix!: correct PostgreSQL, DuckDB, Redshift, and ClickHouse string escapes (#8484)\u201D; \u201Cfix(bigquery)!: decode string escapes and preserve byte literals (#8479)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/tokens.py\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":"sqlglot/tokens.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91e14f7d3f3b9c94a1ca3371a8d7c096b30109d3ddef8cfc6499f935ac42fe0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/starrocks.py: sqlglot/generators/starrocks.py 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 6 (its worst body is StarRocksGenerator.create_sql at line 323), 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(starrocks): parse map{...} literals as maps [CLAUDE] (#8682)\u201D; \u201Cfix(starrocks): generate PIVOT instead of dropping it [CLAUDE] (#8679)\u201D; \u201Cfix(starrocks): keep DATEDIFF\u0027s date-part semantics [CLAUDE] (#8636)\u201D; \u201Cfix(mysql): Misplaced table and index options. (#8553)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/starrocks.py\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":"sqlglot/generators/starrocks.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d06e713c77ab8bfb69e5f99923ee69e556144913d9da1a56b212fd7b089068"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/hive.py: sqlglot/generators/hive.py changed 9 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 11 (its worst body is HiveGenerator.datatype_sql at line 525), 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(hive): preserve sub-day DATEADD units in Hive and Spark [CODEX] (#9085)\u201D; \u201Cfix(generator): concatenate CHR calls for multi-argument CHAR (#9119)\u201D; \u201Cfix(generator): prevent SELECT_KINDS leaks in compiled builds (#9026)\u201D; \u201Cfix(databricks): preserve timestamp precision during SQL generation\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/hive.py\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":"sqlglot/generators/hive.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"769943b596b5d80ac2d9123e93d9c0302cf410fca6dff996d3c152425757408c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/tsql.py: sqlglot/parsers/tsql.py changed 7 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 TSQLParser._parse_user_defined_function at line 692), 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(clickhouse)!: treat SHA1/SHA256/SHA512 as binary digests [CLAUDE] (#9156)\u201D; \u201Cfix(tsql): treat \u0060output\u0060 as a valid identifier closes #8545\u201D; \u201Cfix(tsql): parse bare table hints [CODEX: GPT-6.1 Sol] (#8493)\u201D; \u201Cfix!: preserve pagination scope in set operations (#8385)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/tsql.py\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":"sqlglot/parsers/tsql.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea523dd16649b2b9365c584c8f89cb7c40ce90f07902c36adb09a020a161c9e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/redshift.py: sqlglot/generators/redshift.py changed 6 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 4 (its worst body is RedshiftGenerator.unnest_sql at line 334), 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(postgres): generate CARDINALITY for ArraySize without a dimension [CLAUDE] (#9157)\u201D; \u201Cfix(redshift): preserve date unit expressions\u201D; \u201Cfix(redshift): drop DISTKEY/SORTKEY/DISTSTYLE when generating other dialects (#8938)\u201D; \u201Cfix!: truncate integer division towards zero instead of rounding (#8532)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/redshift.py\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":"sqlglot/generators/redshift.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e21bf9fbfbc768e58d9a5eefa6b6d55e602549554a47b06b15541cd574ba52"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/dialects/oracle.py: sqlglot/dialects/oracle.py changed 6 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 3 (its worst body is Oracle.can_quote 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: preserve TRUNC calendar semantics across dialects (#9021)\u201D; \u201Cfix(parser)!: respect dialect \u0060INTERSECT\u0060 precedence in set operations (#8704)\u201D; \u201Cfix(oracle): map ISO week-numbering year IYYY to %G [CLAUDE] (#8675)\u201D; \u201Cfix(oracle): expand alternative quoting and support national literals (#8606)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/dialects/oracle.py\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":"sqlglot/dialects/oracle.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97e9d359df035a28f6c9e0a31db3715ae792dad04b447a2e4ec2e54ad612c05"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/presto.py: sqlglot/parsers/presto.py changed 7 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 presto._build_format_datetime at line 62), 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(clickhouse)!: treat SHA1/SHA256/SHA512 as binary digests [CLAUDE] (#9156)\u201D; \u201Cfix(bigquery): cast zoneless Presto/Trino AT TIME ZONE operand to TIMESTAMP (#9097)\u201D; \u201Cfix(presto): mark the third SLICE argument as a length [CLAUDE] (#9087)\u201D; \u201Cfix(presto): preserve DATE_TRUNC input type when transpiling to DuckDB (#8945)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/presto.py\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":"sqlglot/parsers/presto.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c785e9ffe08c652f19e2c3d5ad706eadd36af65281811665d235c6586c19e2ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/optimizer/optimize_joins.py: sqlglot/optimizer/optimize_joins.py changed 7 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 optimize_joins.optimize_joins at line 10), 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(optimizer): retain conditional CROSS JOIN predicates [CODEX] (#9149)\u201D; \u201Cfix(parser): distinguish conditionless JOIN from comma joins (#9076)\u201D; \u201Cfix(optimizer): preserve filters around special joins (#9040)\u201D; \u201Cfix(optimizer): preserve positional joins during optimization (#9042)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/optimizer/optimize_joins.py\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":"sqlglot/optimizer/optimize_joins.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"24280d81e7fa31ee8eb5e1f75c77093a8e29c138b09fbc491818b183bc2df511"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/dialects/clickhouse.py: sqlglot/dialects/clickhouse.py 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 4 (its worst body is ClickHouse.generate_values_aliases at line 59), 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(clickhouse): preserve escaped time format specifiers\u201D; \u201Cfix(clickhouse): map formatDateTime specifiers that differ from strftime\u201D; \u201Cfix(clickhouse): parse PASTE JOIN instead of aliasing the table (#8662)\u201D; \u201Cfix!: scope preserved function names to their dialect (#8512)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/dialects/clickhouse.py\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":"sqlglot/dialects/clickhouse.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c671199f506049095a269f71eb3cf4edbc2d263843b27b8354ac46f94da6afb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/databricks.py: sqlglot/generators/databricks.py 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 DatabricksGenerator.unnest_sql at line 96), 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(generator): add ORDER BY to window functions that require it (#9066)\u201D; \u201Cfix(databricks): preserve UNNEST join semantics (#9025)\u201D; \u201Cfix(databricks): drop timestamp precision Databricks doesn\u0027t support [CLAUDE] (#8905)\u201D; \u201Cfix(databricks): preserve timestamp precision during SQL generation\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/databricks.py\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":"sqlglot/generators/databricks.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"641052f2b8fc1503ad56c4f75c86b9a329d9621e5101500ba107aca29d4977e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/hive.py: sqlglot/parsers/hive.py 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 9 (its worst body is HiveParser.build_cast at line 161), 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(hive): support PARTITION BY EXCLUDING in windows (#8912)\u201D; \u201Cfix(parser)!: respect dialect precedence of IS predicates (#8676)\u201D; \u201Cfix(hive,spark): parse ALTER TABLE REPLACE COLUMNS [CLAUDE] (#8633)\u201D; \u201Cfix!: preserve BD literal semantics in Hive and Spark (#8455)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/hive.py\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":"sqlglot/parsers/hive.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4e3c7f55a0cf75aad3ed26995e16385dab5bbc31b2a201d42f3344be6b15d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/spark.py: sqlglot/parsers/spark.py 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 2 (its worst body is SparkParser._parse_generated_as_identity at line 139), 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(spark): handle a 0 start and a negative length in SUBSTRING for DuckDB [CLAUDE] (#8966)\u201D; \u201Cfix(spark): parse LISTAGG through _parse_string_agg (#8829)\u201D; \u201Cfix!: preserve BD literal semantics in Hive and Spark (#8455)\u201D; \u201Cfix(spark): emit SQL function determinism correctly [CODEX] (#8369)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/spark.py\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":"sqlglot/parsers/spark.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0500a1ef34b8a295c5c684ba50192baae04f636d5f28c47c27be5f63138601a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/expressions/temporal.py: sqlglot/expressions/temporal.py 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 6 (its worst body is DateTrunc.__init__ at line 174), 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(duckdb): preserve timestamp difference overload semantics\u201D; \u201Cfix: preserve TRUNC calendar semantics across dialects (#9021)\u201D; \u201Cfix(duckdb): align Snowflake TIME_SLICE transpilation to epoch origin (#8899)\u201D; \u201Cfix(oracle): preserve nlsparam in TO_DATE and TO_TIMESTAMP [CLAUDE] (#8874)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/expressions/temporal.py\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":"sqlglot/expressions/temporal.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebf61fd18f04583844132153c0813ec9974302d0edfb859132cc53295a998ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/expressions/builders.py: sqlglot/expressions/builders.py 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 builders.func at line 990), 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: keep table function arguments in replace_tables (#8872)\u201D; \u201Cfix(duckdb): preserve quoted variable names (#8795)\u201D; \u201Cfix: keep a replacement\u0027s grouping in replace_placeholders (#8624)\u201D; \u201Cfix(builders): allow None table name in table_ for sqlglotc (#8476)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/expressions/builders.py\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":"sqlglot/expressions/builders.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"9958b46d98b5d95ef2c692850d5c48c78848fd5bcaf825eecf547f12f5bc7e72"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/spark.py: sqlglot/generators/spark.py changed 4 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 SparkGenerator.ifblock_sql at line 209), 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(hive): handle MILLISECOND and MICROSECOND in DATEADD (#9161)\u201D; \u201Cfix(hive): preserve sub-day DATEADD units in Hive and Spark [CODEX] (#9085)\u201D; \u201Cfix(spark)!: convert ARRAY_INSERT position between 0- and 1-based dialects [CLAUDE] (#8460)\u201D; \u201Cfix(spark): emit SQL function determinism correctly [CODEX] (#8369)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/spark.py\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":"sqlglot/generators/spark.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecdbb3dec9d5a6a94386185f1a7134a7037a3706acc5a0ace369c0fb3b359d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/singlestore.py: sqlglot/generators/singlestore.py changed 4 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 SingleStoreGenerator.datatype_sql at line 1489), 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(oracle): keep VARIANCE and VAR_SAMP apart (#9075)\u201D; \u201Cfix(mysql): decode backslash string escapes (#8471)\u201D; \u201Cfix(singlestore): make Collate generation idempotent (#8454)\u201D; \u201Cfix(singlestore): ignore nulls in percentile ordering [CODEX] (#8352)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/singlestore.py\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":"sqlglot/generators/singlestore.py"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"23069c68a48bc68aca5a4546daf5adbf6d48c9427b2cb2e26c19dbd735d6c195"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/drill.py: sqlglot/generators/drill.py changed 4 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 DrillGenerator.escape_sql at line 119), 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(generator): prevent SELECT_KINDS leaks in compiled builds (#9026)\u201D; \u201Cfix!: truncate integer division towards zero instead of rounding (#8532)\u201D; \u201Cfix(drill)!: preserve backslashes in string literals (#8481)\u201D; \u201Cfix(bigquery)!: decode string escapes and preserve byte literals (#8479)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/drill.py\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":"sqlglot/generators/drill.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceed88f920505b94b0e6eb25914b34fde61cb77b449fb78ee66ac89bb0fbc1b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/trino.py: sqlglot/generators/trino.py 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 TrinoGenerator.concatws_sql 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(duckdb): keep NULL and empty arrays for LATERAL VIEW OUTER as LEFT JOIN UNNEST [CLAUDE] (#9091)\u201D; \u201Cfix(trino): preserve precision for all temporal literals (#8564)\u201D; \u201Cfix(trino): prefix JSON_QUERY paths with the lax mode specifier (#8313)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/trino.py\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":"sqlglot/generators/trino.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bd8b2de8d81675762061de587f528eb7d82b2f7cb6211a9252d93d75a0c442"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/typing/redshift.py: sqlglot/typing/redshift.py 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 5 (its worst body is redshift._annotate_sha2 at line 23), 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(redshift): infer AT TIME ZONE types for DATE and TIMETZ (#9073)\u201D; \u201Cfix(redshift): type annotation for Redshift AT TIME ZONE (#9071)\u201D; \u201Cfix(optimizer)!: annotate sha2 for redshift properly (#8577)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/typing/redshift.py\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":"sqlglot/typing/redshift.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9024a91b3b9f95ab05669c96075601d24f645588b085e9537d2716ae823606"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/athena.py: sqlglot/generators/athena.py 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 10 (its worst body is athena._generate_as_hive at line 46), 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(generator): prevent SELECT_KINDS leaks in compiled builds (#9026)\u201D; \u201Cfix: allow \u0060EXTERNAL FUNCTION\u0060 in Athena \u0060CTAS\u0060 (#8602)\u201D; \u201Cfix(athena)!: inherit Trino dialect, parser and generator defaults (#8464)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/athena.py\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":"sqlglot/generators/athena.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"931bed2fb035ac6fadf37732fece4c9612359172856ddbfe1a7b4cf77b298099"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/doris.py: sqlglot/parsers/doris.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is DorisParser._parse_range at line 74), 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(parser)!: respect dialect precedence of IS predicates (#8676)\u201D; \u201Cfix(doris): round-trip MATCH operands and quoted analyzers (#8607)\u201D; \u201Cfix(parser): bare ALTER DROP refactor and indexes named concurrently\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/doris.py\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":"sqlglot/parsers/doris.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47fc7168b5e1ada1f608045fc580d574003542c154acc862c9de7b642f5770"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/parsers/trino.py: sqlglot/parsers/trino.py 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 14 (its worst body is TrinoParser._parse_routine_statement at line 238), 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(bigquery): correct percentile and distinct-array transpilation (#8674)\u201D; \u201Cfix(trino): preserve precision for all temporal literals (#8564)\u201D; \u201Cfix(trino)!: preserve precision for timestamp and time literals (#8534) (#8538)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/parsers/trino.py\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":"sqlglot/parsers/trino.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d80bb9fbab8a5b421ce3bbfdd70feed37bee5dd24e9bbc284d947f993620cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: sqlglot/generators/fabric.py: sqlglot/generators/fabric.py 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 7 (its worst body is fabric._add_default_precision_to_varchar at line 28), 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(fabric): don\u0027t re-wrap AT TIME ZONE that is already cast to DATETIME2 [CLAUDE] (#8699)\u201D; \u201Cfix(fabric)!: transpile json type to varchar(max), similar to xml\u201D; \u201Cfix(fabric)!: keep scale and length for MONEY, SMALLMONEY, XML and IMAGE [CLAUDE] (#8362)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 20:48:55 \u002B02:00\u0027 --until=\u00272026-11-17 20:48:55 \u002B02:00\u0027 --full-history --no-merges -- sqlglot/generators/fabric.py\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":"sqlglot/generators/fabric.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0c2c44f85618bf87dec78f8a308fc996a2682bb7cb514560d607407a084d6c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: sqlglot/executor/context.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"04ba9283cd17676f9f798c14c3b95799974b61fae9c97295275ec1333040e577"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This is incorrect AST, DATE_PART creates a STRUCT of values but it\u0027s stored in \u0027year\u0027 arg \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":"tests/dialects/test_duckdb.py"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee9a7445f718fd95b63010243f60bb8a6bcc5df9d313be6a178e7015449b666"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: The normalization should be done by default once we\u0027ve tested it across all dialects. \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":"sqlglot/generator.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"da755b4ccbc990a1a4bdff494ffb179793480653fab3f826a39da6cf4849f8a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: can we somehow convert the former into an equivalent \u0060regexpExtract\u0060 call? \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":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e1a7c67932ce442f933ab55d9e949f2a54982de61999f610a0937cdc820375"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: TAKE for ranges a..b \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":"sqlglot/parsers/prql.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94717a59cd5d73a568415a3d5004d1dd314a31282a91c1813ba9ca7a71cfb34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): should be -\u003E exp.DType but some coercion lambdas return DataType \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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c426a90d1b8ab3bdfb4ee9e0b2985ce299e9ecf1d57110afb2111f861ce8f778"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): should be expression: E -\u003E E but mypyc resolves the TypeVar \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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b19d6e3cce91ec95f9b13718a9c9cb20bafcf9aa9e3322c712af97f29e52e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): expression.type = ... should work but mypyc compiles the property \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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1e0252f36619b6a30340e06cf913c2cfda23bd4c5e0ed77f1d8dd3a0c18b2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): uses list() \u002B _set_type instead of direct expr.type = ... because \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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b5c8d8ab447995b344817aaf37013d694a9d2a95f13c068bace84fa2b786bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): should be isinstance(expression, (exp.Connector, exp.Predicate)) but \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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8f27da03a347e137502383749f2ac8105d1b2cdf8a721b0802aa8ecf13e77b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): rebind to exp.Expr to avoid Selectable trait vtable dispatch for .args \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"8611c3d2cc0fbbd03552cfcc5102a19ede1ca304413df62e1ef995f2afb6db7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): use a separate variable to avoid reusing \u0060select\u0060 (Alias) with a different type \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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2fd414140ca7d666e12f1c2119fd8e3845d0d10bc450efda498f07164819c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): use a separate variable to avoid reusing \u0060tables\u0060 (list) with dict type \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":"sqlglot/optimizer/qualify_columns.py"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"337a40e2b09edc23e4848312e782e4c4e376159f1d8cafb78e086bd895714b13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (mypyc): rebind to exp.Expr to avoid DerivedTable/UDTF trait vtable dispatch \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":"sqlglot/optimizer/scope.py"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"624c65ca6ef74dc0fea62484c34e8e08618b41b0b7192610e6d0dd4397ad2ab9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: create a helper that can be used to detect nested literal expressions such \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/simplify.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0347f5058a3be1685bfa22a7aef0957d6e5cbf112ba5c20d74a3af26bea743d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: perhaps we can check if the parent is a Join and transpile it appropriately \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":"sqlglot/generators/tsql.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d00741beb779bdc3ad11761e3740bd076bf80bde155422bb64bd4b7cfa76a81"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (73137 LoC, 1401 module-visible types across 11 directories) overshoots its size bounds. 1 of 2 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4842ad367a78941ccec73d857627e21e838b932492f4ae73cdd87ada79a9f00"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 88 % of calls cross a namespace and only 34 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"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":"138705163169f65dbd51bc13a049705defba507eb80cbd426d2795db9f93a255"},"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":"c9fca59ea86f9760f12e5612a868bb09a5d17172cab23e328a1f56c73a5243a1"},"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":"2e158c7f9ca757bb7bed1b5f11416f4cc07af1321e6b25135d18c980a5a22693"},"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":"d2b1f8952476da31b511b61456edffd784ea3adb3acc736b2128a28cdc060f6c"},"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":"c08c6aed65bd34798076eebe28548b52caffc540ee1e3fb3129d114aa32f24bb"},"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":"69aec6e277daa439c5049bce889c1c929be22b8e13fc22fcdb076f962259b857"},"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":"dd11169e87a86653171e61ccb8910965c63c4201ce5a988d4787728f44a0a9d8"},"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":"f2c6f11ac798ed360e7a4fa46b2e27d9c1423b65af61f4f39364f7b588361190"},"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":"326b2d0b48a5b844d5c2763dab78342001b2d33686741855e7ad9ee4b3aaca8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bcbfe0e6f18623ef1584e586444485aa920a09003cc9498f7492a557f717872"},"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":"b4aceae8710426a59e2362c596ace2d0480e3b7759d815052b3c81d2ac6190ab"},"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":"309ebefe35b9d967ecf3693409153d6e3559e7e416c2e9c24093af571a0e1948"},"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":"35a441f01e9e01fdee47756eebddf36475fd3c89f391f8b365ebca187b08a2cb"},"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":"881c44e265f15d02170f3b37fbaa3b9172ad4ff9c2372fb7d7cd098be9a5edd3"},"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":"c2f8f2953c0643d80c4c965a6ff25943c098dd0715a4d463cb37d5c66d352b8b"},"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":"2f28dd48b2d9e207adba44f23a5f33e791ed73faa933b6355721485cc165c1bd"},"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":"2918ccf0cbf4d2b340631905d189d7e246155b9aacffd84d00ce8c22832613b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b60521dc5eab87e858bd9b50abce6cd8f934c7a4e1076886534a3739c7ee9fb"},"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":"b88a7535ec7ef7b07369fbebd967ba34cfac191811704be16a21320e59e37317"},"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":"bae36e1676f7278f49c314a806f886c4e09a70228f9740a445cf13ac19daed54"},"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":"d6944854f069ac7a90d056cc395d9ada62021b67920156a48eaced847f2fb68c"},"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":"4964aa8c9890a686e3390ff9483edd19bba20d46dc93748d1102d233d5e68c15"},"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":"b227c44ecfef0ee5767a087b86c68b7c7006481b6d8390d6e29c04cf0027f868"},"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":"dc7905d02f153979d7f0dd5f697e996b3c31e0c2eb9599af8c4be7a0a011c8e8"},"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":"25c3b62c03c2af02afcabd9e00c15b0237f1be9085c775cb911726f5f2357ea4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c036832ae2a46fa1d3e06a42e7d824f5ed6e71f32e2169a376088f03fba91db"},"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":"4dda63c110d6631f5d82b1d66f680ebcf48530a5a47c5c2ea503186fac7b235a"},"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":"d82701cbc234506c233a8128f87bba56f66545816fd816ba3fc156d7b65bef15"},"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":"6a52180ea26766e61365f77d6ac40b40f6f1662a7c5d343b5f740b96bc35daaa"},"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":"b92c6e98a0b983bfe163722135ceeac4e4bf4e4d9a936d2c11ef36d3a492ed70"},"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":"5c24effefdc0b054c1b2c9125d7e111b9de996f40d2caa9a5aa5a08025f8c8bb"},"taxa":[{"id":"CWE-95","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":"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":"2804bb550445918de8b00c8612a3df6a398690a49ccb72d41fd7819b5cd7a2f7"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","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-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: oracle.py \u2194 oracle.py: \u0060sqlglot/generators/oracle.py\u0060 and \u0060sqlglot/parsers/oracle.py\u0060 change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 11 shared commits counted here, the most recent 3 are \u006079716c77\u0060 fix(oracle): keep VARIANCE and VAR_SAMP apart (#9075); \u00608688c120\u0060 fix: preserve TRUNC calendar semantics across dialects (#9021); \u006049a6467d\u0060 fix(oracle): preserve nlsparam in TO_DATE and TO_TIMESTAMP [CLAUDE] (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/oracle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ac5ad30f56a81efca0484a3115467c9517339ab1f412918740b2798a2309f4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: trino.py \u2194 trino.py: \u0060sqlglot/generators/trino.py\u0060 and \u0060sqlglot/parsers/trino.py\u0060 change together 62% of the time (10 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) 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 \u0060862fd554\u0060 fix(trino): preserve precision for all temporal literals (#8564); \u006098157867\u0060 feat(trino): parse LOOP/REPEAT/ITERATE/LEAVE routine statements [CLAU\u2026; \u006031f37511\u0060 feat(trino): parse WHILE/DO/END WHILE routine statements [CLAUDE] (#8\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/trino.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"390423c41ca002c25320e26d6290dc2c50e140d7837f9d88890b95b6466c6d1a"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"43f88aed0dedf980feac45a37eb59d1a8f7e7cf59b5406c26b4483989914aae0"},"taxa":[{"id":"CICD-SEC-6","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":"422ffd3e302643783eb527c2ca2cd333b8e55644b814f67115f7ea4b72ce54f0"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","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":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/package-test.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060sqlglotc/pyproject.toml\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":"sqlglotc/pyproject.toml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"20884dc8a3d034c38af0db971867a3be3c6c97fd2b8224123686af46058a62b4"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/package-publish.yml"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060delimiters.is_string and delimiters.this == self.dialect.INITCAP_DEFAULT_DELIMITER_CHARS\u0060 appears character-identically in 2 files \u2014 sqlglot/generator.py, sqlglot/generators/presto.py. 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":"sqlglot/generator.py"},"region":{"startLine":6743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9f71ec0f523a3c56f455584745c23117022cd909843c372fd88eddf29e8d14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.args.get(\u0022decimals\u0022) or exp.Literal.number(0)\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/mysql.py, sqlglot/generators/tsql.py. 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":"sqlglot/generators/mysql.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a0c703b6a876c2e193b79ca1197638228a0444b2f7826ce4be860805c73938"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.args.get(\u0022length\u0022) or exp.Literal.number(256)\u0060 appears character-identically in 3 files \u2014 sqlglot/generators/redshift.py, sqlglot/generators/snowflake.py, sqlglot/generators/spark2.py. 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":"sqlglot/generators/redshift.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07303957c6c55ca28a01f1f50a58c26be4f51c885ec30f4b3be4b928d97b7d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.args.get(\u0022replacement\u0022) or exp.Literal.string(\u0022\u0022)\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/postgres.py, sqlglot/generators/spark2.py. 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":"sqlglot/generators/postgres.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"03df51ea61544a58ede34fb25968ce1039894296aedfcade64819076e6ed812b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression.args.get(\u0022default\u0022) or exp.null()\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/doris.py, sqlglot/optimizer/simplify.py. 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":"sqlglot/generators/doris.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd3518e23a9de1aa669e2285e9de152a82e33d12cbad3abc6ab0c8ef3a1fc72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression.args.get(\u0022replacement\u0022) or exp.Literal.string(\u0022\u0022)\u0060 appears character-identically in 2 files \u2014 sqlglot/dialects/dialect.py, sqlglot/generators/duckdb.py. 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"054ae1b842af7a73c851babc6be68a0a3027e33a1535b80ba6d397678159fca3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression.args.get(\u0022with_\u0022) or exp.With()\u0060 appears character-identically in 2 files \u2014 sqlglot/optimizer/qualify_tables.py, sqlglot/transforms.py. 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":"sqlglot/optimizer/qualify_tables.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f381873dc174aebe721d3b5d5a095aa63c9d67338e6d83f445422d9b9429d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression.is_type(exp.DType.MAP) and len(expression.expressions) == 2\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/materialize.py, sqlglot/generators/risingwave.py. 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":"sqlglot/generators/materialize.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee30c6a4c0bb1211f0af14a5c62e235ab7c9e4339420a03e80a4e8868c0e852c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expression.text(\u0022unit\u0022).upper() or \u0022DAY\u0022\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/exasol.py, sqlglot/generators/postgres.py. 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":"sqlglot/generators/exasol.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d102af8f371851e16fd294d036116cdad5c5916dac88313c62d457997f1cd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_iso_date_ or is_iso_datetime(date_text)\u0060 appears character-identically in 2 files \u2014 sqlglot/optimizer/annotate_types.py, sqlglot/optimizer/canonicalize.py. 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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92093533f5086f99cb3710b101cd77f8fa4226bb9267182aefe324260ea0bf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(arg, exp.Array) or arg.is_type(exp.DType.ARRAY)\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/duckdb.py, sqlglot/generators/trino.py. 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d1b68d3aa05ffb291539bb5f1583b39afe441579a7c67da57f2d296c1b5d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(column_type, exp.DataType) and column_type.this in (exp.DType.VARCHAR, exp.DType.CHAR) and not column_type.expressions\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/fabric.py, sqlglot/parsers/fabric.py. 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":"sqlglot/generators/fabric.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a23c4e5c4bec88873ade1eab8090f226d657f1beac1997b69452319a0ba10b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(expression, exp.Add) and left.is_type(exp.DType.INTERVAL)\u0060 appears character-identically in 2 files \u2014 sqlglot/typing/duckdb.py, sqlglot/typing/postgres.py. 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":"sqlglot/typing/duckdb.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f61fffeeeff04a7e48bd413b8135b065c8803272c2f03bd54bfce71ce8ccbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(limit, exp.Limit) and limit.is_limit_all\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/snowflake.py, sqlglot/generators/sqlite.py. 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":"sqlglot/generators/snowflake.py"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d7a77c0e3940f260fd81e6a2f3244be14ca82cd9ed0bf603b18fff3faeaef6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(this, exp.Column) and not this.table\u0060 appears character-identically in 2 files \u2014 sqlglot/generator.py, sqlglot/parser.py. 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":"sqlglot/generator.py"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"894529a58562e2f71174d5e519bb418c84261dd561e6e5159dc3a7acf1ad311d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(this, exp.Limit) and this.this\u0060 appears character-identically in 2 files \u2014 sqlglot/dialects/dialect.py, sqlglot/generators/clickhouse.py. 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7fa3955957d68cc18d25acea8d64f02b5b273a1b8a0d7c2592218daf26b946"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(this, exp.Not) and isinstance(this.this, exp.Is)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/sqlite.py. 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":"sqlglot/parser.py"},"region":{"startLine":6435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb044e0cb997a06387bc2998fd7c23f312660e31c470b2eb3c7007d765887e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(this, exp.TsOrDsToTime) or this.is_type(exp.DType.TIME)\u0060 appears character-identically in 2 files \u2014 sqlglot/generator.py, sqlglot/generators/duckdb.py. 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":"sqlglot/generator.py"},"region":{"startLine":5578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a950f6ab5b1c778bc648dea1acc0f1320317ed960b7ddb044870e922855e1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(unit, Column) and len(unit.parts) != 1\u0060 appears character-identically in 2 files \u2014 sqlglot/expressions/core.py, sqlglot/expressions/temporal.py. 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":"sqlglot/expressions/core.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"7268dcec5fb9671f2bbc355b0e524fd7fccb2b6c7f4f3c03917f765f10f302ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060join in expression.args.get(\u0022joins\u0022) or []\u0060 appears character-identically in 3 files \u2014 sqlglot/generator.py, sqlglot/optimizer/qualify_columns.py, sqlglot/optimizer/scope.py. 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":"sqlglot/generator.py"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36d9d3ab83b48fb8cd00ef8fce04b9a04861668ba9a184ecf5c3fd4e3e7b92a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060join.method in (\u0022ASOF\u0022, \u0022POSITIONAL\u0022) or join.kind in (\u0022ASOF\u0022, \u0022ANY\u0022, \u0022PASTE\u0022) or join.args.get(\u0022nearest\u0022)\u0060 appears character-identically in 2 files \u2014 sqlglot/optimizer/merge_subqueries.py, sqlglot/optimizer/pushdown_predicates.py. 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":"sqlglot/optimizer/merge_subqueries.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdca999a1c846c2e13b98e507a6c390c8a7f3395677239941981807682e472bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lateral in expression.args.get(\u0022laterals\u0022) or []\u0060 appears character-identically in 2 files \u2014 sqlglot/generator.py, sqlglot/generators/presto.py. 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":"sqlglot/generator.py"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0221dc83cbdd8b99cd7723809ea62f30e1ff7cc0bcf0d213cb0be2b2767e60cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.meta_get(\u0022nonnull\u0022) is True and right.meta_get(\u0022nonnull\u0022) is True\u0060 appears character-identically in 2 files \u2014 sqlglot/optimizer/annotate_types.py, sqlglot/optimizer/simplify.py. 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":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"e442f8b321b49143af4238d99dcde1edd14195cbf2deac23f2a9180bb709f91f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(args) == 1 and isinstance(args[0], exp.Query)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/duckdb.py. 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":"sqlglot/parser.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ffdc517cd6921701f0b56f71a643e080cee0ac9011bfa30cd4e300c95fd78d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.is_int and isinstance(node, exp.Literal)\u0060 appears character-identically in 2 files \u2014 sqlglot/optimizer/pushdown_projections.py, sqlglot/optimizer/qualify_columns.py. 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":"sqlglot/optimizer/pushdown_projections.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9eb3f5cc2f7ea6479af0de5b520ada4db0db39a74f87c55350bc3178e6d5f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.parent and not isinstance(node.parent, (exp.Window, exp.AggFunc, exp.Select))\u0060 appears character-identically in 2 files \u2014 sqlglot/generator.py, sqlglot/generators/bigquery.py. 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":"sqlglot/generator.py"},"region":{"startLine":6345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9d3870cf11d92066086527b2f5e40e2c37a22e3eb049893e80d37b262b5cb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not arg.type or arg.is_type(exp.DType.UNKNOWN)\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/duckdb.py, sqlglot/generators/trino.py. 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":"sqlglot/generators/duckdb.py"},"region":{"startLine":4383}}}],"partialFingerprints":{"codehealthFindingId/v1":"22acdb6b2c57fbab1fdeedbf22094558c0395f05434a4e66d45b92e0d59efd7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(keys, exp.Array) or not isinstance(values, exp.Array)\u0060 appears character-identically in 2 files \u2014 sqlglot/dialects/dialect.py, sqlglot/generators/clickhouse.py. 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a6f0508f3b044c4eb2016d277e6e1e4da57219b00c9492fbf3ab2ca1a60e73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self.SUPPORTS_TEMPORAL_PRECISION and expression.this in exp.DataType.TEMPORAL_TYPES\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/hive.py, sqlglot/generators/presto.py. 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":"sqlglot/generators/hive.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa1df69685179553fc83966db5d66bdabd3e4cbe8edcf2247105f80d03c7e97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not skip_from_token and not self._match(TokenType.FROM)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/prql.py. 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":"sqlglot/parser.py"},"region":{"startLine":4670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7baef721fff9cc43e2be6933d573e8a95b78a2fd0ea251c44edcfdd98ed5908"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameters and parameters.is_string and \u0022e\u0022 in parameters.name\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/snowflake.py, sqlglot/parsers/snowflake.py. 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":"sqlglot/generators/snowflake.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf080ffa723629504ae5342f3a2fb294eadb464739f46e2564cc6331068e736"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._curr and not self._match(TokenType.R_PAREN, advance=False)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/snowflake.py. 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":"sqlglot/parser.py"},"region":{"startLine":10413}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1e9e559a3033bc9ac12b49121e569376799da022b69e4e7e75ec9c9d785227"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._is_connected() and self._parse_var(any_token=True)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/bigquery.py. 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":"sqlglot/parser.py"},"region":{"startLine":7555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c57d3bb85cb4f92280af039703c3f1316951149918cda9451b2203147ab8c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._match(TokenType.COMMA) and self._parse_bitwise()\u0060 appears character-identically in 3 files \u2014 sqlglot/parsers/bigquery.py, sqlglot/parsers/trino.py, sqlglot/parsers/tsql.py. 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":"sqlglot/parsers/bigquery.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"463657fa78de9592c2746a9250cd94b7a2e205e29923c005dad4a9280d2256f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._match(TokenType.SET) and self._parse_csv(self._parse_update_assignment)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/teradata.py. 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":"sqlglot/parser.py"},"region":{"startLine":10065}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66069e7088a75c733c59c87072b05b0a22b3c65c29e3eb12f07fa4211b101b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._match(TokenType.USING) and self._advance_any() and self._prev.text\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/mysql.py. 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":"sqlglot/parser.py"},"region":{"startLine":8211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea56f9ac8386f3cc2db84ff056857d6c8312ade1ceb3c0c1556946b03667bfa3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._match_texts((\u0022STORED\u0022, \u0022VIRTUAL\u0022)) and self._prev.text.upper() == \u0022STORED\u0022\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/sqlite.py. 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":"sqlglot/parser.py"},"region":{"startLine":7971}}}],"partialFingerprints":{"codehealthFindingId/v1":"972782c217844495908b43cc2400556e9c6ab58223ad3e89d1999de3588109ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._parse_function() or self._parse_var(any_token=True)\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/tsql.py. 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":"sqlglot/parser.py"},"region":{"startLine":5050}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4cf207be84fd64b151efe5e75c38bbb3ec67de91399fcfebdd5e7b9a5c9ce9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._parse_identifier() or self._parse_primary_or_var()\u0060 appears character-identically in 2 files \u2014 sqlglot/parser.py, sqlglot/parsers/hive.py. 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":"sqlglot/parser.py"},"region":{"startLine":9334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f21308df0348bfbf5e4aa6287011f995e386580e6650714159f0caba3964200"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._parse_string() or self._parse_id_var()\u0060 appears character-identically in 2 files \u2014 sqlglot/parsers/clickhouse.py, sqlglot/parsers/duckdb.py. 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":"sqlglot/parsers/clickhouse.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6270d968fe252ddca8be2502f486d4f931f69192dad8ab14d37cdf455ec5414"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.sql(expression, \u0022rename_to\u0022) or this\u0060 appears character-identically in 2 files \u2014 sqlglot/generators/hive.py, sqlglot/generators/spark2.py. 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":"sqlglot/generators/hive.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a64b78c96aaf2bd4d876f1a53c869abaa5d0ddf758461cb960f5e05e0132f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seq_get(args, 1) or exp.Literal.string(\u0022,\u0022)\u0060 appears character-identically in 3 files \u2014 sqlglot/parsers/bigquery.py, sqlglot/parsers/hive.py, sqlglot/parsers/redshift.py. 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":"sqlglot/parsers/bigquery.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b1a1170c02e4e59d8ee704f134977e4ec9c3eef6f20d1698f7712f995513b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seq_get(args, 2) or exp.Literal.string(\u0022\u0022)\u0060 appears character-identically in 2 files \u2014 sqlglot/dialects/dialect.py, sqlglot/parsers/presto.py. 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":"sqlglot/dialects/dialect.py"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c4c56193154e810fa57f7312eb13397d7fe254ff04a1af8dec8f800e4b12fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unit.is_string and unit.name.upper() in (\u0022WEEK_OF_MONTH\u0022, \u0022WEEK_OF_YEAR\u0022)\u0060 appears character-identically in 2 files \u2014 sqlglot/generator.py, sqlglot/generators/bigquery.py. 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":"sqlglot/generator.py"},"region":{"startLine":6789}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c264ff885fb18f63a1058a24809bf4e2670c21c3a8252cc74bd8a4dc0b4ea2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060convert\u0060 is public and takes \u0060value: t.Any\u0060 from its caller, and it calls itself at line 2498 (\u0060convert\u0060) with a piece of \u0060value\u0060 (and at line 2502, line 2508, line 2509, line 2516) \u2014 and nowhere in \u0060convert\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060convert\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/core.py"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"654599be9847f7fe3c81533949ad472bede1a884202fcfe1f03253c35995f1ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/generators/duckdb.py"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b609e44a48786cb39db73b1d1997631cb3f11fe7aa9ee2bb121aa91dc419092"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/expressions/core.py"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0f95ac40cbbc0e6d08b56afdb63df75eb4b379cf8040fd202132408f9e397c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 342 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/lineage.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a15247eab0f08725cced26a8c61422ccf40e3cdf7b7194a35cc21dc38751db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 2368 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/parser.py"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c5f36345929d29fc1e390596894eaba0b8b0a1b0549cc6340b011ecbd84dc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 835 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/annotate_types.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c529d5d51b8ab583db7a750104689b8d39a84361b8b1e26d9f82e17ab03150"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 45 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/optimizer/normalize.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c78b1cd30695c7f8266ecee92eb6869504ecf552b2ebea7db0ff4f268586a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 1342 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/dialects/dialect.py"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc649cfd5bb28be0b55e1bfece652deb0cc04410b84cc7a8908f17824734896"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060dict_depth\u0060 returns \u00601\u0060 when \u0060StopIteration\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/helper.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"87258e5f92608247c52186ad577938b4f15c118ece601584185a263e9b5d07da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060subsecond_precision\u0060 returns \u00600\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlglot/time.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a003e8c9f95afacc5ffef3e3f6688fcad35805c10e1f2c2a2420da9142c8f82"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-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-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-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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-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-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":41,"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."]}]}