rem: struct hash_entry *bucket
add: struct hash_entry const *bucket
context: hash_get_next (const Hash_table *table, const void *entry){  struct hash_entry *bucket    = table->bucket + table->hasher (entry, table->n_buckets);  struct hash_entry *cursor;  assert (bucket < table->bucket_limit);  /* Find next entry in the same bucket.  */  for (cursor = bucket; cursor; cursor = cursor->next)    if (cursor->data == entry && cursor->next)      return cursor->next->data;  /* Find first entry in any subsequent bucket.  */  while (++bucket < table->bucket_limit)    if (bucket->data)      return bucket->data;  /* None found.  */  return NULL;}