手写数组结构的队列

/**
 * 手写数组结构的队列.
 * 
 * @author dmw
 *
 * 2018年11月22日
 */
public class ArrQueue<T> {
	private int head_index;
	
	private int tail_index;
	
	private int arr_length;
	
	private Object [] arr ;

	public ArrQueue(int length) {
		super();
		this.arr_length = length + 1;
		
		this.arr = new Object[arr_length];
		this.head_index = 0;
		this.tail_index = 0;
	}

	
	public int size() {
		if (head_index < tail_index){
			return  tail_index - head_index;
		}
		if (head_index > tail_index){
			return arr_length +tail_index -head_index;
		}
		return 0;
	}

	@SuppressWarnings("unchecked")
	public T[] toArray() {
		int size = size();
		Object [] newArr = new Object [size];
		if (size != 0){
			int i = head_index;
			int b = 0;
			do {
				newArr[b] = arr[i];
				b ++;
				i = (i+1)%arr_length;
			} while (i != tail_index);
		}
		return (T[]) newArr;
	}

	public boolean add(T t) {	
		int new_tail_index = (tail_index+1)%arr_length;
		if (new_tail_index == head_index){
			return false;
		}
		arr[tail_index] = t;
		tail_index = new_tail_index;
		return true;
	}
	
	@SuppressWarnings("unchecked")
	public T remove() {
		if (head_index == tail_index){
			throw new RuntimeException("根本没有啊.别remove了");
		}
		Object first = arr[head_index];
		arr[head_index] = null;
		head_index = (head_index+1)%arr_length;
		return (T) first;
	}
	@SuppressWarnings("unchecked")
	public T first() {
		return (T) arr[head_index];
	}

}