Tom Lane f1993038a4 Avoid making a separate pass over the query to check for partializability. ...

It's rather silly to make a separate pass over the tlist + HAVING qual,
and a separate set of visits to the syscache, when get_agg_clause_costs
already has all the required information in hand.  This nets out as less
code as well as fewer cycles.

2016-06-26 15:55:01 -04:00

..

clauses.h

Avoid making a separate pass over the query to check for partializability.

2016-06-26 15:55:01 -04:00

cost.h

Restore foreign-key-aware estimation of join relation sizes.

2016-06-18 15:22:34 -04:00

geqo_copy.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_gene.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_misc.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_mutation.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_pool.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_random.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_recombination.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo_selection.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

geqo.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

joininfo.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

orclauses.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

pathnode.h

Rethink node-level representation of partial-aggregation modes.

2016-06-26 14:33:38 -04:00

paths.h

Restore foreign-key-aware estimation of join relation sizes.

2016-06-18 15:22:34 -04:00

placeholder.h

Add an explicit representation of the output targetlist to Paths.

2016-02-18 20:02:03 -05:00

plancat.h

Directly modify foreign tables.

2016-03-18 13:55:52 -04:00

planmain.h

Rethink node-level representation of partial-aggregation modes.

2016-06-26 14:33:38 -04:00

planner.h

Rethink node-level representation of partial-aggregation modes.

2016-06-26 14:33:38 -04:00

predtest.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

prep.h

Make the upper part of the planner work by generating and comparing Paths.

2016-03-07 15:58:22 -05:00

restrictinfo.h

Update copyright for 2016

2016-01-02 13:33:40 -05:00

subselect.h

Make the upper part of the planner work by generating and comparing Paths.

2016-03-07 15:58:22 -05:00

tlist.h

Simplify planner's final setup of Aggrefs for partial aggregation.

2016-06-26 12:08:12 -04:00

var.h

Give pull_var_clause() reject/recurse/return behavior for WindowFuncs too.

2016-03-10 16:23:52 -05:00