mirror of
https://github.com/postgres/postgres.git
synced 2026-02-16 00:57:52 -05:00
representation as the jointree) with two lists of RTEs, one showing the RTEs accessible by qualified names, and the other showing the RTEs accessible by unqualified names. I think this is conceptually simpler than what we did before, and it's sure a whole lot easier to search. This seems to eliminate the parse-time bottleneck for deeply nested JOIN structures that was exhibited by phil@vodafone. |
||
|---|---|---|
| .. | ||
| analyze.h | ||
| gramparse.h | ||
| keywords.h | ||
| parse_agg.h | ||
| parse_clause.h | ||
| parse_coerce.h | ||
| parse_expr.h | ||
| parse_func.h | ||
| parse_node.h | ||
| parse_oper.h | ||
| parse_relation.h | ||
| parse_target.h | ||
| parse_type.h | ||
| parser.h | ||
| parsetree.h | ||
| scansup.h | ||