From 98b37437796bb5fedecf0d0c73cef4aa2ce9d192 Mon Sep 17 00:00:00 2001
From: Heikki Linnakangas <heikki.linnakangas@iki.fi>
Date: Wed, 22 Oct 2014 15:39:28 +0300
Subject: [PATCH] Update comment.
The _bt_tuplecompare() function mentioned in comment hasn't existed for a
long time.
Peter Geoghegan
---
src/backend/utils/sort/tuplesort.c | 5 ++---
1 file changed, 2 insertions(+), 3 deletions(-)
diff --git a/src/backend/utils/sort/tuplesort.c b/src/backend/utils/sort/tuplesort.c
index 8e57505eddc..2d15da0bfa7 100644
--- a/src/backend/utils/sort/tuplesort.c
+++ b/src/backend/utils/sort/tuplesort.c
@@ -3176,9 +3176,8 @@ comparetup_index_btree(const SortTuple *a, const SortTuple *b,
Tuplesortstate *state)
{
/*
- * This is similar to _bt_tuplecompare(), but we have already done the
- * index_getattr calls for the first column, and we need to keep track of
- * whether any null fields are present. Also see the special treatment
+ * This is similar to comparetup_heap(), but expects index tuples. There
+ * is also special handling for enforcing uniqueness, and special treatment
* for equal keys at the end.
*/
ScanKey scanKey = state->indexScanKey;
--
GitLab