value stored for the entry. If the entry is not found in the hash
table, this does nothing and returns NULL. */
-PTR
+void *
hash_replace (struct hash_control *table, const char *key, void *value)
{
struct hash_entry *p;
/* Find an entry in a hash table, returning its value. Returns NULL
if the entry is not found. */
-PTR
+void *
hash_find (struct hash_control *table, const char *key)
{
struct hash_entry *p;
/* As hash_find, but KEY is of length LEN and is not guaranteed to be
NUL-terminated. */
-PTR
+void *
hash_find_n (struct hash_control *table, const char *key, size_t len)
{
struct hash_entry *p;
/* Delete an entry from a hash table. This returns the value stored
for that entry, or NULL if there is no such entry. */
-PTR
+void *
hash_delete (struct hash_control *table, const char *key, int freeme)
{
struct hash_entry *p;