Serializable, Iterable<E>, Collection<E>, Queue<E>

public class PriorityQueue<E>
extends AbstractQueue<E>
implements Serializable
{
   //
}
  

1.5

Serialized Form

Creates a PriorityQueue with the default initial capacity (11) that orders its elements according to their natural ordering.

Creates a PriorityQueue containing the elements in the specified collection.

Creates a PriorityQueue with the specified initial capacity that orders its elements according to their natural ordering.

Creates a PriorityQueue with the specified initial capacity that orders its elements according to the specified comparator.

Creates a PriorityQueue containing the elements in the specified priority queue.

Creates a PriorityQueue containing the elements in the specified sorted set.

Inserts the specified element into this priority queue.

Removes all of the elements from this priority queue.

Returns the comparator used to order the elements in this queue, or null if this queue is sorted according to the natural ordering of its elements.

Returns true if this queue contains the specified element.

Returns an iterator over the elements in this queue.\

Inserts the specified element into this priority queue.

Retrieves, but does not remove, the head of this queue, or returns null if this queue is empty.

Retrieves and removes the head of this queue, or returns null if this queue is empty.

Removes a single instance of the specified element from this queue, if it is present.

Returns the number of elements in this collection.

Returns an array containing all of the elements in this queue.

Returns an array containing all of the elements in this queue; the runtime type of the returned array is that of the specified array.

Adds all of the elements in the specified collection to this queue. Attempts to addAll of a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.

Retrieves, but does not remove, the head of this queue. This method differs from peek only in that it throws an exception if this queue is empty.

Retrieves and removes the head of this queue. This method differs from poll only in that it throws an exception if this queue is empty.

Returns true if this collection contains all of the elements in the specified collection.

Returns true if this collection contains no elements.

This implementation returns size() == 0.

Removes all of this collection's elements that are also contained in the specified collection (optional operation). After this call returns, this collection will contain no elements in common with the specified collection.

Retains only the elements in this collection that are contained in the specified collection (optional operation). In other words, removes from this collection all of its elements that are not contained in the specified collection.

Returns true if this collection contains all of the elements in the specified collection.

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Recent Posts

Beginners java programming examples

Java program to find largest number in an array

Java program to find second largest number in an array

Java program to find largest and second largest in an array

Find the index of the largest number in an array

find largest and smallest number in an array in java

find the second smallest number in an array in java

Find the index of the smallest number in an array

Spring mvc hello world example for beginners

Spring MVC tutorial with examples