Adjust out-of-date comment.

tglsfdc · tglsfdc · commit 7e94998c8969 · 2005-05-16T00:19:04.000Z
diff --git 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)
 	{

Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@`
`9`	`9`	`*`
`10`	`10`	`*`
`11`	`11`	`* IDENTIFICATION`
`12`		`- * $PostgreSQL: pgsql/src/backend/utils/hash/dynahash.c,v 1.59 2005/05/06 00:19:14 tgl Exp $`
	`12`	`+ * $PostgreSQL: pgsql/src/backend/utils/hash/dynahash.c,v 1.60 2005/05/16 00:19:04 tgl Exp $`
`13`	`13`	`*`
`14`	`14`	`*-------------------------------------------------------------------------`
`15`	`15`	`*/`
`@@ -747,11 +747,10 @@ hash_seq_search(HASH_SEQ_STATUS *status)`
`747`	`747`	`segp = hashp->dir[segment_num];`
`748`	`748`
`749`	`749`	`/*`
`750`		`- * Pick up the first item in this bucket's chain. If chain is`
`751`		`- * not empty we can go back around the outer loop to search it.`
`752`		`- * Otherwise we have to advance to find the next nonempty bucket.`
`753`		`- * We try to optimize that case since searching a near-empty`
`754`		`- * hashtable has to iterate this loop a lot.`
	`750`	`+ * Pick up the first item in this bucket's chain. If chain is not empty`
	`751`	`+ * we can begin searching it. Otherwise we have to advance to find the`
	`752`	`+ * next nonempty bucket. We try to optimize that case since searching a`
	`753`	`+ * near-empty hashtable has to iterate this loop a lot.`
`755`	`754`	`*/`
`756`	`755`	`while ((curElem = segp[segment_ndx]) == NULL)`
`757`	`756`	`{`