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

static unsigned int hash( const char *key ) {
    unsigned int hash = 0;
    while ( *key ) {
        hash += *key++;
    }
    return hash % TABLE_SIZE;
}

Map *MapNew( void ) {
    Map *map = malloc( sizeof( Map ) );
    memset( map->table, 0, sizeof( map->table ) );
    return map;
}

void MapAdd( Map *map, const char *key, void *value ) {
    unsigned int index   = hash( key );
    MapKv       *newPair = malloc( sizeof( MapKv ) );
    newPair->key         = strdup( key );
    newPair->value       = value;
    newPair->next        = NULL;
    if ( map->table[ index ] == NULL ) {
        map->table[ index ] = newPair;
    } else {
        MapKv *current = map->table[ index ];
        while ( current->next != NULL ) {
            current = current->next;
        }
        current->next = newPair;
    }
}
void *MapMap( Map *map, const char *key ) {
    unsigned int index   = hash( key );
    MapKv       *current = map->table[ index ];
    while ( current != NULL ) {
        if ( strcmp( current->key, key ) == 0 ) {
            return current->value;
        }
        current = current->next;
    }
    return NULL; // Not found
}
void MapDel( Map *map, const char *key ) {
    unsigned int index   = hash( key );
    MapKv       *current = map->table[ index ];
    MapKv       *prev    = NULL;
    while ( current != NULL && strcmp( current->key, key ) != 0 ) {
        prev    = current;
        current = current->next;
    }
    if ( current == NULL ) {
        return; // Not found
    }
    if ( prev == NULL ) {
        map->table[ index ] = current->next;
    } else {
        prev->next = current->next;
    }
    free( current->key );
    free( current );
}
void MapFree( Map *map ) {
    for ( int i = 0; i < TABLE_SIZE; i++ ) {
        MapKv *current = map->table[ i ];
        while ( current != NULL ) {
            MapKv *toDelete = current;
            current         = current->next;
            free( toDelete->key );
            free( toDelete );
        }
    }
    free( map );
}

#if 0
int main() {

    int  a   = 42;
    int  b   = 84;
    int  c   = 126;
    Map *map = MapNew();
    memset( map->table, 0, sizeof( map->table ) );
    MapAdd( map, "key1", &a );
    MapAdd( map, "key2", &b );
    MapAdd( map, "key3", &c );

    int *ret = MapMap( map, "key1" );
    printf( "Value for 'key1': %d\n", *ret );
    ret = MapMap( map, "key2" );
    printf( "Value for 'key2': %d\n", *ret );
    ret = MapMap( map, "key3" );
    printf( "Value for 'key3': %d\n", *ret );

    MapDel( map, "key2" );
    ret = MapMap( map, "key2" );
    if ( ret != NULL ) {
        printf( "Value for 'key2' after deletion: %d\n", *ret );
    }
    MapFree( map );
    return 0;
}
#endif
#if 0
int main() {

    FILE    *fp1 = fopen( "a.txt", "a+" );
    FILE    *fp2 = fopen( "b.txt", "a+" );
    Map *map =MapNew();
    memset( map->table, 0, sizeof( map->table ) );
    MapAdd( map, "FileA", fp1 );
    MapAdd( map, "FileB", fp2 );

    FILE *ret = MapMap( map, "FileA" );
    fprintf( ret, "%d\n", 111 );
    fclose( ret );
    ret = MapMap( map, "FileB" );
    fprintf( ret, "%d\n", 222 );
    fclose( ret );

    MapFree( map );
    return 0;
}
#endif