creates a priorityblockingqueue containing the given elements.note : if the specified iterable is a sortedset or a priorityqueue , this priority queue will be ordered according to the same ordering . concode_field_sep PlaceHolder placeHolder concode_field_sep SynchronousQueue<E> newSynchronousQueue concode_elem_sep ConcurrentLinkedQueue<E> newConcurrentLinkedQueue concode_elem_sep ConcurrentLinkedQueue<E> newConcurrentLinkedQueue concode_elem_sep PriorityQueue<E> newPriorityQueue concode_elem_sep PriorityQueue<E> newPriorityQueue concode_elem_sep Deque<E> synchronizedDeque concode_elem_sep LinkedBlockingDeque<E> newLinkedBlockingDeque concode_elem_sep LinkedBlockingDeque<E> newLinkedBlockingDeque concode_elem_sep LinkedBlockingDeque<E> newLinkedBlockingDeque concode_elem_sep LinkedBlockingQueue<E> newLinkedBlockingQueue concode_elem_sep LinkedBlockingQueue<E> newLinkedBlockingQueue concode_elem_sep LinkedBlockingQueue<E> newLinkedBlockingQueue concode_elem_sep ArrayDeque<E> newArrayDeque concode_elem_sep ArrayDeque<E> newArrayDeque concode_elem_sep ArrayBlockingQueue<E> newArrayBlockingQueue concode_elem_sep int drain concode_elem_sep int drainUninterruptibly concode_elem_sep Queue<E> synchronizedQueue
PriorityBlockingQueue < E > function ( Iterable < ? extends E > arg0 ) { if ( arg0 instanceof Collection ) { return new PriorityBlockingQueue < E > ( Collections2 . cast ( arg0 ) ) ; } PriorityBlockingQueue < E > loc0 = new PriorityBlockingQueue < E > ( ) ; Iterables . addAll ( loc0 , arg0 ) ; return loc0 ; }