From a0a18dea24b6f4b749fed67f7c74649bcdbee199 Mon Sep 17 00:00:00 2001 From: Jim Meyering Date: Sat, 4 Nov 2000 21:38:55 +0000 Subject: [PATCH] (hash_get_next): Fix a thinko: when ENTRY is the last one in a bucket, advance to the next bucket. From Alexandre Duret-Lutz. --- lib/hash.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/lib/hash.c b/lib/hash.c index 02b327fc2b..8438143a87 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; -- 2.30.2