First Commit

Author: hrozan

Bibliotecas/List

@@ -0,0 +1,143 @@
+# include <stdio.h>
+# include <stdlib.h>
+
+typedef struct List{
+
+short int num;
+struct List *next;
+
+}List;
+
+typedef struct CodeList{
+
+short int* word;
+struct CodeList *next;
+
+}CodeList;
+
+typedef struct Code{
+
+CodeList* code;
+int order;
+double numWord;
+int distMin;
+
+}Code;
+
+
+CodeList* addListCode(CodeList* l, short int word[]){
+if(l == NULL){
+CodeList* newnode = (CodeList*)malloc(sizeof(CodeList));
+
+newnode->word = word;
+newnode->next = NULL;
+
+return newnode;
+}
+
+l->next = addListCode(l->next,word);
+
+return l;
+}
+
+List* addListWord(List* l, short int num){
+if(l == NULL){
+List* newnode = (List*)malloc(sizeof(List));
+
+newnode->num = num;
+newnode->next = NULL;
+
+return newnode;
+}
+
+l->next = addListWord(l->next,num);
+
+return l;
+}
+
+void rmvLastWord(Code* c){
+CodeList* aux = c->code;
+CodeList* aux_ant = NULL;
+
+
+while(aux->next!=NULL){ // caminha ate o final da lista;
+aux_ant = aux;
+aux = aux->next;
+}
+
+if(aux_ant != NULL){ // nao eh o primeiro
+aux_ant->next = NULL;
+free(aux);
+}
+
+else{ // eh o primeiro 
+free(aux);
+c->code = NULL;
+}
+}
+
+
+
+
+void printList(List* l){
+if(l != NULL){
+printf("[%u]",l->num );
+printList(l->next);
+}
+}
+
+double countNode(CodeList* l){
+if(l != NULL)
+return 1 + countNode(l->next);
+else
+return 0;
+}
+
+void convertListtoArray(List* l, short int array[], int i){
+if(l != NULL){
+
+array[i] = l->num;
+convertListtoArray(l->next,array,i+1);
+
+}
+}
+
+
+
+
+List* freeList(List* l){
+if(l != NULL){
+List* aux;
+
+while(l->next != NULL){
+aux = l->next;
+free(l);
+l = aux;
+
+}
+
+return NULL;
+
+}
+
+}
+
+CodeList* freeCodeList(CodeList* l){
+if(l != NULL){
+CodeList* aux;
+
+while(l->next != NULL){
+aux = l->next;
+free(l);
+l = aux;
+
+}
+
+return NULL;
+
+}
+
+}
+
+
+

Bibliotecas/List.h

@@ -0,0 +1,129 @@
+# include <stdlib.h>
+# include <stdlib.h>
+# include <time.h>
+
+
+void addRandomWord(Code* c, int numWord){
+
+int o = c->order;
+CodeList *code = c->code;
+short int* newWord = NULL;
+int i,t,aux,dist = 0;
+
+srand((unsigned)time(NULL)); //alimenta a semente
+
+
+
+for (t= 0; t <numWord; t++){
+
+newWord = (short int*)calloc(o,sizeof(short int));
+
+aux = 1;
+
+while(aux){
+
+aux = 0;
+
+for(i=0; i<o; i++)//cria palavra randomica
+newWord[i] = (rand()%2);
+
+
+while(code != NULL){
+
+for(i=0; i<o; i++) //calcula a distancia da palavra com o enésima do codico
+dist += (code->word[i] + newWord[i])%2;
+
+if(dist == 0 ){ // se a distancia for 0 significa q ela esta repetida
+aux = 1; // executa o laço novamente
+code = c->code;// volta ao inicio do codigo
+dist = 0;
+break;
+}
+dist = 0;
+
+code = code->next; 
+}
+}
+
+c->code = addListCode(c->code,newWord); // adiciona palavra ao codigo;
+c->numWord++;
+
+
+
+}
+
+calcDistMin(c); // calcula nova distancia minima
+
+}
+
+Code* startCode(int order){
+
+Code* c = (Code*)malloc(sizeof(Code));
+
+c->code = NULL;
+c->order = order;
+c->numWord = 0;
+c->distMin = -1;
+
+return c;
+}
+
+void makeCodeDistMinLimited(Code* c, int distMin, int min){
+int boolean,i;
+
+
+
+boolean = 1;
+
+while(boolean){
+ 
+addRandomWord(c,1);
+
+if(c->distMin < distMin){
+rmvLastWord(c);
+c->numWord--;
+boolean = 0;
+}
+
+
+calcDistMin(c);
+
+}
+
+}
+
+void shift(int* w, int n, int x){
+int last;
+int i,t;
+
+for (t = 0; t < x; t++){
+
+last = w[n-1];
+
+for (i = n-1; i > 0 ; i--)
+w[i] = w[i-1];
+
+w[0] = last;
+}
+
+
+}
+
+long int pow2(int n){
+if(n != 0)
+return 2*pow2(n-1);
+else
+return 1;
+
+}
+
+long int binaryToDec(int* word, int n){
+long int num = 0;
+int i;
+n--;
+
+for (i = 0; i < n; i++)
+num += word[i]*pow2(i);
+
+return num;
+}

Bibliotecas/addword_codelib.h

@@ -0,0 +1,64 @@
+/* Biblioteca com funçoes de calculo de distancia de Hamming*/
+# include <stdio.h>
+# include <stdlib.h>
+
+
+/*
+void calcDistMin(Code* code){
+
+int dist = 0 ,distMin = code->order;
+int i;
+CodeList* w1 = code->code;
+CodeList* w2 = code->code;
+
+while(w1 != NULL){
+while(w2 != NULL){
+
+for (i = 0; i < code->order; i++)
+dist += (w1->word[i] + w2->word[i])%2;
+
+if(dist < distMin && dist != 0)
+distMin = dist;
+
+dist = 0;
+w2 = w2->next;
+}
+w2 = code->code;
+w1 = w1->next;
+}
+
+
+code->distMin = distMin;
+
+
+}
+*/
+
+
+void calcDistMin(Code* code){
+
+int dist = 0 ,distMin = code->order;
+int i;
+CodeList* w1 = code->code;
+CodeList* w2 = code->code->next;
+
+while(w1 != NULL){
+while(w2 != NULL){
+
+for (i = 0; i < code->order; i++)
+dist += (w1->word[i] + w2->word[i])%2;
+
+distMin = (dist < distMin && dist != 0)?dist:distMin;
+
+dist = 0;
+w2 = w2->next;
+}
+w2 = w1->next;
+w1 = w1->next;
+}
+
+
+code->distMin = distMin;
+
+
+}