#include "tree.h"

void cons_tree(struct node ** ptr_tree, wchar_t val)
{
  *ptr_tree = malloc(sizeof(struct node));
  (*ptr_tree)->val = val;
  (*ptr_tree)->fin = 0;
  (*ptr_tree)->nbr_fils=0;
  (*ptr_tree)->fils = malloc(sizeof(struct node*));
  (*ptr_tree)->fils[0]=NULL;
}

void mk_empty_tree(struct node **ptr_tree)
{
  *ptr_tree = NULL;
}

int is_leaf(struct node *tree)
{
  return tree->fin||tree->fils[0]==NULL;
}

void add(struct node **tab_ptr_tree, wchar_t val[],int taille, int fl)
{
  if(tab_ptr_tree[fl]==NULL)cons_tree(&(tab_ptr_tree[fl]),val[0]+97);
  Node* noeudtest = tab_ptr_tree[fl];
  for(int i = 1;i<taille;i++)
    {
      int trouve = -1;
      for(int j=0;j<noeudtest->nbr_fils;j++)
	{
	  if(noeudtest->fils[j]->val==val[i])trouve=j;
	}
      if(trouve==-1)
	{	  
	  //ajouter lettre
	   noeudtest->nbr_fils++;
	   noeudtest->fils = realloc(noeudtest->fils,(noeudtest->nbr_fils)*sizeof(struct node*));
	   cons_tree(&(noeudtest->fils[(noeudtest->nbr_fils)-1]),val[i]);
	   trouve = noeudtest->nbr_fils-1;
	}
      
      noeudtest = noeudtest->fils[trouve];//on jump au noeud suivant
    }
  noeudtest->fin = 1;

}

int size(wchar_t val[])
{
  int cpt = 0;
  while(val[cpt]!='\0')
    {
      cpt++;
    }
  return cpt;
}

void toLowerCase(wchar_t mot[])
{
  for(int i=0;i<size(mot);i++)
    {
      if(mot[i]<='Z' && mot[i]>='A')
	{
	  mot[i]+=32;
	}
    }
}

void splitcarac(struct node **tab_ptr_tree,wchar_t message[])
{
  if(message[0]<'a' || message[0]>'z')return;

  wchar_t *buffer;
  wchar_t *token = wcstok(message, L" ,?;.:/!*+\\\"()=«»", &buffer);
  add(tab_ptr_tree,token,size(token),(int)message[0]-97);
  if(buffer!=NULL)splitcarac(tab_ptr_tree,buffer);
}

void load_tree(FILE *fp, struct node **tab_ptr_tree)
{
  //fl (first letter)
  wchar_t val[50];
  
  while(fwscanf(fp, L"%ls",val)==1)
    {
      toLowerCase(val);
      splitcarac(tab_ptr_tree,val);
    }

    //On peut tester la bonne ou mauvaise terminaison de la lecture
    if(feof(fp))    printf("Fin normal de lecture\n");
    if(ferror(fp))  printf("ERREUR de lecture\n");
}

void free_tree(struct node *ptr_tree)
{
  if(ptr_tree==NULL)return;
  if(ptr_tree->nbr_fils==0){free(ptr_tree->fils);return;}
  for(int i=(ptr_tree->nbr_fils)-1;i>=0;i--)
  {
    free_tree(ptr_tree->fils[i]);
    free(ptr_tree->fils[i]);
  }
  free(ptr_tree->fils);
}

void free_dico(struct node **tab_ptr_tree)
{
  for(int i=0;i<26;i++)
  {
    if(tab_ptr_tree[i]!=NULL)
    {
      free_tree(tab_ptr_tree[i]);
      free(tab_ptr_tree[i]);
    }
  }
}

/*Recherche dans le dictionnaire*/
int find_mot(struct node **tab_ptr_tree,wchar_t mot[],int size,int fl)
{
    if(size==1 && tab_ptr_tree[fl]!=NULL)
    {
        if(tab_ptr_tree[fl]->fin==0)return 1;
        else return 0;//vrais
    }
    if(size==1 && tab_ptr_tree[fl]==NULL)return 1;//faux

    struct node *ptr_node = tab_ptr_tree[fl];
    for(int i=1;i<size;i++)
    {
        if(ptr_node->nbr_fils==0)return 1;
        for(int k=0;k<(ptr_node->nbr_fils);k++)
        {
            if(ptr_node->fils[k]->val==mot[i])
            {
                ptr_node=ptr_node->fils[k];
                break;
            }
	    else if(k+1==ptr_node->nbr_fils)return 1;
        }
    }

    if(ptr_node->fin==0)return 1;
    else return 0;
}

int find()
{
    return 0;
}