public class CircleDequeZH<E> {
private int size;
private int front;
private E elements[];
private static final int DEFAULT_CAPACITY = 10;
public CircleDequeZH() {
elements = (E[]) new Object[DEFAULT_CAPACITY];
}
private int getMo(int a, int b){
return a > b ? (a-b) : a;
}
public int realIndexCaculate(int index){
if (index<0){
return getMo((index + front + elements.length), elements.length);
}
return getMo((index+front),elements.length);
}
private void ifNeedEnLarge(int needCapacity){
int oldcapacity = elements.length;
if (needCapacity<=oldcapacity){
return;
}else{
int newcapacity = oldcapacity + (oldcapacity>>1);
E[] newElements = (E[]) new Object[newcapacity];
for (int i=0;i<size;i++){
newElements[i]=elements[(i+front)%elements.length];
}
front = 0;
elements = newElements;
System.out.println("enLarge Success"+" newCapacity = "+newcapacity);
}
}
public int size(){
return size;
}
public boolean isEmpty(){
return size == 0;
}
public void clear(){
for (int i = 0;i<size;i++){
elements[(i+front)%elements.length]=null;
}
size = 0;
front = 0;
}
public E deQueueFront(){
E element = elements[front];
elements[front] = null;
front = (front+1)%elements.length;
size--;
return element;
}
public E deQueueNear(){
E element = elements[realIndexCaculate(size-1)];
elements[realIndexCaculate(size-1)] = null;
size--;
return element;
}
public void enQueueFront(E element){
ifNeedEnLarge(size+1);
elements[realIndexCaculate(-1)] = element;
front = realIndexCaculate(-1);
size++;
}
public void enQueueNear(E element){
ifNeedEnLarge(size+1);
elements[(front+size)% elements.length] = element;
size++;
}
public String arrayPrint(){
StringBuilder string = new StringBuilder();
string.append("size = ").append(size).append(" ").append("front= ").append(elements[front]).append(" [");
for (int i = 0; i< elements.length; i++ ){
if (elements[i]==null){
string.append("null,");
}else {
string.append(elements[i]).append(",");
}
}
string.append("]");
return string.toString();
}
}