public PriorityQueue(int initialCapacity,
             Comparator<? super E> comparator) {
    // Note: This restriction of at least one is not actually needed,
    // but continues for 1.5 compatibility
    if (initialCapacity < 1)
      throw new IllegalArgumentException();
    this.queue = new Object[initialCapacity];
    this.comparator = comparator;
  }

 public boolean offer(E e) {
    if (e == null)
      throw new NullPointerException();
    //記錄了隊(duì)列被修改的次數(shù)
    modCount++;
    int i = size;
    if (i >= queue.length)
      //擴(kuò)容
      grow(i + 1);
    //增加元素個(gè)數(shù)
    size = i + 1;
    if (i == 0) 
      //第一次添加元素，直接放到第0個(gè)位置即可
      queue[0] = e;
    else
      //需要將元素放到最后，再做上濾操作
      siftUp(i, e);
    return true;
  }

 private void grow(int minCapacity) {
    int oldCapacity = queue.length;
    // Double size if small; else grow by 50%
    int newCapacity = oldCapacity + ((oldCapacity < 64) ?
                     (oldCapacity + 2) :
                     (oldCapacity >> 1));
    // overflow-conscious code
    if (newCapacity - MAX_ARRAY_SIZE > 0)
      newCapacity = hugeCapacity(minCapacity);
    //元素拷貝
    queue = Arrays.copyOf(queue, newCapacity);

private static int hugeCapacity(int minCapacity) {
    if (minCapacity < 0) // overflow
      throw new OutOfMemoryError();
    return (minCapacity > MAX_ARRAY_SIZE) ?
      Integer.MAX_VALUE :
      MAX_ARRAY_SIZE;
  }

private void siftUpUsingComparator(int k, E x) {
    while (k > 0) {
      //計(jì)算父親節(jié)點(diǎn)的下標(biāo)
      int parent = (k - 1) >>> 1;
      Object e = queue[parent];
      //與父節(jié)點(diǎn)進(jìn)行比較
      if (comparator.compare(x, (E) e) >= 0)
        break;
      queue[k] = e;
      k = parent;
    }
    queue[k] = x;
  }

public E poll() {
    if (size == 0)
      return null;
    int s = --size;
    //自增變量，代表隊(duì)列修改次數(shù)
    modCount++;
    E result = (E) queue[0];
    E x = (E) queue[s];
    queue[s] = null;
    if (s != 0)
      siftDown(0, x);
    return result;
  }

 private void siftDownUsingComparator(int k, E x) {
 

    int half = size >>> 1;
    //這里k必須有孩子，故葉節(jié)點(diǎn)需要比較
    while (k < half) {
      //以下幾行代碼到較小的那個(gè)兒子,用變量c表示
      int child = (k << 1) + 1;
      //這里假設(shè)左兒子比較小
      Object c = queue[child];
      int right = child + 1;
      //左右兒子比較，如果右兒子小則將c賦值為右兒子
      if (right < size &&
        comparator.compare((E) c, (E) queue[right]) > 0)
        c = queue[child = right];
      //如果x比小兒子還小，說(shuō)明k就是正確位置
      if (comparator.compare(x, (E) c) <= 0)
        break;
      queue[k] = c;
      k = child;
    }
    queue[k] = x;
  }