Fix minor typo in nodeIncrementalSort.c.

Amit Kapila · Amit Kapila · commit 044dc7b96414 · 2020-07-20T07:45:26.000+05:30
Author: Vignesh C Reviewed-by: James Coleman Backpatch-through: 13, where it was introduced Discussion: https://postgr.es/m/CALDaNm0WjZqRvdeL59ZfYH0o4mLbKQ23jm-bnjXcFzgpANx55g@mail.gmail.com
diff --git a/src/backend/executor/nodeIncrementalSort.c b/src/backend/executor/nodeIncrementalSort.c
@@ -65,8 +65,8 @@
  *	into the second mode if we believe it's beneficial.
  *
  *	Sorting incrementally can potentially use less memory, avoid fetching
- *	and sorting all tuples in the the dataset, and begin returning tuples
- *	before the entire result set is available.
+ *	and sorting all tuples in the dataset, and begin returning tuples before
+ *	the entire result set is available.
  *
  *	The hybrid mode approach allows us to optimize for both very small
  *	groups (where the overhead of a new tuplesort is high) and very	large

Original file line number	Diff line number	Diff line change
`@@ -65,8 +65,8 @@`
`65`	`65`	`* into the second mode if we believe it's beneficial.`
`66`	`66`	`*`
`67`	`67`	`* Sorting incrementally can potentially use less memory, avoid fetching`
`68`		`- * and sorting all tuples in the the dataset, and begin returning tuples`
`69`		`- * before the entire result set is available.`
	`68`	`+ * and sorting all tuples in the dataset, and begin returning tuples before`
	`69`	`+ * the entire result set is available.`
`70`	`70`	`*`
`71`	`71`	`* The hybrid mode approach allows us to optimize for both very small`
`72`	`72`	`* groups (where the overhead of a new tuplesort is high) and very large`