#include "Manage.h"
#include"bits/stdc++.h"
Parking_Management::Parking_Management()
{
capacity = MAX_CAPACITY;
QS = new Queue_Stack;
QS->Init_Stack(&QS->S1);
QS->Init_Stack(&QS->S2);
QS->Init_Stack(&QS->S3);
QS->Init_Queue(&QS->Q1);
for (int i = 0; i < MAX_CAPACITY; i++)
{
Pos_info[i].number = i + 1;
Pos_info1[i].number = i + 1;
path[i].number = i + 1;
}
}
void Parking_Management::Enter_Parking()
{
string license_n;
cout << "请输入您的车牌号：";
cin >> license_n;
if ((QS->Full_Stack(&QS->S1))&&(QS->Full_Stack(&QS->S3)))
{
if (QS->Length_Queue(&QS->Q1) != MAX_CAPACITY)
{
QS->EnQueue(&QS->Q1, license_n);
int t = QS->Length_Queue(&QS->Q1);
path[t - 1].license_number = license_n;
path[t - 1].condition = "正在占用";
cout << "\n停车位已满，去便道磕会儿瓜子吧(*^_^*)\n";
}
else
{
cout << "\n便道也满了ヾ(＠⌒ー⌒＠)ノ" << endl;
return;
}
}
else if(!QS->Full_Stack(&QS->S1))
{
QS->Push_Stack(&QS->S1, license_n);
int t = QS->Length_Stack(&QS->S1);
Pos_info[t - 1].license_number = license_n;
Pos_info[t - 1].condition = "正在使用";
}
else if(QS->Full_Stack(&QS->S1)&&(!QS->Full_Stack(&QS->S3)))
{
QS->Push_Stack(&QS->S3, license_n);
int t = QS->Length_Stack(&QS->S3);
Pos_info1[t - 1].license_number = license_n;
Pos_info1[t - 1].condition = "正在使用";
}
}
void Parking_Management::Exit_Parking()
{
int sign = 0, flag = 0;
int tt;
Print();
string ss1, p;
if ((!(QS->EmptyStack(&QS->S1)))||(!(QS->EmptyStack(&QS->S3))))
{
cout << "\n请输入停车场要离开的车牌号：";
cin >> ss1;
}
else
{
cout << "\n停车场为空\n\n";
return;
}
while (!QS->EmptyStack(&QS->S1))
{
p = QS->Gethead_Stack(&QS->S1);
if (p == ss1)
{
if (!QS->Empty_Queue(&QS->Q1))
{
sign = 1;
for (int i = 0; i < MAX_CAPACITY; i++)
{
if (p == Pos_info[i].license_number)
{
cout << endl;
p = QS->Gethead_Queue(&QS->Q1);
Pos_info[i].license_number = p;
QS->Pop_Queue(&QS->Q1);
tt = i;
for (int i = 0; i < MAX_CAPACITY - 1; i++)
{
path[i].condition = path[i + 1].condition;
path[i].license_number = path[i + 1].license_number;
}
path[MAX_CAPACITY - 1].license_number = "NULL";
path[MAX_CAPACITY - 1].condition = "未使用";
break;
}
}
}
else
{
int i;
for (i = 0; i < MAX_CAPACITY; i++) {
if (p == Pos_info1[i].license_number) {
Pos_info1[i].license_number = "NULL";
Pos_info1[i].condition = "未使用";
break;
}
}
}
}
if (p != ss1)
{
string h = p;
QS->Push_Stack(&QS->S2, h);
}
QS->Pop_Stack(&QS->S1);
}
while (!QS->EmptyStack(&QS->S2))
{
string p = QS->Gethead_Stack(&QS->S2);
QS->Push_Stack(&QS->S1, p);
QS->Pop_Stack(&QS->S2);
}
while (!QS->EmptyStack(&QS->S3))
{
p = QS->Gethead_Stack(&QS->S3);
if (p == ss1)
{
if (!QS->Empty_Queue(&QS->Q1))
{
sign = 1;
for (int i = 0; i < MAX_CAPACITY; i++)
{
if (p == Pos_info1[i].license_number)
{
cout << endl;
p = QS->Gethead_Queue(&QS->Q1);
Pos_info1[i].license_number = p;
QS->Pop_Queue(&QS->Q1);
tt = i;
for (int i = 0; i < MAX_CAPACITY - 1; i++)
{
path[i].condition = path[i + 1].condition;
path[i].license_number = path[i + 1].license_number;
}
path[MAX_CAPACITY - 1].license_number = "NULL";
path[MAX_CAPACITY - 1].condition = "未使用";
break;
}
}
}
else
{
int i;
for (i = 0; i < MAX_CAPACITY; i++) {
if (p == Pos_info1[i].license_number) {
Pos_info1[i].license_number = "NULL";
Pos_info1[i].condition = "未使用";
break;
}
}
}
}
if (p != ss1)
{
string h = p;
QS->Push_Stack(&QS->S2, h);
}
QS->Pop_Stack(&QS->S3);
}
while (!QS->EmptyStack(&QS->S2))
{
string p = QS->Gethead_Stack(&QS->S2);
QS->Push_Stack(&QS->S3, p);
QS->Pop_Stack(&QS->S2);
}
}
void Parking_Management::Print()
{
cout << "\n停车场基本信息：共10个车位" << endl << endl;
if (QS->EmptyStack(&QS->S1)&&QS->EmptyStack(&QS->S3))
{
cout << "当前停车场为空\n\n" << endl;
return;
}
QS->Show_Stack(&QS->S1);
QS->Show_Stack1(&QS->S3);
cout << " \n便道基本信息：\n\n";
QS->Show_Queue(&QS->Q1);
}
停车场管理系统的设计与实现
需积分: 2 40 浏览量
2024-02-09
20:02:58
上传
评论 1
收藏 411KB RAR 举报
停车场管理系统.rar （12个子文件） 
停车场管理系统 Parking 
Manage.cpp 5KB Manage.o 21KB Parking.layout 357B Manage.h 978B Operate.o 9KB main.cpp 1015B Operate.cpp 3KB Makefile.win 1KB main.o 8KB Parking.dev 1KB Operate.h 1KB
Parking.exe 1.93MB资源评论
