From f5d54ef97abdd1df3d6bfe0320a565ecce742abe Mon Sep 17 00:00:00 2001 From: Alvaro Herrera Date: Tue, 8 Aug 2017 18:31:39 -0400 Subject: [PATCH] Fix typo in comment --- src/backend/utils/sort/tuplesort.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/backend/utils/sort/tuplesort.c b/src/backend/utils/sort/tuplesort.c index c152e43e687..59cd28e595f 100644 --- a/src/backend/utils/sort/tuplesort.c +++ b/src/backend/utils/sort/tuplesort.c @@ -2627,7 +2627,7 @@ mergeruns(Tuplesortstate *state) /* * If we produced only one initial run (quite likely if the total data * volume is between 1X and 2X workMem when replacement selection is used, - * but something we particular count on when input is presorted), we can + * but something we particularly count on when input is presorted), we can * just use that tape as the finished output, rather than doing a useless * merge. (This obvious optimization is not in Knuth's algorithm.) */