#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"hash.h"
Hash *CreateHash()
{
Hash *phash = (Hash*)malloc(sizeof(Hash));
if ( NULL == phash)
{
return phash;
}
memset(phash,0,sizeof(Hash));
return phash;
}
void Destroy(Hash *phash)
{
if ( NULL == phash )
{
return;
}
int i = 0;
HNode *pNode = NULL;
HNode *pTmp = NULL;
for ( i = 0 ; i <HASH_SIZE; i++ )
{
pNode = phash->table[i];
if ( NULL == pNode)
{
continue;
}
while ( NULL != pNode)
{
pTmp = pNode->pNext;
free(pNode);
pNode = pTmp;
}
}
free(phash);
phash = NULL;
pNode = NULL;
pTmp = NULL;
}
HNode* CreateNode(data_t data)
{
HNode*pNode = (HNode*)malloc(sizeof(HNode));
if ( NULL == pNode)
{
return pNode;
}
memset(pNode,0,sizeof(HNode));
pNode->data = data;
return pNode;
}
int InsertHash(Hash *phash,data_t tdata)
{
if ( NULL == phash )
{
return HASH_ERR;
}
int index = tdata.UserName[0] - 'a';
HNode *pNode = CreateNode(tdata);
pNode->pNext = phash->table[index];
phash->table[index] = pNode;
return HASH_OK;
}
int DeleteHash(Hash *phash,data_t pdata)
{
if ( NULL == phash )
{
return HASH_ERR;
}
int index = pdata.UserName[0] - 'a';
HNode *pNode = phash->table[index];
if ( NULL == pNode)
{
printf("not found\n");
return HASH_ERR;
}
if ( 0 == strcmp(pNode->data.UserName,pdata.UserName)
&& (0 == strcmp(pNode->data.UserPwd,pdata.UserPwd)))
{
phash->table[index] = pNode->pNext;
free(pNode);
pNode = NULL;
return HASH_OK;
}
else
{
while ( NULL != pNode->pNext)
{
HNode *pDel = pNode->pNext;
if ( 0 == strcmp(pDel->data.UserName,pdata.UserName)
&& (0 == strcmp(pDel->data.UserPwd,pdata.UserPwd)))
{
pNode->pNext = pDel->pNext;
free(pDel);
pDel = NULL;
return HASH_OK;
}
pNode = pNode->pNext;
}
}
printf("not found\n");
return HASH_ERR;
}
void ShowHash(Hash *phash)
{
if ( NULL == phash)
{
return;
}
HNode *pNode = NULL;
int i = 0;
for ( i = 0 ; i <HASH_SIZE ; i++ )
{
pNode = phash->table[i];
if ( NULL == pNode)
{
continue;
}
while ( NULL != pNode)
{
printf("%s %s\n",pNode->data.UserName,pNode->data.UserPwd);
pNode = pNode->pNext;
}
}
}
