address.c

交通系统的模拟程序

#include <stdio.h>
#include <stdlib.h>
struct address{
  char name[20];
  char street[20];
  char city[10];
  char state[10];
  char eip[7];
  struct address *next;
  struct address *prior;
  }list_entry;
struct address *start;
struct address *last;
void add();
void display();
void search();
void save();
void load();
void list();
struct address *find(char *name);
struct address *dls_store(struct address *,struct address *);
main()
{
clrscr();
start=last=NULL;
load();
for (;;){
  switch(menu_select()){
    case 1:add();break;
    case 2:delete();break;
    case 3:list();break;
    case 4:search();break;
    case 5:save();break;
    case 6:exit(0);
    }
  }
}

menu_select()
{
char c;
printf("1.Add a record.\n");
printf("2.Delete a record.\n");
printf("3.Show all records.\n");
printf("4.Search a record.\n");
printf("5.Save address book.\n");
printf("6.Quit\n");
do{
  printf("\nInput your choice:");
  c=getche();
  }while (c<'0'||c>'6');
return c-48;
}

void add()
{
struct address *info;
for (;;){
  info=(struct address *)malloc(sizeof(list_entry));
  if (!info){
    printf("\nout of memory");
  return;
  }
  inputs("\nName:",info->name,15);
  if (!info->name[0]) break;
  inputs("Street:",info->street,15);
  inputs("City:",info->city,15);
  inputs("State:",info->state,15);
  inputs("Eip:",info->eip,15);
  start=dls_store(info,start);
  }
}
inputs(char *prompt,char *s,int count)
{
char p[255];
do{
  printf(prompt);
  gets(p);
  if (strlen(p)>count) printf("\ntoo long\n");
  }while (strlen(p)>count);
  strcpy(s,p);
}
struct address *dls_store(struct address *i,struct address *top)
{
struct address *old,*p;
if (last==NULL){
  i->next=NULL;
  i->prior=NULL;
  last=i;
  return i;
  }
p=top;
old=NULL;
while(p){
  if (strcmp(p->name,i->name)<0){
    old=p;p=p->next;
    }
  else{
    if(p->prior){
      p->prior->next=i;
      i->next=p;
      i->prior=p->prior;
      p->prior=i;
      return top;
      }
    i->next=p;
    i->prior=NULL;
    p->prior=i;
    return i;
    }
  }
  old->next=i;
  i->next=NULL;
  i->prior=old;
  last=i;
  return start;
}

delete()
{
struct address *info;
char s[80];
printf("\nInput name(delete):");
gets(s);
info=find(s);
if (info) {
  if (start==info){
    start=info->next;
    if (start)
      start->prior=NULL;
    else
      last=NULL;
    }
  else{
    info->prior->next=info->next;
    if(info!=last)
      info->prior->next=info->prior;
else
      last=info->prior;
    }
  free(info);
  }
}

struct address *find(char *name)
{
struct address *info;
info=start;
while(info){
  if(!strcmp(name,info->name)) return info;
  info=info->next;
  }
printf("Name not found\n");
return NULL;
}
void list()
{
struct address *info;
info=start;
printf("\n%-15s%-15s%-15s%-15s%-15s\n",
  "name","street","city","state","eip");
while(info){
  display(info);
  info=info->next;
  }
printf("\n\n");
}

void display(struct address *info)
{
printf("%-17s%-15s%-14s%-15s%-6s\n",
  info->name,info->street,info->city,info->state,info->eip);
}

void search()
{
char name[40];
struct address *info,*find();
printf("\nInput a name to search:");
gets(name);
info=find(name);
if(!info)
  printf("Not found\n");
else
  display(info);
}

void save()
{
struct address *info;
FILE *fp;
if((fp=fopen("address.txt","wb"))==NULL){
  printf("\nCan't open file.\n");
  exit(1);
  }
printf("\nSave file success.\n");
info=start;
while(info){
  fwrite(info,sizeof(struct address),1,fp);
  info=info->next;
  }
fclose(fp);
}

void load()
{
struct address *info,*temp=NULL;
FILE *fp;
if((fp=fopen("address.txt","rb"))==NULL){
  printf("\nCan't open file\n");
  return;
  }
while(start){
  info=start->next;
  free(info);
  start=info;
  }
printf("\nLoading file success.\n");
start=(struct address *)malloc(sizeof(struct address));
if(!start){
  printf("Out of memory!\n");
  return;
  }
info=start;
while(!feof(fp)){
  if(1!=fread(info,sizeof(struct address),1,fp)) break;
  info->next=(struct address *)malloc(sizeof(struct address));
  if (!info->next){
    printf("Out of memory\n");
    return;
    }
  info->prior=temp;
  temp=info;
  info=info->next;
  }
temp->next=NULL;
last=temp;
start->prior=NULL;
fclose(fp);
}