diff options
| author | Jim Meyering <jim@meyering.net> | 2000-11-04 21:38:55 +0000 |
|---|---|---|
| committer | Jim Meyering <jim@meyering.net> | 2000-11-04 21:38:55 +0000 |
| commit | a5565c08a385d83e87ec5842d74c94648c6b839c (patch) | |
| tree | 4d37d30dc4a8e14fa80db2e570cd1083ad154a58 /lib/hash.c | |
| parent | b510774dbb01d6e1b2596d5f6df570c88685320a (diff) | |
| download | coreutils-a5565c08a385d83e87ec5842d74c94648c6b839c.tar.xz | |
(hash_get_next): Fix a thinko: when ENTRY is the
last one in a bucket, advance to the next bucket.
From Alexandre Duret-Lutz.
Diffstat (limited to 'lib/hash.c')
| -rw-r--r-- | lib/hash.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/hash.c b/lib/hash.c index 02b327fc2..8438143a8 100644 --- a/lib/hash.c +++ b/lib/hash.c @@ -267,7 +267,7 @@ hash_get_first (const Hash_table *table) /* Return the user data for the entry following ENTRY, where ENTRY has been returned by a previous call to either `hash_get_first' or `hash_get_next'. - Return NULL if there is no more entries. */ + Return NULL if there are no more entries. */ void * hash_get_next (const Hash_table *table, const void *entry) @@ -284,7 +284,7 @@ hash_get_next (const Hash_table *table, const void *entry) return cursor->next->data; /* Find first entry in any subsequent bucket. */ - for (; bucket < table->bucket_limit; bucket++) + while (++bucket < table->bucket_limit) if (bucket->data) return bucket->data; |