Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4576a69 commit f5d54efCopy full SHA for f5d54ef
src/backend/utils/sort/tuplesort.c
@@ -2627,7 +2627,7 @@ mergeruns(Tuplesortstate *state)
2627
/*
2628
* If we produced only one initial run (quite likely if the total data
2629
* volume is between 1X and 2X workMem when replacement selection is used,
2630
- * but something we particular count on when input is presorted), we can
+ * but something we particularly count on when input is presorted), we can
2631
* just use that tape as the finished output, rather than doing a useless
2632
* merge. (This obvious optimization is not in Knuth's algorithm.)
2633
*/
0 commit comments