@@ -2118,9 +2118,9 @@ create_agg_plan(PlannerInfo *root, AggPath *best_path)
2118
2118
/*
2119
2119
* Agg can project, so no need to be terribly picky about child tlist, but
2120
2120
* we do need grouping columns to be available. We are a bit more careful
2121
- * with hash aggregate, where we explicitly request small tlist to minimize
2122
- * I/O needed for spilling (we can't be sure spilling won't be necessary,
2123
- * so we just do it every time).
2121
+ * with hash aggregate, where we explicitly request small tlist to
2122
+ * minimize I/O needed for spilling (we can't be sure spilling won't be
2123
+ * necessary, so we just do it every time).
2124
2124
*/
2125
2125
flags = CP_LABEL_TLIST ;
2126
2126
@@ -2219,9 +2219,9 @@ create_groupingsets_plan(PlannerInfo *root, GroupingSetsPath *best_path)
2219
2219
/*
2220
2220
* Agg can project, so no need to be terribly picky about child tlist, but
2221
2221
* we do need grouping columns to be available. We are a bit more careful
2222
- * with hash aggregate, where we explicitly request small tlist to minimize
2223
- * I/O needed for spilling (we can't be sure spilling won't be necessary,
2224
- * so we just do it every time).
2222
+ * with hash aggregate, where we explicitly request small tlist to
2223
+ * minimize I/O needed for spilling (we can't be sure spilling won't be
2224
+ * necessary, so we just do it every time).
2225
2225
*/
2226
2226
flags = CP_LABEL_TLIST ;
2227
2227
0 commit comments