Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- switch(buffer[0]){
- case 'L':
- printf("%s \n",buffer);
- stringa =malloc(100*sizeof(*stringa));
- for(i=2;buffer[i]!='\0';i++)
- stringa[i-2]=buffer[i];
- stringa[i-2]='\0';
- printf("%s\n",stringa);
- file=fopen(stringa, "r");
- if(file==NULL){
- free(stringa);
- stringa=NULL;
- free(buffer);
- buffer=NULL;
- printf("%s non trovato \n", stringa);
- }
- else{
- if(tree!=NULL)
- rbdestroy(tree);
- tree=createrbtree();
- file =fopen(stringa, "r");
- free(buffer);
- buffer=NULL;
- free(stringa);
- stringa=NULL;
- buffer=malloc(sizeof(*buffer)*100);
- while(fgets(buffer, 100, file)!= NULL){
- stringa =malloc(sizeof(*stringa)*50);
- for(i=0;buffer[i]!=' ';i++){
- stringa[i]=buffer[i];
- }
- stringa[i] = '\0';
- n=stringa;
- printf("%s\n",n);
- free(stringa);
- stringa=NULL;
- stringa = malloc(sizeof(*stringa)*4);
- z=0;
- for(i = i+1;buffer[i]!=':';i++){
- stringa[z]=buffer[i];
- z++;
- }
- stringa[z] = '\0';
- h = atoi(stringa);
- printf("%d\n",h);
- free(stringa);
- stringa=NULL;
- stringa = malloc(sizeof(*stringa)*4);
- z=0;
- for(i = i+1;buffer[i]!=' ';i++){
- stringa[z]=buffer[i];
- z++;
- }
- stringa[z] = '\0';
- //printf("%s\n",stringa);
- m = atoi(stringa);
- printf("%d\n",m);
- free(stringa);
- stringa=NULL;
- a = createorario(h,m);
- stringa = malloc(sizeof(*stringa)*4);
- z=0;
- for(i = i+1;buffer[i]!=':';i++){
- stringa[z]=buffer[i];
- z++;
- }
- stringa[z] = '\0';
- h = atoi(stringa);
- printf("%d\n",h);
- free(stringa);
- stringa=NULL;
- stringa = malloc(sizeof(*stringa)*4);
- z=0;
- for(i = i+1;buffer[i]!='\0';i++){
- stringa[z]=buffer[i];
- z++;
- }
- stringa[z] = '\0';
- m = atoi(stringa);
- printf("%d\n",m);
- free(stringa);
- stringa=NULL;
- p = createorario(h,m);
- t=createtestimone(n,a,p);
- rbinsert(tree,t);
- free(stringa);
- stringa=NULL;
- free(buffer);
- buffer=NULL;
- buffer =malloc(sizeof(*buffer)*100);
- }
- fclose(file);
- }
- break;
Add Comment
Please, Sign In to add comment