Queue总结

Queue接口

声明:

public interface Queue<E> extends Collection<E>

方法：

boolean add(E e);//超出界限抛异常
boolean offer(E e);//超出界限直接返回false
E remove();//抛异常
E poll();//可返回空值
E element();//抛异常
E peek();//可返回空值

Deque接口

声明：

public interface Deque<E> extends Queue<E>

方法：

void addFirst(E e);
void addLast(E e);
boolean offerFirst(E e);
boolean offerLast(E e);
E removeFirst();
E removeLast();
E pollFirst();
E pollLast();
E getFirst();
E getLast();
E peekFirst();
E peekLast();
boolean removeFirstOccurrence(Object o);
boolean removeLastOccurrence(Object o);
boolean add(E e);
boolean offer(E e);
E remove();
E poll();
E element();
E peek();

//栈方法
void push(E e);
E pop();

boolean remove(Object o);
boolean contains(Object o);
public int size();
Iterator<E> iterator();
Iterator<E> descendingIterator();

实现类

AbstractQueue继承了AbstractCollection类，实现了Queue接口
PriorityQueue实现了Queue接口
LinkedList实现了Deque接口

PriorityQueue源码分析

声明：

public class PriorityQueue<E> extends AbstractQueue<E> implements java.io.Serializable

transient Object[] queue;

底层数据结构，基于数组实现

private final Comparator<? super E> comparator;

比较器，确定元素优先级
看构造方法：

public PriorityQueue();
public PriorityQueue(int initialCapacity);
public PriorityQueue(Comparator<? super E> comparator);
public PriorityQueue(int initialCapacity, Comparator<? super E> comparator);
public PriorityQueue(Collection<? extends E> c);
public PriorityQueue(PriorityQueue<? extends E> c);
public PriorityQueue(SortedSet<? extends E> c);

看其他方法：

public boolean add(E e);
public boolean offer(E e);
public E peek();
public boolean remove(Object o);
public boolean contains(Object o);
public Object[] toArray();
public <T> T[] toArray(T[] a);
public Iterator<E> iterator();
public int size();
public void clear();
public E poll();
public Comparator<? super E> comparator();
public final Spliterator<E> spliterator();

综上可知，PriorityQueue底层基于数组实现，利用比较器确定元素入队优先级，出队、删除操作伴随着数组的前移，故效率不高