#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include "lista.h"

Go to the source code of this file.
Functions | |
| int | main (void) |
| int main | ( | void | ) |
Definition at line 27 of file main.c.
References add_after(), add_node(), delete_list(), node::next, node::num, rem_node(), search(), and size().
00027 { 00028 node *list = NULL; 00029 node *start = NULL; 00030 00031 if((list=(node*)malloc(sizeof(node)))==NULL){ 00032 perror("malloc"); 00033 return EXIT_FAILURE; 00034 } 00035 memset(list,'\0',sizeof(node)); 00036 list->num = 0; 00037 00038 add_node(list,1); 00039 add_node(list,2); 00040 add_node(list,3); 00041 add_node(list,4); 00042 add_node(list,5); 00043 add_node(list,6); 00044 add_after(search(list,3),30); 00045 00046 fprintf(stdout,"List size=%ld\n",size(list)); 00047 00048 start=list; 00049 while(list!=NULL){ 00050 fprintf(stdout,"%d\n",list->num); 00051 fflush(stdout); 00052 list=list->next; 00053 } 00054 list=start; 00055 fprintf(stdout,"Removendo...\n"); 00056 fflush(stdout); 00057 00058 list=rem_node(list,0); 00059 list=rem_node(list,1); 00060 list=rem_node(list,3); 00061 list=rem_node(list,5); 00062 list=rem_node(list,6); 00063 00064 fprintf(stdout,"List size=%ld\n",size(list)); 00065 00066 start=list; 00067 while(list!=NULL){ 00068 fprintf(stdout,"%d\n",list->num); 00069 fflush(stdout); 00070 list=list->next; 00071 } 00072 list=start; 00073 00074 delete_list(list); 00075 00076 return EXIT_SUCCESS; 00077 }
1.5.5