queue.java

自己写的一个用java实现的一个语法分析器

package Syntax;

public class Queue {
	private int maxSize=10;
	private int increment=5;
	private int[] queArray;
	private int front;
	private int rear;
	private int current;
	private void increase()
	{
		int temp=maxSize;
		maxSize+=increment;
		int[] i=new int[maxSize];
		for(int j=0;j<temp;j++)
		{
			i[j]=queArray[j];
		}
		queArray=i;
	}
	public Queue()
	{
		//maxSize=s;
		queArray=new int[maxSize];
		for(int i=0;i<maxSize;i++)
		{
			queArray[i]=-1;
		}
		front=0;
		rear=-1;
		current=0;
	}
	public void insert(int i)
	{
		if(rear==maxSize-1)
		{
			rear=-1;
		}
		queArray[++rear]=i;
		current++;
		if(isFull())increase();
	}
	public int remove()
	{
		int temp=queArray[front++];
		if(front==maxSize)
		{
			front=0;
		}
		current--;
		return temp;
	}
	public int peekFront()
	{
		return queArray[front];
	}
	public int peek(int i)
	{
		return queArray[i];
	}
	public boolean find(int i)
	{
		for(int k=0;k<current;k++)
		{
			if(i==queArray[k])return true; 
		}
		return false;
	}
	public boolean isEmpty()
	{
		return current==0;
	}
	public boolean isFull()
	{
		return current==maxSize;
	}
	public int size()
	{
		return current;
	}
	
	
}