- Java.util Package Classes
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
java.util.PriorityQueue.toArray() Method
Description
The toArray(T[] a) method is used to return an array containing all of the elements in this queue.
Declaration
Following is the declaration for java.util.PriorityQueue.toArray() method.
public <T> T[] toArray(T[] a)
Parameters
a − The array into which the elements of the queue are to be stored.
Return Value
The method call returns an array containing all of the elements in this queue.
Exception
ArrayStoreException − Throws if the runtime type of the specified array is not a supertype of the runtime type of every element in this queue.
NullPointerException − Throws if the specified array is null.
Example
The following example shows the usage of java.util.PriorityQueue.toArray()
package com.tutorialspoint; import java.util.*; public class PriorityQueueDemo { public static void main(String args[]) { // create priority queue PriorityQueue < Integer > prq = new PriorityQueue < Integer > (); // insert values in the queue prq.add(6); prq.add(9); prq.add(5); prq.add(64); prq.add(6); System.out.println("Priority queue values are: "+ prq); // create arr1 Integer[] arr1 = new Integer[5]; // use toArrsy() method Integer[] arr2 = prq.toArray(arr1); System.out.println("Value in arr1: "); for ( int i = 0; i<arr1.length; i++ ) { System.out.println("Value: " + arr1[i]) ; } System.out.println("Value in arr2: "); for ( int i = 0; i<arr2.length; i++ ) { System.out.println("Value: " + arr2[i]) ; } } }
Let us compile and run the above program, this will produce the following result.
Priority queue values are: [5, 6, 6, 64, 9] Value in arr1: Value: 5 Value: 6 Value: 6 Value: 64 Value: 9 Value in arr2: Value: 5 Value: 6 Value: 6 Value: 64 Value: 9
java_util_priorityqueue.htm
Advertisements