循环队列和队列的性能比较

循环队列

package com.company;



public class LoopQueue<E> implements Queue<E>{
   
    private E[] data;
    private int front, tail;
    private int size;

    public LoopQueue(int capacity){
   
        data = (E[]) new Object[capacity+1];
        front = 0;
        tail = 0;
        size = 0;
    }
    public LoopQueue(){
   
        this(10);
    }
    public int getCapacity(){
   
        return data.length -1;
    }
    @Override
    public boolean isEmpty(){
   
        return front == tail;

    }
    @Override
    public int getSize(){
   
        return size;
    }

    @Override
    public void enqueue(E e){
   

        if((tail + 1) % data.length == front)
            resize(getCapacity() * 2);

        data[tail] = e;
        tail = (tail + 1) % data.length;
        size ++;
    }
    @Override
    public E dequeue(){
        if (isEmpty()){
   
            throw new IllegalArgumentException("Cannot dequeue from an empty queue.");

        }
        E ret = data[front];
        data[front] = null;
        front =