shithub: rott

ref: 3e27f1b2d0d8f020e9d3509934736ee9055b8c31
dir: /src/HashTable.c/

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "HashTable.h"


#if !defined(ARRAY_SIZE)
    #define ARRAY_SIZE(x) (sizeof((x)) / sizeof((x)[0]))
#endif

void InitHashTable(HashTable * hashTable, int initSize)
{
    hashTable->totalSize = initSize;
    
    hashTable->table = calloc(sizeof(listNode), initSize);
    
    listNode * emptyNode = malloc(sizeof(listNode));
    
    emptyNode->isAvaliable = 1;
    
    emptyNode->key = -1;
    emptyNode->data = -1;
    
    int x;
    
    for(x = 0; x < initSize; x++)
    {
        listNode * node = malloc(sizeof(listNode));
        
        memcpy(node, emptyNode, sizeof(&emptyNode));
        
        hashTable->table[x] = node;

    }
    
}

int HashFunc(HashTable * hashTable, int key)
{
    return abs((key)) % hashTable->totalSize;
}

void Delete(HashTable * hashTable, int key)
{   
    int index = HashFunc(hashTable,key);
    
    while(hashTable->table[index]->key != key) 
    {
      //go to next cell
        ++index;
		
      //wrap around the table
        index %= hashTable->totalSize;
    }
    
    //LinkedList * list = hashTable->table[index];
    
    //DeleteWithKey(list, key);
    //free(&hashTable->table[index]);
    hashTable->table[index]->isAvaliable = 1;
    
}

void ClearHashTable (HashTable * hashTable)
{ 
    int x = 0;
    for (x = 0; x < ARRAY_SIZE(hashTable->table); x++)
    {
        if (hashTable->table[x] != NULL)
        {
            //DestroyList(hashTable->table[x]);
            free(hashTable->table[x]);
        }
        
    }
    free(hashTable->table);
}

void Insert(HashTable * hashTable, int key, int item)
{
    int index = HashFunc(hashTable,key);
    
    
    while(hashTable->table[index]->isAvaliable == 0) 
    {
      //go to next cell
        ++index;
		
      //wrap around the table
        index %= hashTable->totalSize;
    }
    
    //listNode * newNode = malloc(sizeof(listNode));
    
    hashTable->table[index]->data = item;
    hashTable->table[index]->key = key;
    hashTable->table[index]->isAvaliable = 0;
    
}

int Lookup(HashTable * hashTable, int key)
{
    int index = HashFunc(hashTable,key);
    
    int origIndex = index;
    
    while(hashTable->table[index]->key != key && hashTable->table[index]->isAvaliable == 0)
    {
      //go to next cell
        ++index;
		
      //wrap around the table
        index %= hashTable->totalSize;
        
        if (index == origIndex)
        {
            return 0;
        }
        
    }
    
    return hashTable->table[index]->data;
}