【嵌入式系统学习记录】小项目：停车场管理系统的体会

停车场项目需求

问题描述&＃xff1a;停车场是一个能放 n 辆车的狭长通道&＃xff0c;只有一个大门&＃xff0c;汽车按到达的先后次序停放。若车场满了&＃xff0c;车要停在门

          外的便道上等候&＃xff0c;一旦有车走&＃xff0c;则便道上第一辆车进入。当停车场中的车离开时&＃xff0c;由于通道窄&＃xff0c;在它后面的车


  要先退出&＃xff0c;待它走后在依次进入。汽车离开时按停放时间收费。

基本功能要求&＃xff1a;

          &＃xff08;1&＃xff09;建立三个数据结构分别是&＃xff1a;停放栈、让路栈、等候队列。

          &＃xff08;2&＃xff09;输入数据模拟管理过程&＃xff0c;数据&＃xff08;入或出&＃xff0c;车号&＃xff09;

功能描述&＃xff1a;进车登记、出车登记、按车牌号查询停车车辆信息、查询出入车记录、

          查询场内车辆信息、查询等候车辆信息、退出系统。

          &＃xff08;1&＃xff09;linux系统编写&＃xff08;链表、栈、队列&＃xff09;&＃xff1b;

          &＃xff08;2&＃xff09;进车登记&＃xff1a;登记车牌号以及入场时间&＃xff1b;

          &＃xff08;3&＃xff09;出车登记&＃xff1a;计算出停车时间&＃xff0c;记录车辆车牌&＃xff1b;


  &＃xff08;4&＃xff09;按车牌号查询车辆信息&＃xff1a;停车时间&＃xff0c;是否来过停车场&＃xff0c;是否还在停车场

          &＃xff08;5&＃xff09;查询出入记录&＃xff1a;所有车辆&＃xff0c;包括已经离开的

          &＃xff08;6&＃xff09;查询场内车辆信息&＃xff1a;列出所有场内车辆信息


  &＃xff08;7&＃xff09;查询等候车辆信息&＃xff1a;显示等候车辆数量以及所有车牌号

  &＃xff08;8&＃xff09;退出系统。

#ifndef _PARK_H
#define _PARK_H#define TRUE 10000
#define FALSE 10001#define P_MAX 3
#define W_MAX 3
#define PRICE 2struct car
{char *carnum;char *timein;char *timeout;int InsertSeconds;int total;struct car *next;
};
typedef struct car Car;struct park
{Car *top;int length;
};
typedef struct park Park;struct waitcar
{Car *front;Car *rear;int length;
};
typedef struct waitcar Wait;void Menu();
void Init(Park **p, Park **r, Wait **w, Park **h);
int EmptyStack(Park *p);
int FullStack(Park *p);
int EnterStack(Park *p, Car *c);
Car *PopStack(Park *p);
int TraverStackP(Park *p);
int TraverStackH(Park *p);
int EmptyQueue(Wait *w);
int FullQueue(Wait *w);
Car *PopQueue(Wait *w);
int TraverQueue(Wait *w);
char *now_time(void);
int Seconds();
int InsertCar(Park *p, Wait *w);
int PopCar(Park *p,Park *r, Wait *w, Park *h);
int QueryCar(Park *p, Wait *w, Park *h);
int ListAll(Park *p, Wait *w, Park *h);
#endif


#include
#include
#include
#include
#include"park.h"void Menu()
{printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~欢迎使用停车管理系统~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~1、停入车辆 2、车辆离开~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~3、查询车辆信息 4、显示所有车辆~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~5、显示在场车辆 6、显示等待中的车辆~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~~~~7、退出系统~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");}void Init(Park **p, Park **r, Wait **w, Park **h)
{(*p) &＃61; (Park *)malloc(sizeof(Park));(*r) &＃61; (Park *)malloc(sizeof(Park));(*h) &＃61; (Park *)malloc(sizeof(Park));(*w) &＃61; (Wait *)malloc(sizeof(Wait));if(NULL &＃61;&＃61; (*p) || NULL &＃61;&＃61; (*r) || NULL &＃61;&＃61; (*w) || NULL &＃61;&＃61; (*h)){printf("malloc failure!\n");}(*p) -> top &＃61; NULL;(*r) -> top &＃61; NULL;(*h) -> top &＃61; NULL;(*p) -> length &＃61; 0;(*r) -> length &＃61; 0;(*h) -> length &＃61; 0;Car *wn &＃61; (Car *)malloc(sizeof(Car));if(NULL &＃61;&＃61; wn){printf("ERROR!\n");}wn -> next &＃61; NULL;(*w) -> rear &＃61; (*w) -> front &＃61; wn;(*w) -> length &＃61; 0;
}int EmptyStack(Park *p)
{if(NULL &＃61;&＃61; p){return FALSE;}return(NULL &＃61;&＃61; p -> top)? TRUE: FALSE;
}int FullStack(Park *p)
{if(NULL &＃61;&＃61; p){return FALSE;}if(p -> length &＃61;&＃61; P_MAX){return TRUE;}else{return FALSE;}
}int EnterStack(Park *p, Car *c)
{if(NULL &＃61;&＃61; p){return FALSE;}Car *t &＃61; (Car *)malloc(sizeof(Car));if (NULL &＃61;&＃61; t){return FALSE;}t &＃61; c;t -> next &＃61; p -> top;p -> top &＃61; t;p -> length&＃43;&＃43;;
}Car *PopStack(Park *p)
{if(NULL &＃61;&＃61; p){printf("ERROR\n");}Car *tmp &＃61; p -> top;p -> top &＃61; tmp -> next;p -> length--;return tmp;
}int TraverStackP(Park *p)
{if(NULL &＃61;&＃61; p){return FALSE;}Car *c &＃61; p -> top;while(c){printf("车牌号%s 入场时间为%s 正在计时\n", c -> carnum, c -> timein);c &＃61; c -> next;}printf("\n");
}int TraverStackH(Park *p)
{if(NULL &＃61;&＃61; p){return FALSE;}Car *c &＃61; p -> top;while(c){printf("车牌号%s 入场时间为%s 离开时间为%s 费用为%d\n", c -> carnum, c -> timein, c -> timeout, c -> total);c &＃61; c -> next;}printf("\n");
}
int EmptyQueue(Wait *w)
{if(NULL &＃61;&＃61; w){return FALSE;}return(w -> length &＃61;&＃61; 0)? TRUE: FALSE;}
int FullQueue(Wait *w)
{if(NULL &＃61;&＃61; w){return FALSE;}if(w -> length &＃61;&＃61; W_MAX){return TRUE;}else{return FALSE;}
}Car *PopQueue(Wait *w)
{if(NULL &＃61;&＃61; w || w -> front &＃61;&＃61; w -> rear){printf("ERROR\n");}Car *tmp &＃61; w -> front -> next;w -> front -> next &＃61; tmp -> next;if (tmp &＃61;&＃61; w -> rear){w -> rear &＃61; w -> front;}return tmp;
}int TraverQueue(Wait *w)
{if(NULL &＃61;&＃61; w){return FALSE;}Car *c &＃61; w -> front ->next;while(c){printf("车牌%s正在等待入栈\n", c -> carnum);c &＃61; c -> next;}printf("\n");
}char *now_time()
{time_t timep;time(&timep);return ctime(&timep);
}int Seconds()
{time_t timep;return time(&timep);
}int InsertCar(Park *p, Wait *w)
{if(NULL &＃61;&＃61; p || NULL &＃61;&＃61; w){printf("error!\n");}if(FullStack(p) &＃61;&＃61; TRUE){if(FullQueue(w) &＃61;&＃61; TRUE){printf("等候区已满&＃xff01;\n");}else{Car *c &＃61; (Car *)malloc(sizeof(Car));c -> carnum &＃61; (char *)malloc(sizeof(char) * 8) ;if(NULL &＃61;&＃61; c){return FALSE;}printf("请输入车牌之后进入等待队列&＃xff1a;\n");scanf("%s", c -> carnum);c -> next &＃61; NULL;w -> rear -> next &＃61; c;w -> rear &＃61; c;w -> length&＃43;&＃43;;printf("已进入等待队列&＃xff01;\n");}printf("车库已满&＃xff01;\n");}else{Car *c &＃61; (Car *)malloc(sizeof(Car));c -> carnum &＃61; (char *)malloc(sizeof(char) * 8) ;c -> timein &＃61; (char *)malloc(sizeof(char) * 30) ;c -> timeout &＃61; (char *)malloc(sizeof(char) * 30) ;if(NULL &＃61;&＃61; c){return FALSE;}printf("请输入车牌号&＃xff1a;\n");scanf("%s", c -> carnum);strcpy(c -> timein, now_time());c -> InsertSeconds &＃61; Seconds();c -> total &＃61; 0;c -> next &＃61; p -> top;p -> top &＃61; c;p -> length&＃43;&＃43;;printf("%s已经成功进入停车栈\n",c -> carnum);}
}int PopCar(Park *p, Park *r, Wait *w, Park *h)
{if(NULL &＃61;&＃61; p || NULL &＃61;&＃61; r || NULL &＃61;&＃61; w || NULL &＃61;&＃61; h){return FALSE;}char *goalnum &＃61; (char *)malloc(sizeof(char) * 20);printf("请输入需要离开的车牌号&＃xff1a;\n");scanf("%s", goalnum);Car *n &＃61; p -> top;int count &＃61; 0;while(n !&＃61; NULL && strcmp(goalnum, n -> carnum) !&＃61; 0){count&＃43;&＃43;;n &＃61; n -> next;}n &＃61; p -> top;if(count &＃61;&＃61; p -> length){printf("该车辆不在停车场内&＃xff01;\n");}else{while(n){if(strcmp(goalnum, n -> carnum) &＃61;&＃61; 0){strcpy(n -> timeout, now_time());n -> total &＃61; (Seconds() - n -> InsertSeconds) * PRICE;EnterStack(h, PopStack(p));printf("%s已经退出停车栈&＃xff0c;费用为%d元\n", n -> carnum, n -> total);break;}EnterStack(r, PopStack(p));printf("%s已经退出停车栈&＃xff0c;暂时进入让路栈\n",n -> carnum);n &＃61; p-> top;//关键问题&＃xff01;&＃xff01;&＃xff01;&＃xff01;&＃xff01;&＃xff01;&＃xff01;}while(FullStack(p) &＃61;&＃61; FALSE && EmptyStack(r) &＃61;&＃61; FALSE) {EnterStack(p, PopStack(r));printf("%s已经回到停车栈\n", p -> top -> carnum);if(EmptyStack(r) &＃61;&＃61; TRUE){printf("让路栈已空&＃xff01;\n");break;}}}while( EmptyQueue(w) &＃61;&＃61; FALSE && FullStack(p) &＃61;&＃61; FALSE){EnterStack(p, PopQueue(w));printf("%s已经从候车队列进入停车栈&＃xff01;\n", p -> top -> carnum);p -> top -> timein &＃61; now_time();}
}int QueryCar(Park *p, Wait *w, Park *h)
{int flag &＃61; 0;char *goal &＃61; (char *)malloc(sizeof(char));if(NULL &＃61;&＃61; p || NULL &＃61;&＃61; h || NULL &＃61;&＃61; w){return FALSE;}printf("请输入想要查找的车牌号&＃xff1a;\n");scanf("%s",goal);Car *p1 &＃61; p -> top;Car *w1 &＃61; w -> front -> next;Car *h1 &＃61; h -> top;while(p1){if(strcmp(goal, p1 -> carnum) &＃61;&＃61; 0){printf("车牌为%s的车辆正在计时停车&＃xff0c;入场时间为%s\n",p1 -> carnum, p1 -> timein);flag &＃61; 1;break;}p1 &＃61; p1 -> next;}while(w1){if(strcmp(goal, w1 -> carnum) &＃61;&＃61; 0){printf("车牌为%s的车辆正在等候队列\n",w1 -> carnum);flag &＃61; 1;break;}}while(h1){if(strcmp(goal, h1 -> carnum) &＃61;&＃61; 0){printf("车辆%s已离开,入场时间%s,离开时间%s,计费%d元\n",h1 -> carnum, h1 -> timein, h1 -> timeout, h1 -> total);flag &＃61; 1;break;}}if(flag &＃61;&＃61; 0){printf("没有找到这辆车&＃xff01;\n");}}int ListAll(Park *p, Wait *w, Park *h)
{if(NULL &＃61;&＃61; p || NULL &＃61;&＃61; w || NULL &＃61;&＃61; h){return FALSE;}TraverStackP(p);TraverStackH(h);TraverQueue(w);
}


#include"park.h"
#include
#includeint main()
{system("clear");Park *park;Park *road;Wait *waitcar;Park *history;Init(&park, &road, &waitcar, &history);int choice;while(1){Menu();printf("请选择&＃xff1a;");scanf("%d",&choice);getchar();switch(choice){case 1:InsertCar(park, waitcar);break;case 2:PopCar(park, road, waitcar, history);break;case 3:QueryCar(park, waitcar, history);break;case 4:ListAll(park, waitcar, history);break;/* case 5:ListCarIn(park);break;case 6:ListCarWait(wait);break;*/case 7:printf("欢迎下次使用&＃xff01;\n");sleep(1);exit(1);break;default:printf("请重新选择&＃xff01;\n");break;}}return 0;
}


跟通讯录相比&＃xff0c;本人在该项目中主要通过对初始化、入栈、出栈、进队列、出队列等接口函数的调用实现了对整个停车场的管理操作。对比通讯录&＃xff0c;在这个项目中&＃xff0c;数据结构更加的多元化&＃xff0c;不是单一的单向链表&＃xff0c;而是结合了链式队列、链式栈、结构体指针等。在函数调用时&＃xff0c;实参与形参的数量和类型都变得丰富&＃xff0c;数据类型的一致是实现功能的关键。对于栈中top指针和队列中front和rear都有了更深入的理解。