client.h

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

//////////////////////////////////////////////////////////////////////////
// 
//
//


#ifndef CLIENT_H
#define CLIENT_H
#include <stdlib.h>
#define SAFEDELETES(p) {if(p) {delete []p; p = NULL;}}				
#define SAFEDELETE(p) {if(p) {delete p; p = NULL;}} 
#define TRUE	1
#define FALSE	0

class Client
{
private:
	int		m_nArrive_Time;
	int		m_nBegin_deal_time;
	int		m_nDeal_Time;
	Client*	m_pNext;
	Client*	m_pPrev;

public:
	Client(int	narrive_time = 0, int	ndeal_time = 0);
	
	friend	class	Queue;
	friend	class	Strategy_1;
	friend	class	Strategy_2;
	friend	class	Strategy_3;

/*	
	int		Get_Arrive_Time();
	int		Get_Deal_Time();
	Client* Get_Next_Client();
	Client*	Get_Prev_Client();
	int		Set_Next_Client(Client*	pclient);
	int		Set_Prev_Client(Client*	pclient);
*/
};
#endif