From: Tom Lane <tgl@sss.pgh.pa.us>
Date: Mon, 16 May 2005 00:19:04 +0000 (+0000)
Subject: Adjust out-of-date comment.
X-Git-Tag: REL8_1_0BETA1~792
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=7e94998c89699be1be5b3008b02e405b4003055c;p=postgresql

Adjust out-of-date comment.
---

diff --git a/src/backend/utils/hash/dynahash.c b/src/backend/utils/hash/dynahash.c
index 1ff3a9d142..85bd82244c 100644
--- a/src/backend/utils/hash/dynahash.c
+++ b/src/backend/utils/hash/dynahash.c
@@ -9,7 +9,7 @@
  *
  *
  * IDENTIFICATION
- *	  $PostgreSQL: pgsql/src/backend/utils/hash/dynahash.c,v 1.59 2005/05/06 00:19:14 tgl Exp $
+ *	  $PostgreSQL: pgsql/src/backend/utils/hash/dynahash.c,v 1.60 2005/05/16 00:19:04 tgl Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -747,11 +747,10 @@ hash_seq_search(HASH_SEQ_STATUS *status)
 	segp = hashp->dir[segment_num];
 
 	/*
-	 * Pick up the first item in this bucket's chain.  If chain is
-	 * not empty we can go back around the outer loop to search it.
-	 * Otherwise we have to advance to find the next nonempty bucket.
-	 * We try to optimize that case since searching a near-empty
-	 * hashtable has to iterate this loop a lot.
+	 * Pick up the first item in this bucket's chain.  If chain is not empty
+	 * we can begin searching it.  Otherwise we have to advance to find the
+	 * next nonempty bucket.  We try to optimize that case since searching a
+	 * near-empty hashtable has to iterate this loop a lot.
 	 */
 	while ((curElem = segp[segment_ndx]) == NULL)
 	{