Hash Table Interface SilcHashTable SilcHashTableList SilcHashFunction SilcHashCompare SilcHashDestructor SilcHashForeach silc_hash_table_alloc silc_hash_table_free silc_hash_table_size silc_hash_table_count silc_hash_table_add silc_hash_table_set silc_hash_table_del silc_hash_table_del_by_context silc_hash_table_find silc_hash_table_find_by_context silc_hash_table_find_foreach silc_hash_table_foreach silc_hash_table_rehash silc_hash_table_list silc_hash_table_list_reset silc_hash_table_get silc_hash_table_add_ext silc_hash_table_set_ext silc_hash_table_del_ext silc_hash_table_del_by_context_ext silc_hash_table_find_ext silc_hash_table_find_by_context_ext silc_hash_table_find_foreach_ext silc_hash_table_rehash_ext silc_hash_string silc_hash_string_case silc_hash_utf8_string silc_hash_uint silc_hash_ptr silc_hash_data silc_hash_string_compare silc_hash_string_case_compare silc_hash_utf8_compare silc_hash_data_compare silc_hash_destructor

silc_hash_table_find_foreach

SYNOPSIS

    void silc_hash_table_find_foreach(SilcHashTable ht, void *key,
                                      SilcHashForeach foreach,
                                      void *user_context);

DESCRIPTION

As the hash table is collision resistant it is possible to save duplicate keys to the hash table. This function can be used to find all keys and contexts from the hash table that are found using the `key'. The `foreach' is called for every found key. If no entries can be found the `foreach' will be called once with the context set NULL and `key' and `user_context' sent to the function.

NOTES

The hash table will not be rehashed during the traversing of the table, even if the table was marked as auto rehashable. The caller also must not call silc_hash_table_rehash while traversing the table.