Code:
#include "StdAfx.h"
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct node_s
{
char sMember1[20];//0003328763
char sMember2[10];//039485
char sMember3[12];//Smith
char sMember4[15]; //, MaryAnne
char sMember5[2];//M.
char sMember6[12];//6/21/2001
char sMember7[12];//5/22/2001
char sMember8[12];//7/8/2001
char sMember9[60];//Customer purchased clothing articles from Women's Wear
int sMember10;//10
double sMember11;//150.47
struct node_s * linkp;
}node_t;
//prototypes
FILE *OpenTheFile(FILE *);
node_t * LoadList(node_t *, FILE *);
void Display(node_t *);
int main()
{
FILE *fPtr = NULL;
node_t * hp = NULL;
fPtr = OpenTheFile(fPtr);
hp = LoadList(hp,fPtr);
Display(hp);
return 0;
}
///////////////////////////////
FILE *OpenTheFile(FILE *fPtr)
{
fPtr = fopen("TextFile1.txt","r");
if(fPtr == NULL)
{
fprintf(stderr,"File not found");
_getch();
exit(EXIT_FAILURE);
}
return fPtr;
}
///////////////////////////////
node_t * LoadList(node_t * hp, FILE * fPtr)
{
int status;
char * ptr = NULL;
char sTemp[20];
node_t *currentp, *previousp, *newp;
currentp = previousp = newp = NULL;
while(true)
{
//create a new node used to store a record from the input file
newp = (node_t *) malloc (sizeof(node_t));
newp->linkp = NULL;
//fill node, and validate input file record
status = fscanf(fPtr,"%s",sTemp);
ptr = sTemp;
++ptr;
if (strcmp(".",sTemp) == 0 || strcmp(",",sTemp) == 0)
{
status = fscanf(fPtr,"%s",sTemp);
}else
if ( *ptr == '.')
{
*ptr = ' ';
}else
if (status == EOF)
{
free(newp);
break;
}
strcpy(newp->sMember1,sTemp);
/*
%[.,]s%[.,]s%[.,]s%s%s%s%d%lf", newp->sMember1,
newp->sMember2,newp->sMember3,newp->sMember4,newp->sMember5,
newp->sMember6,newp->sMember7,newp->sMember8,newp->sMember9,
&newp->sMember10,&newp->sMember11);
*/
//if no record was found than the file is empty or else
//the list if full
//If the new node is the first node in the list than designate
//it as the head of the linked list (build list order routine)
if(hp == NULL)
{
hp = newp;
}else
{
//otherwise insert new node at the end of the list
currentp = hp;
while(currentp)
{
previousp = currentp;
currentp = currentp->linkp;
}
previousp->linkp = newp;
}
//secure list for later attempt to traverse the list
//by closing the end nodes pointer
newp->linkp = NULL;
}//end of while loop
return hp;
}
void Display(node_t *hp)
{
while(hp)
{
printf("%s ",hp->sMember1);
/*
printf("%s %s %s %s %s %s %s %s %s %d %lf", hp->sMember1,
hp->sMember2,hp->sMember3,hp->sMember4,hp->sMember5,
hp->sMember6,hp->sMember7,hp->sMember8,hp->sMember9,
hp->sMember10,hp->sMember11);
*/
hp = hp->linkp;
}
}
Look at this code. It scans the contents of the file but it doesn't load all the list members. I'm 2/3 of the way through the program but I have to stop and study for a 'statistics' exam tomorrow. If you want to check back tomorrow than I'll finish the program. I don't have time now. When I finish it off I'll load the structure properly. This just scans all the data and removes and periods or commas. It can probably be improved but I have to run to my other books. Very rough draft but when I'm done it will look pretty.
