Fix minor typo in nodeIncrementalSort.c.

Author: Vignesh C
Reviewed-by: James Coleman
Backpatch-through: 13, where it was introduced
Discussion: https://postgr.es/m/CALDaNm0WjZqRvdeL59ZfYH0o4mLbKQ23jm-bnjXcFzgpANx55g@mail.gmail.com
This commit is contained in:
Amit Kapila 2020-07-20 07:54:04 +05:30
parent 914d2383ae
commit 4a1ae21750

View File

@ -65,8 +65,8 @@
* into the second mode if we believe it's beneficial. * into the second mode if we believe it's beneficial.
* *
* Sorting incrementally can potentially use less memory, avoid fetching * Sorting incrementally can potentially use less memory, avoid fetching
* and sorting all tuples in the the dataset, and begin returning tuples * and sorting all tuples in the dataset, and begin returning tuples before
* before the entire result set is available. * the entire result set is available.
* *
* The hybrid mode approach allows us to optimize for both very small * 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 * groups (where the overhead of a new tuplesort is high) and very large