public PriorityQueue(Collection<? extends E> c){
  if (c instanceof PriorityQueue) {
    getFromPriorityQueue((PriorityQueue<? extends E>)c);
  }
 else   if (c instanceof SortedSet) {
    getFromSortedSet((SortedSet<? extends E>)c);
  }
 else {
    initSize(c);
    addAll(c);
  }
}

public PriorityQueue ( Collection < ? extends E > c ) { if ( c instanceof PriorityQueue ) { getFromPriorityQueue ( ( PriorityQueue < ? extends E > ) c ) ; } else if ( c instanceof SortedSet ) { getFromSortedSet ( ( SortedSet < ? extends E > ) c ) ; } else { initSize ( c ) ; addAll ( c ) ; } }
constructs a priority queue that contains the elements of a collection . the constructed priority queue has the initial capacity of 110 % of the size of the collection . the queue uses natural ordering to order its elements .
