hashmap.h

#ifndef __LIBDS_HASHMAP_H__
#define __LIBDS_HASHMAP_H__

/* A C implementation of a Hash Map. 
   Uses string keys but has void pointer values */

#include <stdlib.h>
#include "vector.h"

#define DEFAULT_NUM_BUCKETS 101

struct item{
	char* key;
	void* val;
	struct item * next;
};

typedef struct item item_t;

struct hashmap{
	item_t** buckets;
	vector_p keys;
	void (*destructor)(void*);
	size_t size;
	size_t num_buckets;
};

typedef struct hashmap * hashmap_p;

/* Create a new hashmap. The hashmap created by this method must be eventually 
   destroyed by a call to destroy_hashmap() to avoid memory leak */
hashmap_p create_hashmap();

/* Place an entry with the value val and length len into the hashmap m and associate
   it with the key key. The key and value are copied by value, not by pointer,
   so if they were created on the heap, they must be freed later. */
void hashmap_put(hashmap_p m, char* key, void* val, size_t len);

/* Get the value of the entry in hashmap m associated with key key */
void* hashmap_get(hashmap_p m, char* key);

/* Remove the item associated with the key key in the hashmap m. The memory for the
   entry is completely freed, so use hashmap_get and make a deep copy if you wish to
   retain it. */
void hashmap_remove(hashmap_p m, char* key);

/* Hash function for the key key. This function is not meant to be called directly */
size_t hash_func(char * key);

/* Free all of the memory associated with hashmap m */
void destroy_hashmap(hashmap_p m);

void hashmap_resize(hashmap_p m, size_t num_buckets);

#endif