document.open();document.writeln('
');document.writeln('
#include <stdio.h>');document.writeln('#include <string.h>');document.writeln('#include <stdlib.h>');document.writeln('#include <math.h>');document.writeln('');document.writeln('typedef struct hash_node_s');document.writeln('{');document.writeln('    void* key;');document.writeln('    void* data;');document.writeln('    struct hash_node_s *next;');document.writeln('} hash_node_t;');document.writeln('');document.writeln('typedef struct ');document.writeln('{');document.writeln('    hash_node_t *list;');document.writeln('    short count;');document.writeln('} hash_data_t;');document.writeln('');document.writeln('typedef struct');document.writeln('{');document.writeln('    hash_data_t *table;');document.writeln('    int max_colitions;');document.writeln('    int size;');document.writeln('    int used;');document.writeln('    unsigned int (*hash_f)(void *k);');document.writeln('    int (*compare)(const void* a, const void* b); ');document.writeln('    void (*destroy_key)(void* a);');document.writeln('    void (*destroy_data)(void* a);');document.writeln('} hash_table_t;');document.writeln('');document.writeln('hash_table_t *hash_create(unsigned int (hash_f)(void *k),');document.writeln('                            int (*Compare)(const void* a, const void* b),');document.writeln('                            void (*DestroyKey)(void* a),');document.writeln('                            void (*DestroyInfo)(void* a),');document.writeln('                            int initial_size);');document.writeln('');document.writeln('hash_node_t *hash_insert(hash_table_t *table, void *key, void *data);');document.writeln('void hash_delete(hash_table_t *table, void *key);');document.writeln('hash_node_t *hash_find_node(hash_table_t *table, void *key);');document.writeln('void *hash_find_data(hash_table_t *table, void *key);');document.writeln('void hash_destroy(hash_table_t *table);');document.writeln('void hash_rebuild(hash_table_t *table, int new_size);');document.writeln('');document.writeln('');document.writeln('hash_table_t *hash_create(unsigned int (*hash_f)(void *k),');document.writeln('                            int (*compare)(const void* a, const void* b),');document.writeln('                            void (*destroy_key)(void* a),');document.writeln('                            void (*destroy_data)(void* a),');document.writeln('                            int initial_size)');document.writeln('{');document.writeln('    hash_table_t *hash_table;');document.writeln('');document.writeln('    if( (hash_table = (hash_table_t *)malloc(sizeof(hash_table_t))) == NULL)');document.writeln('        return NULL;');document.writeln('');document.writeln('    memset(hash_table, 0, sizeof(hash_table));');document.writeln('');document.writeln('    hash_table->max_colitions = 0;');document.writeln('    hash_table->size = initial_size;');document.writeln('    hash_table->used = 0;');document.writeln('    hash_table->hash_f = hash_f;');document.writeln('    hash_table->compare = compare;');document.writeln('    hash_table->destroy_key = destroy_key;');document.writeln('    hash_table->destroy_data = destroy_data;');document.writeln('');document.writeln('    hash_table->table = (hash_data_t *)malloc(sizeof(hash_data_t)*initial_size);');document.writeln('');document.writeln('    memset(hash_table->table, 0, sizeof(hash_data_t)*initial_size);');document.writeln('');document.writeln('    return hash_table;');document.writeln('}');document.writeln('');document.writeln('hash_node_t *hash_insert(hash_table_t *table, void *key, void *data)');document.writeln('{');document.writeln('    unsigned int num_key;');document.writeln('    hash_node_t *node;');document.writeln('');document.writeln('    num_key = table->hash_f(key) % table->size;');document.writeln('    ');document.writeln('    node = (hash_node_t *)malloc(sizeof(hash_node_t));');document.writeln('');document.writeln('');document.writeln('    node->key = key;');document.writeln('    node->next = table->table[num_key].list;');document.writeln('    node->data = data;');document.writeln('');document.writeln('    table->table[num_key].list = node;');document.writeln('    table->table[num_key].count++;');document.writeln('    ');document.writeln('    if(table->max_colitions < table->table[num_key].count)');document.writeln('        table->max_colitions = table->table[num_key].count;');document.writeln('    ');document.writeln('    return node;');document.writeln('}');document.writeln('');document.writeln('void *hash_find_data(hash_table_t *table, void *key)');document.writeln('{');document.writeln('    hash_node_t *node;');document.writeln('');document.writeln('    node = hash_find_node(table, key);');document.writeln('');document.writeln('    if(node == NULL)');document.writeln('        return NULL;');document.writeln('');document.writeln('    return node->data;');document.writeln('}');document.writeln('');document.writeln('hash_node_t *hash_find_node(hash_table_t *table, void *key)');document.writeln('{');document.writeln('    unsigned int num_key;');document.writeln('    hash_node_t *node;');document.writeln('');document.writeln('    num_key = table->hash_f(key) % table->size;');document.writeln('');document.writeln('    for(node = table->table[num_key].list;');document.writeln('            node != NULL && table->compare(node->key, key) != 0;');document.writeln('            node = node->next);');document.writeln('');document.writeln('    return node;');document.writeln('}');document.writeln('');document.writeln('void hash_rebuild(hash_table_t *table, int new_size)');document.writeln('{');document.writeln('    hash_data_t *new_table;');document.writeln('    hash_node_t *node;');document.writeln('    hash_node_t *node_next;');document.writeln('    hash_data_t *old_table;');document.writeln('    int old_size;');document.writeln('    int i;');document.writeln('');document.writeln('    new_table = (hash_data_t *)malloc(sizeof(hash_data_t) * new_size);');document.writeln('');document.writeln('    memset(new_table, 0, sizeof(hash_data_t) * new_size);');document.writeln('');document.writeln('    old_table = table->table;');document.writeln('    old_size = table->size;');document.writeln('    table->table = new_table;');document.writeln('    table->size = new_size;');document.writeln('    table->max_colitions = 0;');document.writeln('');document.writeln('    for(i=0; i<old_size; i++)');document.writeln('    {');document.writeln('        node = old_table[i].list;');document.writeln('        while(node != NULL)');document.writeln('        {');document.writeln('            hash_insert(table, node->key, node->data);');document.writeln('            node_next = node->next;');document.writeln('            free(node);');document.writeln('            node = node_next;');document.writeln('        }');document.writeln('    }');document.writeln('');document.writeln('    free(old_table);');document.writeln('}');document.writeln('');document.writeln('void hash_delete(hash_table_t *table, void *key)');document.writeln('{');document.writeln('    unsigned int num_key;');document.writeln('    hash_node_t *node;');document.writeln('    hash_node_t *prev_node;');document.writeln('');document.writeln('    num_key = table->hash_f(key) % table->size;');document.writeln('');document.writeln('    for(prev_node = node = table->table[num_key].list;');document.writeln('            node != NULL && table->compare(node->key, key) != 0;');document.writeln('            prev_node = node, node = node->next);');document.writeln('    ');document.writeln('    if(node == NULL)');document.writeln('    {');document.writeln('        return;');document.writeln('    }');document.writeln('    else if(prev_node == node)');document.writeln('    {');document.writeln('        table->table[num_key].list = node->next;');document.writeln('    }');document.writeln('    else');document.writeln('    {');document.writeln('        prev_node->next = node->next;');document.writeln('    }');document.writeln('');document.writeln('    table->destroy_key(node->key);');document.writeln('    table->destroy_data(node->data);');document.writeln('    free(node);');document.writeln('');document.writeln('}');document.writeln('');document.writeln('void hash_destroy(hash_table_t *table)');document.writeln('{');document.writeln('    hash_node_t *node;');document.writeln('    hash_node_t *next_node;');document.writeln('    int i;');document.writeln('');document.writeln('    for(i=0; i<table->size; i++)');document.writeln('    {');document.writeln('        node = table->table[i].list;');document.writeln('        ');document.writeln('        while(node != NULL)');document.writeln('        {');document.writeln('            next_node = node->next;');document.writeln('            table->destroy_key(node->key);');document.writeln('            table->destroy_data(node->data);');document.writeln('            free(node);');document.writeln('            node = next_node;');document.writeln('        }');document.writeln('    }');document.writeln('');document.writeln('    free(table->table);');document.writeln('    free(table);');document.writeln('}');document.writeln('
');document.writeln('');document.writeln('');document.writeln('
');document.close();