singlemyqueue.java

软件工程实践课程的答案哦

class SingleMyQueue
{
	private SingleLocation[] queue;
	private int maxSize=100;
	private int front;
	private int rear;
	
	public SingleMyQueue()
	{
		queue=new SingleLocation[maxSize];
		for(int i=0;i<maxSize;i++)
		    queue[i]=new SingleLocation();
		    
		front=rear=-1;
	}
	
	public void enQueue(SingleLocation location)
	{
		if(!isFull())
		{
			rear=(rear+1)%maxSize;
			queue[rear].x=location.x;
			queue[rear].y=location.y;
			queue[rear].color=location.color;
		}
		else System.out.println("The queue is full! ");
	}
	
	public SingleLocation deQueue()
	{
		if(!isEmpty())
		{
			front=(front+1)%maxSize;
			
			SingleLocation location=new SingleLocation();
			location.x=queue[front].x;
			location.y=queue[front].y;
			location.color=queue[front].color;
			
			return location;
		}
		else return null;
	}
	
	public boolean isFull()
	{
		if((rear+1)%maxSize==front)
		   return true;
		     else return false;
	}
	
	public boolean isEmpty()
	{
		return rear==front;
	}
}