queue

queue

接口关系

• java.lang.Iterable<T>
  • java.util.Collection<E>
    • java.util.List<E>
    • java.util.Queue<E>
      • java.util.Deque<E> 

继承关系

• java.util.AbstractCollection<E> (implements java.util.Collection<E>)
  • java.util.AbstractList<E> (implements java.util.List<E>)
    • java.util.AbstractSequentialList<E>
      • java.util.LinkedList<E> (implements java.lang.Cloneable, java.util.Deque<E>, java.util.List<E>, java.io.Serializable)
    • java.util.ArrayList<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
    • java.util.Vector<E> (implements java.lang.Cloneable, java.util.List<E>, java.util.RandomAccess, java.io.Serializable)
      • java.util.Stack<E>
  • java.util.AbstractQueue<E> (implements java.util.Queue<E>)这里没有继承List
    • java.util.PriorityQueue<E> (implements java.io.Serializable)
  • java.util.AbstractSet<E> (implements java.util.Set<E>)
    • java.util.EnumSet<E> (implements java.lang.Cloneable, java.io.Serializable)
    • java.util.HashSet<E> (implements java.lang.Cloneable, java.io.Serializable, java.util.Set<E>)
      • java.util.LinkedHashSet<E> (implements java.lang.Cloneable, java.io.Serializable, java.util.Set<E>)
    • java.util.TreeSet<E> (implements java.lang.Cloneable, java.util.NavigableSet<E>, java.io.Serializable)
  • java.util.ArrayDeque<E> (implements java.lang.Cloneable, java.util.Deque<E>, java.io.Serializable)

queue 和deque(双端队列)

•  Each of these methods exists i n two forms: one throws an exception if the operation fails, the other returns a special value (either null or false, depending on the operation). The latter form of the insert operation is designed specifically for use with capacity-restricted Queue implementations; in most implementations, insert operations cannot fail.

  	Throws exception	Returns special value
  Insert	add(e)	offer(e)
  Remove	remove()	poll()
  Examine	element()	peek()

  
  

deque

First Element (Head)		Last Element (Tail)
	Throws exception	Special value	Throws exception	Special value
Insert	addFirst(e)	offerFirst(e)	addLast(e)	offerLast(e)
Remove	removeFirst()	pollFirst()	removeLast()	pollLast()
Examine	getFirst()	peekFirst()	getLast()	peekLast()

PriorityQueue

• 本质实现是堆这种数据结构，每次都取出最大值或最小值（最大堆最小堆）
• 使用优先级队列的主要是任务调度
• 和Treeset一样，实现比较有两种，一种是comparable接口，一种是comparotor