mirrors/postgres
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Adjust out-of-date comment.

Browse Source
This commit is contained in:
Tom Lane 2005-05-16 00:19:04 +00:00
parent 2ef172a2a4
commit 7e94998c89
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/backend/utils/hash/dynahash.c
View File

@ -9,7 +9,7 @@
* *
* *
* IDENTIFICATION * 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]; segp = hashp->dir[segment_num];
/* /*
* Pick up the first item in this bucket's chain. If chain is * Pick up the first item in this bucket's chain. If chain is not empty
* not empty we can go back around the outer loop to search it. * we can begin searching it. Otherwise we have to advance to find the
* Otherwise we have to advance to find the next nonempty bucket. * next nonempty bucket. We try to optimize that case since searching a
* We try to optimize that case since searching a near-empty * near-empty hashtable has to iterate this loop a lot.
* hashtable has to iterate this loop a lot.
*/ */
while ((curElem = segp[segment_ndx]) == NULL) while ((curElem = segp[segment_ndx]) == NULL)
{ {