@@ -5390,9 +5390,9 @@ make_sort(Plan *lefttree, int numCols,
53905390 * prepare_sort_from_pathkeys
53915391 * Prepare to sort according to given pathkeys
53925392 *
5393- * This is used to set up forboth SortMergeAppend nodes. It calculates
5394- * the executor's representation of the sort key information, and adjusts the
5395- * plan targetlist if needed to add resjunk sort columns.
5393+ * This is used to set up for Sort, MergeAppend, andGather Merge nodes. It
5394+ *calculates the executor's representation of the sort key information, and
5395+ *adjusts the plan targetlist if needed to add resjunk sort columns.
53965396 *
53975397 * Input parameters:
53985398 * 'lefttree' is the plan node which yields input tuples
@@ -5416,7 +5416,7 @@ make_sort(Plan *lefttree, int numCols,
54165416 *
54175417 * If the pathkeys include expressions that aren't simple Vars, we will
54185418 * usually need to add resjunk items to the input plan's targetlist to
5419- * compute these expressions, sincethe Sort/ MergeAppend node itself won't
5419+ * compute these expressions, sincea Sort or MergeAppend node itself won't
54205420 * do any such calculations. If the input plan type isn't one that can do
54215421 * projections, this means adding a Result node just to do the projection.
54225422 * However, the caller can pass adjust_tlist_in_place = TRUE to force the