* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
tmp = elem;
elem = elem->next;
hash_insert (table, tmp->key, tmp->data, 1);
tmp = elem;
elem = elem->next;
hash_insert (table, tmp->key, tmp->data, 1);
void *hash_find_hash (const HASH * table, int hash, const char *key)
{
struct hash_elem *ptr = table->table[hash];
void *hash_find_hash (const HASH * table, int hash, const char *key)
{
struct hash_elem *ptr = table->table[hash];
-void hash_delete_hash (HASH * table, int hash, const char *key, const void *data,
- void (*destroy) (void *))
+void hash_delete_hash (HASH * table, int hash, const char *key,
+ const void *data, void (*destroy) (void *))
/* if `data' is given, look for a matching ->data member. this is
* required for the case where we have multiple entries with the same
* key
*/
/* if `data' is given, look for a matching ->data member. this is
* required for the case where we have multiple entries with the same
* key
*/
/* ptr pointer to the hash table to be freed
* destroy() function to call to free the ->data member (optional)
*/
/* ptr pointer to the hash table to be freed
* destroy() function to call to free the ->data member (optional)
*/