aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorPeter Geoghegan <pg@bowt.ie>2018-12-18 21:40:38 -0800
committerPeter Geoghegan <pg@bowt.ie>2018-12-18 21:40:38 -0800
commit61a4480a68ea44d0991d983a985ae2b2cd88cd61 (patch)
treebc8950be17b6f160853f54e5f157a30fa22ea263
parent60f3cc9553c7ea7a1cc61bcd1efe51537f31e531 (diff)
downloadpostgresql-61a4480a68ea44d0991d983a985ae2b2cd88cd61.tar.gz
postgresql-61a4480a68ea44d0991d983a985ae2b2cd88cd61.zip
Remove obsolete nbtree duplicate entries comment.
Remove a comment from the Berkeley days claiming that nbtree must disambiguate duplicate keys within _bt_moveright(). There is no special care taken around duplicates within _bt_moveright(), at least since commit 9e85183bfc3 removed inscrutable _bt_moveright() code to handle pages full of duplicates.
-rw-r--r--src/backend/access/nbtree/nbtinsert.c5
1 files changed, 1 insertions, 4 deletions
diff --git a/src/backend/access/nbtree/nbtinsert.c b/src/backend/access/nbtree/nbtinsert.c
index 80437cc8316..a5915a5ff53 100644
--- a/src/backend/access/nbtree/nbtinsert.c
+++ b/src/backend/access/nbtree/nbtinsert.c
@@ -814,10 +814,7 @@ _bt_findinsertloc(Relation rel,
* INCOMPLETE_SPLIT flag on it, and release the buffer.
*
* The locking interactions in this code are critical. You should
- * grok Lehman and Yao's paper before making any changes. In addition,
- * you need to understand how we disambiguate duplicate keys in this
- * implementation, in order to be able to find our location using
- * L&Y "move right" operations.
+ * grok Lehman and Yao's paper before making any changes.
*----------
*/
static void