From f1f5ec1efafe74ca45e24e0bf3371b1d6985c8ee Mon Sep 17 00:00:00 2001 From: Robert Haas Date: Wed, 17 Feb 2016 15:40:00 +0530 Subject: Reuse abbreviated keys in ordered [set] aggregates. When processing ordered aggregates following a sort that could make use of the abbreviated key optimization, only call the equality operator to compare successive pairs of tuples when their abbreviated keys were not equal. Peter Geoghegan, reviewd by Andreas Karlsson and by me. --- src/backend/executor/nodeSort.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/backend/executor/nodeSort.c') diff --git a/src/backend/executor/nodeSort.c b/src/backend/executor/nodeSort.c index 102dbdfc124..a34dcc51358 100644 --- a/src/backend/executor/nodeSort.c +++ b/src/backend/executor/nodeSort.c @@ -137,7 +137,7 @@ ExecSort(SortState *node) slot = node->ss.ps.ps_ResultTupleSlot; (void) tuplesort_gettupleslot(tuplesortstate, ScanDirectionIsForward(dir), - slot); + slot, NULL); return slot; } -- cgit v1.2.3