What is the fastest way to convert a Queue
into a List
while keeping the Queue order?
Answering to old question for users who are already on java 8
Java 8 provides the option of using streams and you can get a list from queue as:
For example:
Queue<Student> queue = new LinkedList<>();
Student s1 = new Student("A",2);
Student s2 = new Student("B",1);
Student s3 = new Student("C",3);
queue.add(s1);
queue.add(s2);
queue.add(s3);
List<Student> studentList = queue.stream().collect(Collectors.toCollection(ArrayList::new));
Queue queue = new LinkedList();
...
List list = new ArrayList(queue);
Google:
Queue fruitsQueue = new LinkedList();
fruitsQueue.add("Apples");
fruitsQueue.add("Bananas");
fruitsQueue.add("Oranges");
fruitsQueue.add("Grapes");
List fruitsList = new ArrayList(fruitsQueue);
The fastest is to use a LinkedList in the first place which can be used as a List or a Queue.
Queue q = new LinkedList();
List l = (List) q;
Otherwise you need to take a copy
List l = new ArrayList(q);
Note: When dealing with PriorityQueue, Use a loop, poll each element and add to list. PriorityQueue to List not maintaining the heap order.
If you're converting from PriorityQueue
to a List
, remember that it is in fact a heap, so the ordering is determined using the poll()
method, in which case, doing it by the constructor way as discussed in some of the other answers here, won't preserve the natural ordering of the queue.
Taking that into consideration, you can go along these lines:
List<E> result = new ArrayList<>(yourPriorityQueue.size());
while (!yourPriorityQueue.isEmpty()) {
result.add(yourPriorityQueue.poll());
}
Queue
To ArrayList
ConstructorThe easiest way to just create a ArrayList and pass your Queue as an argument in the constructor of ArrayList that takes a Collection. A Queue
is a Collection
, so that works.
This is the easiest way and I believe fastest way too.
List<?> list = new ArrayList<>( myQueue );