client.cpp

银行排队的数学模型的实现 问题： n银行有n个窗口对外营业

#include "client.h"

Client::Client(int narrive_time /* = 0 */, int ndeal_time /* = 0 */)                    // client构造函数
{
	m_nArrive_Time = narrive_time;
	m_nDeal_Time = ndeal_time;
	m_nBegin_deal_time = 0;
	m_pNext = m_pPrev = NULL;
}

/*																						// 由于将其设为strategy# 类的友元，故这些函数可以省去
int		Client::Get_Arrive_Time()
{
	return	m_nArrive_Time;
}

int		Client::Get_Deal_Time()
{
	return	m_nDeal_Time;
}

Client*	Client::Get_Next_Client()
{
	return	m_pNext;
}

Client*	Client::Get_Prev_Client()
{
	return	m_pPrev;
}

int		Client::Set_Next_Client(Client* pclient)
{
	m_pNext = pclient;
	return	TRUE;
}

int		Client::Set_Prev_Client(Client* pclient)
{
	m_pPrev = pclient;
	return	TRUE;
}
*/