/**
 * Azalea Chatting Server
 *
 * Copyright (C) 2013-2015 Rex Lee <[email protected]>
 *
 * This program is free and opensource software; 
 * you can redistribute it and/or modify
 * it under the terms of the GNU General Public License
 */

#include <stdio.h>
#include <stdlib.h>
// #include "dmalloc.h"

#ifndef _HASHTABLE_H_
#define _HASHTABLE_H_


#define HASH_TABLE_MAX_SIZE 10000

typedef struct HashNode HashNode;

struct HashNode
{
    char* sKey;
    void* nValue;
    HashNode* pNext;
} ;

typedef struct i_HashTable i_HashTable;

struct i_HashTable
{
	int ht_size;
	HashNode* table[HASH_TABLE_MAX_SIZE];
};

/**
 * @brief initial the hashtable
 * @details this function not alloc memory for HashTable pointer
 * 
 * @param HashTable the pointer of hashtable
 */
void ht_init(i_HashTable* hash_table);

/**
 * @brief insert key-value into hash table
 * @details [long description]
 * 
 * @param HashTable the hashtable
 * @param skey key
 * @param nvalue value
 */
void ht_insert(i_HashTable* hash_table, const char* skey, void* nvalue);

/**
 * @brief remove the hash node from hashtable
 * @details [long description]
 * 
 * @param HashTable the hashtable
 * @param skey the key of hashtable you'll remove
 */
void ht_remove(i_HashTable* hash_table, const char* skey);

/**
 * @brief [brief description]
 * @details [long description]
 * 
 * @param HashTable [description]
 * @param skey [description]
 * @return [description]
 */
HashNode* ht_lookup(i_HashTable* hash_table, const char* skey);

/**
 * @brief release the hashtable
 * @details [long description]
 * 
 * @param hash_table the hashtable
 */
void ht_release(i_HashTable* hash_table);

void ht_print(i_HashTable* hash_table);

#endif