数据结构(C)队列(window应用程序)..docVIP

数据结构（Ｃ＃版）——队列（window应用程序） namespace Data_Structure.Queue.dao { class CSeqBankQueue:CSeqQueueint ,IBankQueue { private int callnumber;//记?录?系|ì统a3自á?动?￥产¨2生|¨2的ì?新?来¤??顾?客¨a的ì?服¤t务?号? //叫D号?属o?性? public int Callnumber { get { return callnumber; } set { callnumber = value; } } public CSeqBankQueue(){} public CSeqBankQueue(int size):base(size){}//初?始o?化?￥maxsize //获?得ì?服¤t务?号?码? public int GetCallnumber() { if ((IsEmpty()) callnumber == 0) callnumber = 1; else callnumber++; return callnumber; } } } namespace Data_Structure.Queue.dao { class CSeqQueueT:IQueueT { private int maxsize; //循-环?¤顺3序¨°队¨?列￠D的ì?容¨Y量￠? private T[] data; //数oy组á¨|，ê?用??于?¨2存??储??é循-环?¤顺3序¨°队¨?列￠D中D的ì?数oy据Y元a素? private int front; //指?示o?最á?近¨1一°?个?己o经-离¤?开a队¨?列￠D的ì?元a素?所¨′占?的ì?位?置? private int rear; //指?示o?最á?近¨1一°?个?进?行D入¨?队¨?列￠D的ì?元a素?的ì?位?置? //索??引°y器?? public T this[int index] { get { return data[index]; } set { data[index] = value; } } //容¨Y量￠?属o?性? public int Maxsize { get { return maxsize; } set { maxsize = value; } } //队¨?头a?¤指?示o?器??属o?性? public int Front { get { return front; } set { front = value; } } //队¨?尾2指?示o?器??属o?性? public int Rear { get { return rear; } set {