|
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 | { |
|