/*Source Code From Laure Gonnord, 2012*/
/*Adapted from Bernard Carre, 2011*/

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

/*List library : reminder, the word have maximal size  MAXSIZE*/
#include "listechaines.h"

/*Size of the hashtables */
#define TABLE_SIZE 308

/**Hash functions**/
int asciis(char *word)
{
    int i=0;
    int h=0;
    while(word[i]!='\0')
    {
        h=h+(word[i]-96);
        i++;
    }
    return h;
}

int hash(char *word)
{
    return (asciis(word) % TABLE_SIZE);
}

//TODO : write the following functions

/*Declaration of type Hashtable */
typedef Liste Hashtable[TABLE_SIZE];


/*Initialisation of a given Hashtable*/
void init_ht(Hashtable ht) {
    int i;
    for (i = 0; i < TABLE_SIZE; i++) {
        ht[i] = NULL;
    }
}

/*Update of the hashtable : add the given word in the table!*/
void update_ht(char *word, Hashtable ht) {
    ajout_alphab(&ht[hash(word)], word);
}

/*Load the file in the internal structure ht */
void load_ht(FILE *fp, Hashtable ht) {
    char mot[MAXSIZE];
    while (fscanf(fp, "%s", mot) != EOF) {
        update_ht(mot, ht);
    }
}

/*Count the collisions*/
void collisions(Hashtable ht) {
    int i;
    for (i = 0; i < TABLE_SIZE; i++) {
        /* printf("Indice %3d : %3d élément(s).\n", i, taille(ht[i])); */
        printf("%3d %3d\n", i, taille(ht[i]));
    }
}

/*Maximal hash of the words of the given file*/
/*returns max_word such that hash(max_word)=hmax*/
void max_hash(FILE *fp, char *max_word, int *hmax) {
    char mot[MAXSIZE];
    int h;
    *hmax = 0;
    while (fscanf(fp, "%s", mot) != EOF) {
        h = hash(mot);
        if (h > *hmax) {
            *hmax = h;
            strncpy(max_word, mot, MAXSIZE);
        }
    }
}

/*Main function*/
int main (int argc, char *argv[]) {
    if (argc < 2) { // text file is missing ?
        fprintf(stderr, "usage: hash <file_name>\n");
    } else {
        FILE *fp;
        fp=fopen(argv[1], "r");
        if (fp==NULL) {
            fprintf(stderr, "no such file, or unreachable: %s\n", argv[1]);
        } else {
            Hashtable myHt;
            init_ht(myHt);
            load_ht(fp, myHt);

            // Affichage des collisions
            collisions(myHt);

            // Affichage du hash maximum
            int hmax;
            char max_word[MAXSIZE];
            rewind(fp);
            max_hash(fp, max_word, &hmax);
            printf("Mot maximum : %s de somme %d\n", max_word, hmax);
        }
    }

    return 0;
}