public PriorityQueue(SortedSet<? extends E> c){
  getFromSortedSet(c);
}

public PriorityQueue ( SortedSet < ? extends E > c ) { getFromSortedSet ( c ) ; }
constructs a priority queue that contains the elements of a sorted set . the constructed priority queue has the initial capacity of 110 % of the size of the sorted set . the priority queue will have the same comparator as the sorted set .
