package gilyou.liu;

import java.util.ArrayList;

public class Queue implements Cloneable {
    ArrayList<Point> array;
	public Queue() {
		array = new ArrayList<Point>();
	}
	public boolean isEmpty(){
		return array.isEmpty();
	}
	public void enQueue(Point p){
		if(array == null)
			array = new ArrayList<Point>();
		array.add(p);
	}
	public void enQueue(int x,int y){
		if(array == null)
			array = new ArrayList<Point>();
		array.add(new Point(x,y));
	}
	public Point deQueue(){
		if(array.isEmpty())
			return null;
		return array.remove(0);
	}
	public Queue clone(){
		Queue temp = new Queue();
		int indexSize = array.size();
		for(int i = 0; i < indexSize; i++)
			temp.enQueue(array.get(i));
		return temp;
	}
}